Submission #38007837

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(register int i=j;i<=k;++i)
#define g(i,j,k) for(register int i=j;i>=k;--i)
int n,m,s,l;
const int maxn=505050;
const int inf=1e15+225;
struct Splay{
	int f[maxn],ch[maxn][2],siz[maxn],mark[maxn],key[maxn],root,sz,m=0;
	int data[maxn];
	inline int get(int x){return ch[f[x]][1]==x;}
	inline void update(int x){siz[x]=siz[ch[x][1]]+siz[ch[x][0]]+1;}
	inline void swap(int &x,int &y){int t=x;x=y;y=t;}
	inline void pushdown(int x){
	    if(x&&mark[x]){
	        mark[ch[x][0]]^=1;
	        mark[ch[x][1]]^=1;
	        swap(ch[x][0],ch[x][1]);
	        mark[x]=0;
	    }
	}
	inline void rot(int x){
	    int k=get(x),fa=f[x],fafa=f[fa];
	    pushdown(fa);pushdown(x);
	    ch[fa][k]=ch[x][!k];f[ch[x][!k]]=fa;
	    ch[x][!k]=fa;f[fa]=x;
	    f[x]=fafa;
	    if (fafa) ch[fafa][ch[fafa][1]==fa]=x;
	    update(fa);update(x);
	}
	inline void splay(int x,int tar){
	    for(int fa;(fa=f[x])!=tar;rot(x))
	        if(f[fa]!=tar)
	        rot(get(fa)==get(x)?fa:x);
	    if (!tar)root=x;
	}
	inline int build(int fa,int l,int r){
	    if(l>r)return 0;
	    int mid=(l+r)>>1;
	    int now=++sz;
	    key[now]=data[mid],f[now]=fa,mark[now]=0;
	    ch[now][0]=build(now,l,mid-1);
	    ch[now][1]=build(now,mid+1,r);
	    update(now);
	    return now;
	}
	inline int findx(int k){
	    int now=root;
	    while(1){
	        pushdown(now);
	        if (k<=siz[ch[now][0]])
	            now=ch[now][0];
	        else{
	            k-=siz[ch[now][0]]+1;
	            if (!k) return now;
	            now=ch[now][1];
	        }
	    }
	}
	inline void print(int now,int*a){
	    pushdown(now);
	    if (ch[now][0]) print(ch[now][0],a);
	    if (key[now]!=-inf && key[now]!=inf)a[++m]=key[now];
	    if (ch[now][1]) print(ch[now][1],a);
	}
	inline void init(int n){
		for(int i=1;i<=n;i++)data[i+1]=i;
    	data[1]=-inf,data[n+2]=inf;
    	root=build(0,1,n+2);
	}
	inline void fz(int x,int y){
		int x1=findx(x),y1=findx(y+2);
        splay(x1,0);
        splay(y1,x1);
        mark[ch[ch[root][1]][0]]^=1;
	}
	inline void set(int*a){print(root,a);}
}W,H;
int a[maxn],b[maxn];
string c[maxn];
signed main(){
	cin>>n>>m;
	f(i,1,n)cin>>c[i];
	W.init(n);H.init(m);
	cin>>s;
	int x,y;
	f(i,1,s){
		scanf("%lld %lld",&x,&y);
		W.fz(1,x);W.fz(x+1,n);
		H.fz(1,y);H.fz(y+1,m);
	}
	W.set(a);H.set(b);
	f(i,1,n){
		f(j,1,m)putchar(c[a[i]][b[j]-1]);
		putchar('\n');
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:84:4: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   84 |  f(i,1,n)cin>>c[i];
      |    ^
./Main.cpp:4:35: note: in definition of macro ‘f’
    4 | #define f(i,j,k) for(register int i=j;i<=k;++i)
      |                                   ^
./Main.cpp:88:4: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   88 |  f(i,1,s){
      |    ^
./Main.cpp:4:35: note: in definition of macro ‘f’
    4 | #define f(i,j,k) for(register int i=j;i<=k;++i)
      |                                   ^
./Main.cpp:94:4: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   94 |  f(i,1,n){
      |    ^
./Main.cpp:4:35: note: in definition of macro ‘f’
    4 | #define f(i,j,k) for(register int i=j;i<=k;++i)
      |                                   ^
./Main.cpp:95:5: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   95 |   f(j,1,m)putchar(c[a[i]][b[j]-1]);
      |     ^
./Main.cpp:4:35: note: in definition of macro ‘f’
    4 | #define f(i,j,k) for(register int i=j;i<=k;++i)
      |                                   ^
./Main.cpp:89:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   89 |   scanf("%lld %lld",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Judge Result