Submission #70494339

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define INF (int)(1e9)
#define pii pair<int,int>
#define fir first
#define sec second

inline int read(){
   char ch=getchar(); int f=1;
   while(ch>'9'||ch<'0'){ if(ch=='-') f=-1; ch=getchar();}
   int sum=ch-'0';
   while((ch=getchar())>='0'&&ch<='9') sum=(sum<<3)+(sum<<1)+(ch^48);
   return sum*f;
}
inline void chkmax(int &x,int y){x=x<y?y:x;}
inline void chkmin(int &x,int y){x=y<x?y:x;}
int qpow(int a,int b,int p){
	int ret=1;
	while(b){
		if(b&1) ret=ret*a%p;
		a=a*a%p;
		b>>=1;
	}
	return ret;
}
const int N=2e6+9,M=2e5+9;
const int MOD=1e9+7;

int n,m,tot,tag[N];
map<pii,int> mp;
int qt;
struct node{int u,v,id;} q[N];
vector<int> G[N]; 
int fa[N],f[N][30],dep[N];
int find(int u){ return fa[u]==u?u:fa[u]=find(fa[u]); }
void dfs(int u,int fa){
	f[u][0]=fa; dep[u]=dep[fa]+1;
	chkmin(tag[u],tag[fa]);
	for(register int j=1;j<=29;++j) f[u][j]=f[f[u][j-1]][j-1];
	for(auto v:G[u]) dfs(v,u); 
}
int lca(int u,int v){
	if(dep[u]>dep[v]) swap(u,v);
	for(register int j=29;j>=0;--j)
		if(dep[f[v][j]]>=dep[u])
			v=f[v][j];
	if(u==v) return u;
	for(register int j=29;j>=0;--j)
		if(f[u][j]!=f[v][j])
			u=f[u][j],v=f[v][j];
	return f[u][0];
}
signed main(){
	n=read(),m=read();
	tag[0]=INF;
	for(register int i=1;i<=2*n;++i) fa[i]=i,tag[i]=INF;
	tot=n;
	for(register int i=1;i<=m;++i){
		int op=read();
		if(op==1){
			int u=read(),v=read();
            if(u>v) swap(u,v);
			mp[{u,v}]=1;
			u=find(u),v=find(v);
			if(u!=v){
				fa[u]=fa[v]=++tot;
				G[tot].emplace_back(u); G[tot].emplace_back(v);
			}
		} 
		if(op==2){
			int x=read(),y=read(); x=find(x);
			chkmin(tag[x],i); 
		}
		if(op==3){
			int u=read(),v=read();
            if(u>v) swap(u,v);
			if(mp[{u,v}]) q[++qt]={u,v,-1};
			else q[++qt]={u,v,i}; 
		}
	}
	for(register int i=1;i<=tot;++i)
		if(find(i)==i) dfs(i,0);
	for(register int i=1;i<=qt;++i){
		int u=q[i].u,v=q[i].v,id=q[i].id;
		if(id==-1){
            putchar('Y'); putchar('e'); putchar('s');
            putchar('\n');
        }
		else if(find(u)!=find(v)){
            putchar('N'); putchar('o');
            putchar('\n');
        }
		else{
			int tmp=lca(u,v);
			if(tag[tmp]<=id){
                putchar('Y'); putchar('e'); putchar('s');
                putchar('\n');
            }
			else{
                putchar('N'); putchar('o');
                putchar('\n');
            }
		}
	}
}

Submission Info

Compile Error

Main.cpp: In function ‘void dfs(int, int)’:
Main.cpp:39:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   39 |         for(register int j=1;j<=29;++j) f[u][j]=f[f[u][j-1]][j-1];
      |                          ^
Main.cpp: In function ‘int lca(int, int)’:
Main.cpp:44:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   44 |         for(register int j=29;j>=0;--j)
      |                          ^
Main.cpp:48:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   48 |         for(register int j=29;j>=0;--j)
      |                          ^
Main.cpp: In function ‘int main()’:
Main.cpp:56:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   56 |         for(register int i=1;i<=2*n;++i) fa[i]=i,tag[i]=INF;
      |                          ^
Main.cpp:58:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   58 |         for(register int i=1;i<=m;++i){
      |                          ^
Main.cpp:71:38: warning: unused variable ‘y’ [-Wunused-variable]
   71 |                         int x=read(),y=read(); x=find(x);
      |                                      ^
Main.cpp:81:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   81 |         for(register int i=1;i<=tot;++i)
      |                          ^
Main.cpp:83:26: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   83 |         for(register int i=1;i<=qt;++i){
      |                          ^

Judge Result