Submission #438674

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
438674	2021-06-28T12:31:20 Z	soroush	Joker (BOI20_joker)	C++17	14 / 100	111 ms	6212 KB

Joker

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int , int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e5;
const ll mod = 1e9+7;

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n, m, q;
int a[maxn], b[maxn], l[maxn], r[maxn];
int par[maxn], sz[maxn];
bool val[maxn];

int getpar(int v){
	return ((~par[v]) ? getpar(par[v]) : v);
}

bool getval(int v){
	return ((~par[v]) ? val[v] ^ getval(par[v]) : val[v]);
}

bool merge(int v, int u){
	int pu = getpar(u) , pv = getpar(v);
	if(pu == pv)
		return getval(u) == getval(v);
	if(sz[pu] > sz[pv])swap(pu , pv);
	val[pu] ^= getval(v) == getval(u);
	par[pu] = pv;
	sz[pv] += sz[pu];
	return 0;
}

bool solve(int l , int r){
	for(int i = 0 ; i < l ; i ++){
		if(merge(a[i], b[i])){
			if(i > n){
				for(int j = 0 ; j < n ; j ++)
					par[j] = -1, val[j] = 0, sz[j] = 1;
			}
			else{
				for(int j = 0; j <= i ; j ++)
					par[a[j]] = par[b[j]] = -1 , val[a[j]] = val[b[j]] = 0 , sz[a[j]] = sz[b[j]] = 1;
			}
			return 1;
		}
	}
	for(int i = r ; i < m ; i ++){
		if(merge(a[i], b[i])){
			if(l + i - r > n){
				for(int j = 0 ; j < n ; j ++)
					par[j] = -1, val[j] = 0 , sz[j] = 1;
			}
			else{
				for(int j = 0; j < l ; j ++)
					par[a[j]] = par[b[j]] = -1 , val[a[j]] = val[b[j]] = 0 , sz[a[j]] = sz[b[j]] = 1;
				for(int j = r ; j <= i ; j ++)
					par[a[j]] = par[b[j]] = -1 , val[a[j]] = val[b[j]] = 0 , sz[a[j]] = sz[b[j]] = 1;
			}
			return 1;
		}
	}
	if(m - r - l < n){
		for(int j = 0; j < l ; j ++)
			par[a[j]] = par[b[j]] = -1 , val[a[j]] = val[b[j]] = 0 , sz[a[j]] = sz[b[j]] = 1;
		for(int j = r ; j < m ; j ++)
			par[a[j]] = par[b[j]] = -1 , val[a[j]] = val[b[j]] = 0 , sz[a[j]] = sz[b[j]] = 1;
	}
	else{
		for(int j = 0 ; j < n ; j ++)
			par[j] = -1, val[j] = 0 , sz[j] = 1;
	}
	return 0;
}

bool sub3 = 0;
int srt[maxn];
bool ans[maxn];

int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n >> m >> q;
	ms(par, -1);
	for(int i = 0 ; i < m ; i ++)
		cin >> a[i] >> b[i] , a[i] -- , b[i] --;
	for(int i = 0 ; i < n ; i ++)sz[i] = 1;
	for(int i = 0 ; i < q ; i ++)
		cin >> l[i] >> r[i], l[i] --, sub3 |= l[i];
	if(n <= 2000 and m <= 2000 and q <= 2000){
		for(int i = 0 ; i < q ; i ++)
			cout << (solve(l[i] , r[i]) ? "YES" : "NO") << endl;
		return 0;
	}
	if(!sub3){
		for(int i = 0 ; i < m ; i ++)
			srt[i] = i;
		sort(srt , srt + m , [](int i, int j){return r[i] > r[j];});
		bool cur = 0;
		int pos = m-1;
		for(int i = 0 ; i < q ; i ++){
			while(pos > r[srt[i]]){
				cur |= merge(a[pos], b[pos]);
				pos --;
			}
			ans[srt[i]] = cur;
		}
		for(int i = 0 ; i < q ; i ++)
			cout << ((ans[i]) ? "YES" : "NO") << endl;
		return 0;
	}
	return(0);
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Incorrect	111 ms	6212 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	2 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1100 KB	Output is correct
12	Correct	2 ms	1100 KB	Output is correct
13	Correct	2 ms	1100 KB	Output is correct
14	Correct	2 ms	1100 KB	Output is correct
15	Correct	2 ms	1100 KB	Output is correct
16	Correct	2 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	2 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	1 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	2 ms	1100 KB	Output is correct
29	Incorrect	111 ms	6212 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #5
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	2 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1100 KB	Output is correct
12	Correct	2 ms	1100 KB	Output is correct
13	Correct	2 ms	1100 KB	Output is correct
14	Correct	2 ms	1100 KB	Output is correct
15	Correct	2 ms	1100 KB	Output is correct
16	Correct	2 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	2 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	1 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	2 ms	1100 KB	Output is correct
29	Correct	33 ms	1168 KB	Output is correct
30	Correct	35 ms	1172 KB	Output is correct
31	Correct	32 ms	1100 KB	Output is correct
32	Correct	21 ms	1176 KB	Output is correct
33	Correct	12 ms	1172 KB	Output is correct
34	Correct	29 ms	1172 KB	Output is correct
35	Correct	46 ms	1172 KB	Output is correct
36	Correct	33 ms	1176 KB	Output is correct
37	Correct	63 ms	1156 KB	Output is correct
38	Correct	79 ms	1100 KB	Output is correct
39	Correct	47 ms	1176 KB	Output is correct
40	Correct	29 ms	1176 KB	Output is correct
41	Correct	31 ms	1172 KB	Output is correct
42	Correct	30 ms	1168 KB	Output is correct
43	Correct	44 ms	1164 KB	Output is correct
44	Correct	38 ms	1100 KB	Output is correct
45	Correct	38 ms	1100 KB	Output is correct
46	Correct	38 ms	1100 KB	Output is correct
47	Correct	32 ms	1100 KB	Output is correct
48	Correct	32 ms	1168 KB	Output is correct
49	Correct	38 ms	1100 KB	Output is correct
50	Correct	37 ms	1176 KB	Output is correct
51	Correct	40 ms	1288 KB	Output is correct
52	Correct	33 ms	1100 KB	Output is correct
53	Correct	35 ms	1152 KB	Output is correct
54	Correct	40 ms	1100 KB	Output is correct
55	Incorrect	47 ms	3072 KB	Output isn't correct
56	Halted	0 ms	0 KB	-

Subtask #6
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1100 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	2 ms	1100 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	2 ms	1100 KB	Output is correct
12	Correct	2 ms	1100 KB	Output is correct
13	Correct	2 ms	1100 KB	Output is correct
14	Correct	2 ms	1100 KB	Output is correct
15	Correct	2 ms	1100 KB	Output is correct
16	Correct	2 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	2 ms	1100 KB	Output is correct
19	Correct	1 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	2 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	1 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	2 ms	1100 KB	Output is correct
29	Correct	33 ms	1168 KB	Output is correct
30	Correct	35 ms	1172 KB	Output is correct
31	Correct	32 ms	1100 KB	Output is correct
32	Correct	21 ms	1176 KB	Output is correct
33	Correct	12 ms	1172 KB	Output is correct
34	Correct	29 ms	1172 KB	Output is correct
35	Correct	46 ms	1172 KB	Output is correct
36	Correct	33 ms	1176 KB	Output is correct
37	Correct	63 ms	1156 KB	Output is correct
38	Correct	79 ms	1100 KB	Output is correct
39	Correct	47 ms	1176 KB	Output is correct
40	Correct	29 ms	1176 KB	Output is correct
41	Correct	31 ms	1172 KB	Output is correct
42	Correct	30 ms	1168 KB	Output is correct
43	Correct	44 ms	1164 KB	Output is correct
44	Correct	38 ms	1100 KB	Output is correct
45	Correct	38 ms	1100 KB	Output is correct
46	Correct	38 ms	1100 KB	Output is correct
47	Correct	32 ms	1100 KB	Output is correct
48	Correct	32 ms	1168 KB	Output is correct
49	Correct	38 ms	1100 KB	Output is correct
50	Correct	37 ms	1176 KB	Output is correct
51	Correct	40 ms	1288 KB	Output is correct
52	Correct	33 ms	1100 KB	Output is correct
53	Correct	35 ms	1152 KB	Output is correct
54	Correct	40 ms	1100 KB	Output is correct
55	Incorrect	111 ms	6212 KB	Output isn't correct
56	Halted	0 ms	0 KB	-

Submission #438674

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 25.0

Subtask #4 0 / 10.0

Subtask #5 0 / 22.0

Subtask #6 0 / 29.0

Subtask #1
6.0 / 6.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 25.0

Subtask #4
0 / 10.0

Subtask #5
0 / 22.0

Subtask #6
0 / 29.0