10.7模拟赛

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=51;
ll n,m,fac[N];

inline ll Calc(ll i,ll j,ll ii,ll jj) {
    ll res=0;
    for(ll k=1;k<=i;++k) res=res*10+((k==j)?jj:ii); //,printf("%lld ",res);
    return res;
}

int main()
{
    freopen("odometer.in","r",stdin);
    freopen("odometer.out","w",stdout);
    fac[0]=1; for(ll i=1;i<=16;++i) fac[i]=fac[i-1]*10;
    scanf("%lld%lld",&n,&m); //printf("%lld %lld\n",n,m);
    ll ans=0;
    for(ll i=3,ti=100;ti<=m;++i,ti*=10) {
        for(ll j=1;j<=i;++j) for(ll ii=0;ii<=9;++ii) for(ll jj=0;jj<=9;++jj) {
            if(ii==jj || (!jj && j==1) || (!ii && j!=1)) continue;
            ll t=Calc(i,j,ii,jj);
            if(t>=n && t<=m)  ++ans;
//            printf("#%lld %lld %lld %lld: %lld: %lld\n",i,j,ii,jj,t,ans);
        }
    }
    printf("%lld\n",ans);
    return 0;
}

 

 

 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=(1<<20)+11;
ll n,sum;
double a[N],dp[N];
int main()
{
    freopen("gift.in","r",stdin);
    freopen("gift.out","w",stdout);
    scanf("%lld",&n);
    for(ll i=1,x;i<=n;++i) scanf("%lf%lld",&a[i],&x),sum+=x;
    printf("%lld\n",sum);
    dp[(1<<n)-1]=0;
    for(ll i=(1<<n)-2;i>=0;--i) {
        double tmp=0.0;
        for(ll j=0;j<n;++j) if(!((i>>j)&1)) dp[i]+=dp[i^(1<<j)]*a[j+1],tmp+=a[j+1];
        dp[i]=(dp[i]+1.0)/tmp;
    }
    printf("%.3lf\n",dp[0]);
    return 0;
}

 

 

 

 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll re_ad() {
    char ch=getchar(); ll x=0,f=1;
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}

const ll N=5e4+11,M=1e5+11,inf=0x3f3f3f3f3f3f3f3f;
ll n,m;
ll fr[M],to[M],nxt[M],w[M],edge,head[N];
ll dfn[N],low[N],tot,top,sta[N],cnt,tag[N];
ll medge,mx[N],my[N],mz[N],dis[N];
bool vis[N];
struct Edge { ll x,y,z; }e[M];
inline void addedge(ll x,ll y,ll z) { ++edge,fr[edge]=x,to[edge]=y,nxt[edge]=head[x],w[edge]=z,head[x]=edge; }

inline void Init() {
    edge=cnt=tot=top=cnt=0;
    memset(fr,0,sizeof(fr));
    memset(to,0,sizeof(to));
    memset(nxt,0,sizeof(nxt));
    memset(w,0,sizeof(w));
    memset(head,0,sizeof(head));
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));
    memset(sta,0,sizeof(sta));
    memset(vis,false,sizeof(vis));
    memset(tag,0,sizeof(tag));
    memset(dis,0,sizeof(dis));
}
inline void initm() {
    medge=0;
    memset(mx,0,sizeof(mx));
    memset(my,0,sizeof(my));
    memset(mz,0,sizeof(mz));
}
inline void inite() {
    edge=0;
    memset(head,0,sizeof(head));
    memset(fr,0,sizeof(fr));
    memset(to,0,sizeof(to));
    memset(nxt,0,sizeof(nxt));
    memset(w,0,sizeof(w));
}

void tarjan(int d) {
    dfn[d]=low[d]=++tot,sta[++top]=d,vis[d]=true;
    for(int i=head[d],u;i;i=nxt[i]) {
        u=to[i];
        if(!dfn[u]) tarjan(u),low[d]=min(low[d],low[u]);
        else if(vis[u]) low[d]=min(low[d],dfn[u]);
    }
    if(low[d]!=dfn[d]) return ;
    tag[d]=++cnt;
    while(sta[top]!=d) tag[sta[top]]=cnt,vis[sta[top]]=false,--top;
    vis[d]=false,--top;
}
inline void Rebuild() {
    initm();
    for(ll i=1;i<=m;++i) {
        ll fx=tag[fr[i]],fy=tag[to[i]];
        if(fx!=fy) ++medge,mx[medge]=fx,my[medge]=fy,mz[medge]=w[i];
    }
    inite();
    for(ll i=1;i<=medge;++i) addedge(mx[i],my[i],mz[i]);
}

inline void Solve(ll d) {
    memset(dis,0x3f,sizeof(dis)); dis[d]=0; ll ans=0;
    for(ll i=1;i<=cnt;++i) for(ll j=head[i];j;j=nxt[j]) dis[to[j]]=min(dis[to[j]],w[j]); //,printf("edge: %lld %lld\n",fr[i],to[i]);
    for(ll i=1;i<=cnt;++i) if(i!=d) ans+=dis[i];
    printf("%lld\n",ans);
}

int main()
{
    freopen("message.in","r",stdin);
    freopen("message.out","w",stdout);
    while(1) {
        n=re_ad(),m=re_ad(); if(!n && !m) break; Init();
        for(ll i=1,x,y,z;i<=m;++i) x=re_ad(),y=re_ad(),z=re_ad(),addedge(x+1,y+1,z);
        for(ll i=1;i<=n;++i) if(!dfn[i]) tarjan(i);
        Rebuild(),Solve(tag[1]);
//        printf("tag: "); for(ll i=1;i<=n;++i) printf("%lld ",tag[i]); puts("");
    }
    return 0;
}

 

 

 

 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll re_ad() {
    char ch=getchar(); ll x=0,f=1;
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}

const ll N=5e5+11,Tree_Sz=1e6+11,inf=0x3f3f3f3f3f3f3f3f;
ll n,ans,a[N],maxx[N],tmx,minn[N],tmn;
struct Point {
    ll x,y;
    bool operator < (const Point &B) const { return x<B.x; }
}pt[N];

namespace ST {
    struct Node {
        ll val,tag,cnt;
        Node() { tag=cnt=0; val=inf; }
        Node operator + (const Node &B) {
            Node res;
            if(val==B.val) res.val=val,res.cnt=cnt+B.cnt;
            else if(val<B.val) res.val=val,res.cnt=cnt;
            else res.val=B.val,res.cnt=B.cnt;
            return res;
        }
    }t[Tree_Sz];
    inline void Pushup(ll d) { t[d]=t[d<<1]+t[d<<1|1]; }
    inline void Pushdown(ll d) {
        t[d<<1].tag+=t[d].tag,t[d<<1|1].tag+=t[d].tag;
        t[d<<1].val+=t[d].tag,t[d<<1|1].val+=t[d].tag;
        t[d].tag=0;
    }
    void modify(ll d,ll l,ll r,ll x,ll y,ll z) {
        if(x<=l && r<=y) { t[d].val+=z,t[d].tag+=z; return ; }
        Pushdown(d); ll mid=(l+r)>>1;
        if(x<=mid) modify(d<<1,l,mid,x,y,z);
        if(y>=mid+1) modify(d<<1|1,mid+1,r,x,y,z);
        Pushup(d);
    }
    inline void Modify(ll x,ll y,ll z) { modify(1,1,n,x,y,z); }
    void change(ll d,ll l,ll r,ll x,ll z) {
        if(l==r) { t[d].val=z,t[d].cnt=1; return ; }
        Pushdown(d); ll mid=(l+r)>>1;
        if(x<=mid) change(d<<1,l,mid,x,z);
        else change(d<<1|1,mid+1,r,x,z);
        Pushup(d);
    }
    inline void Change(ll x,ll z) { change(1,1,n,x,z); }
/*
    Node query(ll d,ll l,ll r,ll x,ll y) {
        if(x<=l && r<=y) return t[d];
        Pushdown(d); ll mid=(l+r)>>1; Node res;
        if(x<=mid) res=res+query(d<<1,l,mid,x,y);
        if(y>=mid+1) res=res+query(d<<1|1,mid+1,r,x,y);
        return res;
    }
*/
    inline void Query() { ans+=t[1].cnt; }
}

int main()
{
    freopen("raid.in","r",stdin);
    freopen("raid.out","w",stdout);
    n=re_ad();
    for(ll i=1;i<=n;++i) pt[i].x=re_ad(),pt[i].y=re_ad();
    sort(pt+1,pt+n+1);
    for(ll i=1;i<=n;++i) a[i]=pt[i].y;
    for(ll r=1;r<=n;++r) {
        while(tmx && a[r]>a[maxx[tmx]]) ST::Modify(maxx[tmx-1]+1,maxx[tmx],a[r]-a[maxx[tmx]]),--tmx;
        while(tmn && a[r]<a[minn[tmn]]) ST::Modify(minn[tmn-1]+1,minn[tmn],a[minn[tmn]]-a[r]),--tmn;
        maxx[++tmx]=r,minn[++tmn]=r,ST::Change(r,r),ST::Query();
    }
    printf("%lld\n",ans);
    return 0;
}