NOIP模拟9.27

2013提高D1
A.转圈游戏（快速幂）AC
B.火柴人排队（树状数组求逆序对）AC
C.货车运输（贪心+并查集+树上倍增）AC

A

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,k,x;
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();k=read();x=read();ll base=10,ans=1;
    for(;k;k>>=1,base=base*base%n)
        if(k&1) ans=ans*base%n;
    ans=(ans*m+x)%n;
    printf("%lld\n",ans);
    return 0;
}

B

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define mod 99999997
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct node{
    int x,pos;
}aa[N],bb[N];
int n,a[N],c[N];
ll ans=0;
inline bool cmp(node x,node y){
    return x.x<y.x;
}
inline int lowbit(int x){return x&(-x);}
inline void add(int x,int val){
    for(;x<=n;x+=lowbit(x)) c[x]+=val;
}
inline int qsum(int x){
    int res=0;
    for(;x;x-=lowbit(x)) res+=c[x];return res;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();
    for(int i=1;i<=n;++i) aa[i].x=read(),aa[i].pos=i;
    for(int i=1;i<=n;++i) bb[i].x=read(),bb[i].pos=i;
    sort(aa+1,aa+n+1,cmp);sort(bb+1,bb+n+1,cmp);
    for(int i=1;i<=n;++i) a[bb[i].pos]=aa[i].pos;
    for(int i=n;i>=1;--i){
        ans=(ans+qsum(a[i]))%mod;add(a[i],1);
    }
    printf("%lld\n",ans);
    return 0;
}

C

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 10010
#define M 50010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,f[N],fa[N][17],h[N],num=0,bel[N],dep[N],mn[N][17],Log[N];
struct edge{
    int to,next,val;
}data[N<<1];
struct Edge{
    int x,y,val;
}e[M];
inline bool cmp(Edge x,Edge y){return x.val>y.val;}
inline int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
inline void add(int x,int y,int val){
    data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].val=val;
    data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].val=val;
}
void dfs(int x,int tp){
    bel[x]=tp;
    for(int i=1;i<=Log[n];++i){
        if(!fa[x][i-1]) break;
        fa[x][i]=fa[fa[x][i-1]][i-1];
        mn[x][i]=min(mn[x][i-1],mn[fa[x][i-1]][i-1]);
    }
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;if(fa[x][0]==y) continue;
        fa[y][0]=x;dep[y]=dep[x]+1;mn[y][0]=data[i].val;dfs(y,tp);
    }
}
int lca(int x,int y){
    if(dep[x]<dep[y]) swap(x,y);
    int d=dep[x]-dep[y];
    for(int i=0;i<=Log[d];++i)
        if(d&(1<<i)) x=fa[x][i];
    if(x==y) return x;
    for(int i=Log[n];i>=0;--i)
        if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];
    return fa[x][0];
}
int calc(int x,int y){
    int d=dep[x]-dep[y],res=inf;
    for(int i=0;i<=Log[d];++i)
        if(d&(1<<i)){
            res=min(res,mn[x][i]);x=fa[x][i];
        }
    return res;
}
int main(){
//  freopen("b2.in","r",stdin);
//  freopen("b.out","w",stdout);
    n=read();m=read();
    for(int i=1;i<=m;++i) e[i].x=read(),e[i].y=read(),e[i].val=read();
    sort(e+1,e+m+1,cmp);Log[0]=-1;
    for(int i=1;i<=n;++i) f[i]=i,Log[i]=Log[i>>1]+1;
    for(int i=1;i<=m;++i){
        int xx=find(e[i].x),yy=find(e[i].y);
        if(xx!=yy){
            f[xx]=yy;add(e[i].x,e[i].y,e[i].val);
        }
    }
    for(int i=1;i<=n;++i) if(!dep[i]) dfs(i,i);int q=read();
    while(q--){
        int x=read(),y=read();
        if(bel[x]!=bel[y]) puts("-1");
        else{
            int t=lca(x,y);
            printf("%d\n",min(calc(x,t),calc(y,t)));
        }
    }
    return 0;
}