oj.uz

Submission #543011

# Submission time Handle Problem Language Result Execution time Memory
543011 2022-03-28T20:17:04 Z codr0 Long Mansion (JOI17_long_mansion) C++14
25 / 100
 3000 ms 50248 KB 
// Code by Parsa Eslami
 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define bit(i,j) ((j>>i)&1)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define S second
#define F first
#define pb push_back
#define SZ(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define err(x) cout<<#x<<": "<<x<<'\n';
 
using namespace std;
const int N=5e5+4;
vector<int> vc;
int X[N];
int n;
bool er[N];
int L[N],R[N];
int l[N],r[N];
int pr[N],nxt[N];
int dsu[N];
int to[N];
 
	int parent(int v){
		if(dsu[v]<0) return v;
		return (dsu[v]=parent(dsu[v]));
	}

	void join(int a,int b){
		int u=a;
		int v=b;
		u=parent(u); v=parent(v);
		//if(u==v) return;
		if(dsu[u]<dsu[v]) swap(u,v);
		dsu[v]+=dsu[u]; dsu[u]=v;
		to[v]=b;
		pr[b]=pr[a];
	}

	void dol(){
		for(int i:vc){
			int X=l[i];
			while(1){
				int Y=to[parent(l[i])];
				int z=pr[Y];
				if(z==0) break;
				if(R[z]&&R[z]<=r[i]){
					l[i]=l[z];
				}else break;
			}
			er[i]=(l[i]==X);
		}
	}
 
	void dor(){
		FORR(j,SZ(vc)-1,0){
			int i=vc[j];
			int X=r[i];
			while(1){	
				int Y=to[parent(r[i])];
				int z=nxt[Y];
				if(z==n+1) break;
				if(L[z]&&L[z]>=l[i]){
					r[i]=r[z];
				}else break;
			}
			er[i]=(r[i]==X);
		}
	}
 
	void Main(){
		cin>>n;
		FOR(i,1,n) dsu[i]=-1,to[i]=i;
		FOR(i,1,n) nxt[i]=i+1,pr[i]=i-1;
		int C[n+1]={};
		FOR(i,1,n-1) cin>>C[i];
		vector<int> B[N];
		FOR(i,1,n){
			int sz; cin>>sz;
			FOR(j,1,sz){
				int x0; cin>>x0;
				B[i].pb(x0);
			}
		}
		FOR(i,1,n){
			if(i!=1&&X[C[i-1]]){
				L[i]=X[C[i-1]];
			}
			FOR(j,0,SZ(B[i])-1){
				X[B[i][j]]=i;
			}
		}
		FOR(i,1,n){
			FOR(j,0,SZ(B[i])-1){
				X[B[i][j]]=0;
			}
		}
		FORR(i,n,1){
			if(i!=n&&X[C[i]]){
				R[i]=X[C[i]];
			}
			FOR(j,0,SZ(B[i])-1){
				X[B[i][j]]=i;
			}	
		}
		FOR(i,1,n) l[i]=r[i]=i;
		FOR(i,1,n) vc.pb(i); dor(); dol(); dor(); dol();
		while(!vc.empty()){
			bool is[N]={};
			for(int u0:vc) is[u0]=1;
			FOR(i,0,SZ(vc)-2){
				if(to[parent(r[vc[i]])]>=vc[i+1]&&to[parent(l[vc[i+1]])]<=vc[i]){
					is[vc[i]]=0;;
					join(vc[i],vc[i+1]);
				}
				i++;
			}
			vc.clear(); FOR(i,1,n) if(is[i]&&!er[i]) vc.pb(i);
			dor();
			dol();
			dor();
			dol();
		}
		int q; cin>>q;
		while(q--){
			int u,v;  cin>>u>>v;
			bool ans;
			if(u<v){
				ans=(r[to[parent(u)]]>=v);
			}else ans=(v>=l[to[parent(u)]]);
			cout<<(ans?"YES\n":"NO\n");
		}
	}
 
	int32_t main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
 
	int T=1;
	while(T--) Main();
 
	return 0;
	}

Compilation message

long_mansion.cpp: In function 'void Main()':
long_mansion.cpp:6:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
    6 | #define FOR(i,a,b) for(int i=a;i<=b;i++)
      |                    ^~~
long_mansion.cpp:110:3: note: in expansion of macro 'FOR'
  110 |   FOR(i,1,n) vc.pb(i); dor(); dol(); dor(); dol();
      |   ^~~
long_mansion.cpp:110:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  110 |   FOR(i,1,n) vc.pb(i); dor(); dol(); dor(); dol();
      |                        ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12756 KB Output is correct
2 Correct 9 ms 12884 KB Output is correct
3 Correct 10 ms 13008 KB Output is correct
4 Correct 9 ms 12756 KB Output is correct
5 Correct 9 ms 12756 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 14 ms 12780 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12756 KB Output is correct
2 Correct 9 ms 12884 KB Output is correct
3 Correct 10 ms 13008 KB Output is correct
4 Correct 9 ms 12756 KB Output is correct
5 Correct 9 ms 12756 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 14 ms 12780 KB Output is correct
8 Correct 100 ms 14284 KB Output is correct
9 Correct 89 ms 14256 KB Output is correct
10 Correct 94 ms 14400 KB Output is correct
11 Correct 98 ms 14768 KB Output is correct
12 Correct 86 ms 14416 KB Output is correct
13 Correct 96 ms 14448 KB Output is correct
14 Correct 97 ms 14524 KB Output is correct
15 Correct 92 ms 14472 KB Output is correct
16 Correct 95 ms 14800 KB Output is correct
17 Correct 96 ms 14416 KB Output is correct
18 Correct 93 ms 14480 KB Output is correct
19 Correct 94 ms 14536 KB Output is correct
20 Correct 92 ms 14656 KB Output is correct
21 Correct 90 ms 14724 KB Output is correct
22 Correct 94 ms 14540 KB Output is correct
23 Correct 98 ms 14356 KB Output is correct
24 Correct 96 ms 14280 KB Output is correct
25 Correct 102 ms 14324 KB Output is correct
26 Correct 97 ms 14232 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 22076 KB Output is correct
2 Correct 178 ms 22176 KB Output is correct
3 Correct 160 ms 22212 KB Output is correct
4 Correct 176 ms 22100 KB Output is correct
5 Correct 170 ms 22060 KB Output is correct
6 Correct 155 ms 21668 KB Output is correct
7 Correct 141 ms 21860 KB Output is correct
8 Correct 155 ms 21840 KB Output is correct
9 Correct 148 ms 21864 KB Output is correct
10 Correct 170 ms 21908 KB Output is correct
11 Correct 139 ms 21788 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12756 KB Output is correct
2 Correct 9 ms 12884 KB Output is correct
3 Correct 10 ms 13008 KB Output is correct
4 Correct 9 ms 12756 KB Output is correct
5 Correct 9 ms 12756 KB Output is correct
6 Correct 9 ms 12756 KB Output is correct
7 Correct 14 ms 12780 KB Output is correct
8 Correct 100 ms 14284 KB Output is correct
9 Correct 89 ms 14256 KB Output is correct
10 Correct 94 ms 14400 KB Output is correct
11 Correct 98 ms 14768 KB Output is correct
12 Correct 86 ms 14416 KB Output is correct
13 Correct 96 ms 14448 KB Output is correct
14 Correct 97 ms 14524 KB Output is correct
15 Correct 92 ms 14472 KB Output is correct
16 Correct 95 ms 14800 KB Output is correct
17 Correct 96 ms 14416 KB Output is correct
18 Correct 93 ms 14480 KB Output is correct
19 Correct 94 ms 14536 KB Output is correct
20 Correct 92 ms 14656 KB Output is correct
21 Correct 90 ms 14724 KB Output is correct
22 Correct 94 ms 14540 KB Output is correct
23 Correct 98 ms 14356 KB Output is correct
24 Correct 96 ms 14280 KB Output is correct
25 Correct 102 ms 14324 KB Output is correct
26 Correct 97 ms 14232 KB Output is correct
27 Correct 165 ms 22076 KB Output is correct
28 Correct 178 ms 22176 KB Output is correct
29 Correct 160 ms 22212 KB Output is correct
30 Correct 176 ms 22100 KB Output is correct
31 Correct 170 ms 22060 KB Output is correct
32 Correct 155 ms 21668 KB Output is correct
33 Correct 141 ms 21860 KB Output is correct
34 Correct 155 ms 21840 KB Output is correct
35 Correct 148 ms 21864 KB Output is correct
36 Correct 170 ms 21908 KB Output is correct
37 Correct 139 ms 21788 KB Output is correct
38 Correct 287 ms 42776 KB Output is correct
39 Correct 280 ms 49840 KB Output is correct
40 Correct 262 ms 35652 KB Output is correct
41 Correct 283 ms 50248 KB Output is correct
42 Correct 151 ms 21828 KB Output is correct
43 Correct 141 ms 21600 KB Output is correct
44 Correct 219 ms 29112 KB Output is correct
45 Correct 207 ms 29144 KB Output is correct
46 Correct 228 ms 29372 KB Output is correct
47 Correct 143 ms 21836 KB Output is correct
48 Correct 140 ms 21648 KB Output is correct
49 Correct 212 ms 28892 KB Output is correct
50 Correct 197 ms 29108 KB Output is correct
51 Correct 220 ms 29528 KB Output is correct
52 Execution timed out 3089 ms 26948 KB Time limit exceeded
53 Halted 0 ms 0 KB -