SOL
注意到每次离队只涉及某一行以及最后一列
于是可以考虑维护n+1棵线段树,动态开点即可
前n棵维护每行前m-1个数
第n+1棵维护第m列的数
每次(x,y)离队
如果y=m,直接丢到第n+1棵线段树最后
否则先丢到第x棵线段树最后,转为(x,m)离队之后再执行上述操作
代码:
#include<bits/stdc++.h>
using namespace std;
#define re register
#define ll long long
inline char nc(){
static char buf[10000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,10000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
int re data=0;static char ch=0;ch=nc();
while(!isdigit(ch))ch=nc();
while(isdigit(ch))data=(data<<1)+(data<<3)+(ch^48),ch=nc();
return data;
}
const int N=3e5+5;
int n,m,q,mx,rt[N],cnt,siz[N<<5],lc[N<<5],rc[N<<5];
vector<ll>g[N];
inline int query(int l,int r,int p,int x){
if(l==r)return l;
int re mid=l+r>>1,y=mid-l+1-siz[lc[p]];
if(x<=y)return query(l,mid,lc[p],x);
else return query(mid+1,r,rc[p],x-y);
}
inline void del(int l,int r,int &p,int x){
if(!p)p=++cnt;++siz[p];
if(l==r)return;
int re mid=l+r>>1;
if(x<=mid)del(l,mid,lc[p],x);
else del(mid+1,r,rc[p],x);
}
inline ll del_line(int x,int y){
int re pos=query(1,mx,rt[x],y);
del(1,mx,rt[x],pos);
return pos<m?1ll*(x-1)*m+pos:g[x][pos-m];
}
inline ll del_row(int x){
int re pos=query(1,mx,rt[n+1],x);
del(1,mx,rt[n+1],pos);
return pos<=n?1ll*(pos-1)*m+m:g[n+1][pos-n-1];
}
signed main(){
n=rd(),m=rd(),q=rd(),mx=max(n,m)+q;
for(int re i=1;i<=q;++i){
int re x=rd(),y=rd();
if(y==m){
ll re pos=del_row(x);
g[n+1].push_back(pos);
printf("%lld\n",pos);
}else{
ll re pos1=del_line(x,y);g[n+1].push_back(pos1);
ll re pos2=del_row(x);g[x].push_back(pos2);
printf("%lld\n",pos1);
}
}exit(0);
}