[Ceoi2016]router

试着打了打 幸好A了 不然就尴尬了 T_T 因为没有std可以看啊 也很难调啊
没想到居然打了那么短233 （删了读优更短

题解链接： http://pan.baidu.com/s/1pLwWY7L 密码：l62w

#include<bits/stdc++.h>
using namespace std;
const int N=5e5+2;
char B[1<<14],*S=B,*T=B;
#define gc (S==T&&(T=(S=B)+fread(B,1,1<<14,stdin),S==T)?-1:*S++)
inline int read(){
    int x=0,f=1; char ch=gc;
    while(ch<'0' || ch>'9'){if(ch=='-')f=-1; ch=gc;}
    while(ch>='0' && ch<='9'){x=(x<<1)+(x<<3)+ch-'0'; ch=gc;}
    return x*f;
}
struct edge{int x,y;}ans[N]; int len;
inline void ins(int x,int y){
    ans[++len]=(edge){x,y};
}
int id,n,k;
void solve(int l,int r,vector<int>v){
    vector<int>a,b; int i;
    if(l==r){
        for(i=(l-1)*4+1;i<=min(l*4,n);++i)
            ins(v[0],n+i);
        return;
    }
    int mid=(l+r)>>1;
    for(i=l;i<=r;++i){
        ++id; ins(v[i-l],id);
        if(i<=mid){
            a.push_back(id);
            int x=r-(i-l);
            if(x==i)ins(v[i-l],id+1);
            else ins(v[x-l],id);
        }
        else{
            b.push_back(id);
            int x=r-(i-l);
            ins(v[x-l],id);
        }
    }
    solve(l,mid,a),solve(mid+1,r,b);
}
vector<int>a;
int main(){
    n=read(); int m=read(),p=read(),i;
    id=(n<<1); k=0;
    for(i=1;i<=n;++i){
        if((i-1)%4==0)++id,++k,a.push_back(id);
        ins(i,id);
    }
    solve(1,k,a);
    printf("%d %d\n",id,len);
    for(i=1;i<=len;++i) printf("%d %d\n",ans[i].x,ans[i].y);
    return 0;
}