oj.uz

Submission #893172

# Submission time Handle Problem Language Result Execution time Memory
893172 2023-12-26T15:31:47 Z amirhoseinfar1385 Joker (BOI20_joker) C++17
100 / 100
 120 ms 7368 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
const unsigned int maxn=200000+10;
unsigned int n,m,q,dp[maxn],f;
pair<unsigned int,unsigned int>alle[maxn];

struct dsu{
	vector<unsigned int>ha;
	unsigned int par[maxn],sz[maxn],val[maxn];
	dsu(){
		for(unsigned int i=0;i<maxn;i++){
			par[i]=i;
			sz[i]=1;
		}
	}
	unsigned int root(unsigned int u){
		while(u!=par[u]){
			u=par[u];
		}
		return u;
	}
	unsigned int len(unsigned int u){
		unsigned int ret=0;
		while(u!=par[u]){
			ret+=val[u];
			u=par[u];
		}
		return ret;
	}

	void con(unsigned int u,unsigned int v){
		unsigned int rootu=root(u),rootv=root(v);
		if(rootu!=rootv){
			if(sz[rootu]<sz[rootv]){
				swap(rootu,rootv);
				swap(u,v);
			}
			unsigned int lu=len(u),lv=len(v);
			par[rootv]=rootu;
			sz[rootu]+=sz[rootv];
			if((lu&1)==(lv&1)){
				val[rootv]=1;
			}
			else{
				val[rootv]=0;
			}
			ha.push_back(rootv);
			return ;
		}
		ha.push_back(-1);
	}
	bool two(unsigned int u,unsigned int v){
		unsigned int rootu=root(u),rootv=root(v);
		if(rootu!=rootv){
			return 0;
		}
		unsigned int lu=len(u),lv=len(v);
		if((lu&1)==(lv&1)){
			return 1;
		}
		return 0;
	}
	void back(){
		if((unsigned int)ha.back()==-1){
			ha.pop_back();
			return ;
		}
		unsigned int x=ha.back();
		sz[par[x]]-=sz[x];
		par[x]=x;
		val[x]=0;
		ha.pop_back();
		return ;
	}
}ds;

void solve(unsigned int l,unsigned int r,unsigned int tl,unsigned int tr){
	if(l>r){
		return ;
	}
	if(tl==tr){
		for(unsigned int i=l;i<=r;i++){
			dp[i]=tl;
		}
		return ;
	}
	unsigned int opt=0;
	unsigned int now=ds.ha.size();
	unsigned int mid=(l+r)>>1;
	for(unsigned int i=l;i<=mid;i++){
		ds.con(alle[i].first,alle[i].second);
	}
	for(unsigned int i=tr;i>=tl;i--){
		if(ds.two(alle[i].first,alle[i].second)){
			opt=i;
			break;
		}
		ds.con(alle[i].first,alle[i].second);
	}
	dp[mid]=opt;
	while((unsigned int)ds.ha.size()>now){
		ds.back();
	}
	for(unsigned int i=l;i<=mid;i++){
		ds.con(alle[i].first,alle[i].second);
	}
	solve(mid+1,r,opt,tr);
	while((unsigned int)ds.ha.size()>now){
		ds.back();
	}
	for(unsigned int i=tr;i>opt;i--){
		ds.con(alle[i].first,alle[i].second);
	}
	solve(l,mid-1,tl,opt);
	while((unsigned int)ds.ha.size()>now){
		ds.back();
	}
}

unsigned int pre(){
	for(unsigned int i=1;i<=m;i++){
		if(ds.two(alle[i].first,alle[i].second)){
			return i;
		}
		ds.con(alle[i].first,alle[i].second);
	}
	return m+1;
}

unsigned int suf(){
	for(unsigned int i=m;i>=0;i--){
		if(ds.two(alle[i].first,alle[i].second)){
			return i;
		}
		ds.con(alle[i].first,alle[i].second);
	}
	return 0;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);	
	cin>>n>>m>>q;
	for(unsigned int i=1;i<=m;i++){
		cin>>alle[i].first>>alle[i].second;
	}
	unsigned int ind=pre();
	while((unsigned int)ds.ha.size()>0){
		ds.back();
	}
	solve(1,ind-1,0,m);
	for(unsigned int i=ind;i<=m;i++){
		dp[i]=m+2;
	}
	if((unsigned int)ds.ha.size()!=0){
		assert(0);
	}
	dp[0]=suf();
	for(unsigned int i=0;i<q;i++){
		unsigned int l,r;
		cin>>l>>r;
		if(dp[l-1]<=r){
			cout<<"NO\n";
		}
		else{
			cout<<"YES\n";
		}
	}
}

Compilation message

Joker.cpp: In member function 'void dsu::back()':
Joker.cpp:66:29: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<unsigned int>, unsigned int>::value_type' {aka 'unsigned int'} and 'int' [-Wsign-compare]
   66 |   if((unsigned int)ha.back()==-1){
      |      ~~~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4948 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 0 ms 4852 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4948 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 0 ms 4852 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 2 ms 4760 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4696 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 2 ms 4700 KB Output is correct
47 Correct 1 ms 4700 KB Output is correct
48 Correct 1 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 1 ms 4700 KB Output is correct
51 Correct 1 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 91 ms 6048 KB Output is correct
4 Correct 112 ms 7360 KB Output is correct
5 Correct 63 ms 6604 KB Output is correct
6 Correct 65 ms 6508 KB Output is correct
7 Correct 62 ms 6096 KB Output is correct
8 Correct 88 ms 6320 KB Output is correct
9 Correct 106 ms 6352 KB Output is correct
10 Correct 110 ms 6356 KB Output is correct
11 Correct 92 ms 6104 KB Output is correct
12 Correct 93 ms 6100 KB Output is correct
13 Correct 89 ms 6096 KB Output is correct
14 Correct 90 ms 6132 KB Output is correct
15 Correct 111 ms 6092 KB Output is correct
16 Correct 115 ms 6100 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4948 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 0 ms 4852 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 91 ms 6048 KB Output is correct
30 Correct 112 ms 7360 KB Output is correct
31 Correct 63 ms 6604 KB Output is correct
32 Correct 65 ms 6508 KB Output is correct
33 Correct 62 ms 6096 KB Output is correct
34 Correct 88 ms 6320 KB Output is correct
35 Correct 106 ms 6352 KB Output is correct
36 Correct 110 ms 6356 KB Output is correct
37 Correct 92 ms 6104 KB Output is correct
38 Correct 93 ms 6100 KB Output is correct
39 Correct 89 ms 6096 KB Output is correct
40 Correct 90 ms 6132 KB Output is correct
41 Correct 111 ms 6092 KB Output is correct
42 Correct 115 ms 6100 KB Output is correct
43 Correct 89 ms 6048 KB Output is correct
44 Correct 111 ms 7368 KB Output is correct
45 Correct 106 ms 6644 KB Output is correct
46 Correct 61 ms 6100 KB Output is correct
47 Correct 76 ms 6328 KB Output is correct
48 Correct 91 ms 6480 KB Output is correct
49 Correct 109 ms 6236 KB Output is correct
50 Correct 93 ms 6136 KB Output is correct
51 Correct 94 ms 6096 KB Output is correct
52 Correct 91 ms 6092 KB Output is correct
53 Correct 86 ms 6096 KB Output is correct
54 Correct 93 ms 6320 KB Output is correct
55 Correct 104 ms 6132 KB Output is correct
56 Correct 110 ms 6088 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4948 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 0 ms 4852 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 2 ms 4760 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4696 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 2 ms 4700 KB Output is correct
47 Correct 1 ms 4700 KB Output is correct
48 Correct 1 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 1 ms 4700 KB Output is correct
51 Correct 1 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct
55 Correct 65 ms 5580 KB Output is correct
56 Correct 88 ms 6860 KB Output is correct
57 Correct 39 ms 5848 KB Output is correct
58 Correct 39 ms 5584 KB Output is correct
59 Correct 70 ms 5532 KB Output is correct
60 Correct 94 ms 5536 KB Output is correct
61 Correct 77 ms 5528 KB Output is correct
62 Correct 79 ms 5584 KB Output is correct
63 Correct 62 ms 5584 KB Output is correct
64 Correct 84 ms 5524 KB Output is correct
65 Correct 92 ms 5624 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4696 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4948 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4700 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 0 ms 4852 KB Output is correct
23 Correct 1 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 1 ms 4700 KB Output is correct
29 Correct 2 ms 4700 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 2 ms 4760 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4700 KB Output is correct
38 Correct 2 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4700 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4696 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 2 ms 4700 KB Output is correct
47 Correct 1 ms 4700 KB Output is correct
48 Correct 1 ms 4700 KB Output is correct
49 Correct 2 ms 4700 KB Output is correct
50 Correct 1 ms 4700 KB Output is correct
51 Correct 1 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 2 ms 4700 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct
55 Correct 91 ms 6048 KB Output is correct
56 Correct 112 ms 7360 KB Output is correct
57 Correct 63 ms 6604 KB Output is correct
58 Correct 65 ms 6508 KB Output is correct
59 Correct 62 ms 6096 KB Output is correct
60 Correct 88 ms 6320 KB Output is correct
61 Correct 106 ms 6352 KB Output is correct
62 Correct 110 ms 6356 KB Output is correct
63 Correct 92 ms 6104 KB Output is correct
64 Correct 93 ms 6100 KB Output is correct
65 Correct 89 ms 6096 KB Output is correct
66 Correct 90 ms 6132 KB Output is correct
67 Correct 111 ms 6092 KB Output is correct
68 Correct 115 ms 6100 KB Output is correct
69 Correct 89 ms 6048 KB Output is correct
70 Correct 111 ms 7368 KB Output is correct
71 Correct 106 ms 6644 KB Output is correct
72 Correct 61 ms 6100 KB Output is correct
73 Correct 76 ms 6328 KB Output is correct
74 Correct 91 ms 6480 KB Output is correct
75 Correct 109 ms 6236 KB Output is correct
76 Correct 93 ms 6136 KB Output is correct
77 Correct 94 ms 6096 KB Output is correct
78 Correct 91 ms 6092 KB Output is correct
79 Correct 86 ms 6096 KB Output is correct
80 Correct 93 ms 6320 KB Output is correct
81 Correct 104 ms 6132 KB Output is correct
82 Correct 110 ms 6088 KB Output is correct
83 Correct 65 ms 5580 KB Output is correct
84 Correct 88 ms 6860 KB Output is correct
85 Correct 39 ms 5848 KB Output is correct
86 Correct 39 ms 5584 KB Output is correct
87 Correct 70 ms 5532 KB Output is correct
88 Correct 94 ms 5536 KB Output is correct
89 Correct 77 ms 5528 KB Output is correct
90 Correct 79 ms 5584 KB Output is correct
91 Correct 62 ms 5584 KB Output is correct
92 Correct 84 ms 5524 KB Output is correct
93 Correct 92 ms 5624 KB Output is correct
94 Correct 95 ms 6300 KB Output is correct
95 Correct 117 ms 6604 KB Output is correct
96 Correct 67 ms 6452 KB Output is correct
97 Correct 70 ms 6352 KB Output is correct
98 Correct 73 ms 6180 KB Output is correct
99 Correct 86 ms 6456 KB Output is correct
100 Correct 87 ms 6356 KB Output is correct
101 Correct 94 ms 6356 KB Output is correct
102 Correct 102 ms 6356 KB Output is correct
103 Correct 112 ms 6312 KB Output is correct
104 Correct 82 ms 6352 KB Output is correct
105 Correct 105 ms 6320 KB Output is correct
106 Correct 120 ms 6304 KB Output is correct
107 Correct 60 ms 7064 KB Output is correct
108 Correct 94 ms 6124 KB Output is correct
109 Correct 89 ms 6172 KB Output is correct
110 Correct 102 ms 6048 KB Output is correct
111 Correct 90 ms 6100 KB Output is correct
112 Correct 91 ms 6092 KB Output is correct
113 Correct 93 ms 6072 KB Output is correct
114 Correct 92 ms 6232 KB Output is correct
115 Correct 89 ms 6068 KB Output is correct
116 Correct 91 ms 6096 KB Output is correct