답안 #438686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
438686	2021-06-28T13:01:28 Z	soroush	Joker (BOI20_joker)	C++17	49 / 100	1434 ms	12356 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+10;
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 < q ; i ++)
			srt[i] = i;
		sort(srt , srt + q , [](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;
	}
	if(*min_element(l , l + q) < 200){
		for(int i = 0 ; i < q ; i ++)
			srt[i] = i;
		sort(srt , srt + q , [](int i, int j){return r[i] > r[j];});
		vector < int > vc[200];
		for(int i = 0 ; i < q ; i ++)
			vc[l[srt[i]]].pb(srt[i]);
		for(int i = 0 ; i < 200 ; i ++)if(vc[i].size()){
			for(int j = 0 ; j < n ; j ++)par[j] = -1, sz[j] = 1, val[j] = 0;
			bool cur = 0;
			for(int j = 0 ; j < i ; j ++)
				cur |= merge(a[j] , b[j]);
			int pos = m-1;
			for(int j = 0 ; j < (int)vc[i].size() ; j ++){
				while(pos >= r[vc[i][j]] and !cur){
					cur |= merge(a[pos], b[pos]);
					pos --;
				}
				ans[vc[i][j]] = cur;
			}
		}
		for(int i = 0 ; i < q ; i ++)
			cout << ((ans[i]) ? "YES" : "NO") << endl;
		return 0;
	}
	return(0);
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	1108 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 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	2 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	2 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	1 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	2 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	1108 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 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	2 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	2 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	1 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	2 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	38 ms	1228 KB	Output is correct
30	Correct	34 ms	1100 KB	Output is correct
31	Correct	32 ms	1172 KB	Output is correct
32	Correct	19 ms	1172 KB	Output is correct
33	Correct	15 ms	1164 KB	Output is correct
34	Correct	26 ms	1100 KB	Output is correct
35	Correct	46 ms	1100 KB	Output is correct
36	Correct	36 ms	1152 KB	Output is correct
37	Correct	64 ms	1176 KB	Output is correct
38	Correct	85 ms	1164 KB	Output is correct
39	Correct	58 ms	1100 KB	Output is correct
40	Correct	31 ms	1168 KB	Output is correct
41	Correct	37 ms	1168 KB	Output is correct
42	Correct	35 ms	1100 KB	Output is correct
43	Correct	45 ms	1148 KB	Output is correct
44	Correct	41 ms	1168 KB	Output is correct
45	Correct	38 ms	1176 KB	Output is correct
46	Correct	43 ms	1172 KB	Output is correct
47	Correct	32 ms	1100 KB	Output is correct
48	Correct	44 ms	1172 KB	Output is correct
49	Correct	47 ms	1172 KB	Output is correct
50	Correct	39 ms	1100 KB	Output is correct
51	Correct	49 ms	1100 KB	Output is correct
52	Correct	33 ms	1172 KB	Output is correct
53	Correct	49 ms	1172 KB	Output is correct
54	Correct	50 ms	1100 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	120 ms	6272 KB	Output is correct
4	Correct	107 ms	6720 KB	Output is correct
5	Correct	120 ms	6724 KB	Output is correct
6	Correct	118 ms	6276 KB	Output is correct
7	Correct	116 ms	6212 KB	Output is correct
8	Correct	112 ms	6148 KB	Output is correct
9	Correct	112 ms	6580 KB	Output is correct
10	Correct	131 ms	6916 KB	Output is correct
11	Correct	111 ms	6212 KB	Output is correct
12	Correct	114 ms	6716 KB	Output is correct
13	Correct	120 ms	5988 KB	Output is correct
14	Correct	136 ms	6128 KB	Output is correct
15	Correct	114 ms	6428 KB	Output is correct
16	Correct	124 ms	6704 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	1108 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 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	2 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	2 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	1 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	2 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	120 ms	6272 KB	Output is correct
30	Correct	107 ms	6720 KB	Output is correct
31	Correct	120 ms	6724 KB	Output is correct
32	Correct	118 ms	6276 KB	Output is correct
33	Correct	116 ms	6212 KB	Output is correct
34	Correct	112 ms	6148 KB	Output is correct
35	Correct	112 ms	6580 KB	Output is correct
36	Correct	131 ms	6916 KB	Output is correct
37	Correct	111 ms	6212 KB	Output is correct
38	Correct	114 ms	6716 KB	Output is correct
39	Correct	120 ms	5988 KB	Output is correct
40	Correct	136 ms	6128 KB	Output is correct
41	Correct	114 ms	6428 KB	Output is correct
42	Correct	124 ms	6704 KB	Output is correct
43	Correct	590 ms	7428 KB	Output is correct
44	Correct	1434 ms	11852 KB	Output is correct
45	Correct	1346 ms	12240 KB	Output is correct
46	Correct	164 ms	11716 KB	Output is correct
47	Correct	184 ms	11856 KB	Output is correct
48	Correct	545 ms	11488 KB	Output is correct
49	Correct	888 ms	12104 KB	Output is correct
50	Correct	884 ms	11520 KB	Output is correct
51	Correct	699 ms	11956 KB	Output is correct
52	Correct	665 ms	12336 KB	Output is correct
53	Correct	744 ms	11300 KB	Output is correct
54	Correct	498 ms	11644 KB	Output is correct
55	Correct	679 ms	12064 KB	Output is correct
56	Correct	809 ms	12356 KB	Output is correct

Subtask #5
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	1108 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 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	2 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	2 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	1 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	2 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	38 ms	1228 KB	Output is correct
30	Correct	34 ms	1100 KB	Output is correct
31	Correct	32 ms	1172 KB	Output is correct
32	Correct	19 ms	1172 KB	Output is correct
33	Correct	15 ms	1164 KB	Output is correct
34	Correct	26 ms	1100 KB	Output is correct
35	Correct	46 ms	1100 KB	Output is correct
36	Correct	36 ms	1152 KB	Output is correct
37	Correct	64 ms	1176 KB	Output is correct
38	Correct	85 ms	1164 KB	Output is correct
39	Correct	58 ms	1100 KB	Output is correct
40	Correct	31 ms	1168 KB	Output is correct
41	Correct	37 ms	1168 KB	Output is correct
42	Correct	35 ms	1100 KB	Output is correct
43	Correct	45 ms	1148 KB	Output is correct
44	Correct	41 ms	1168 KB	Output is correct
45	Correct	38 ms	1176 KB	Output is correct
46	Correct	43 ms	1172 KB	Output is correct
47	Correct	32 ms	1100 KB	Output is correct
48	Correct	44 ms	1172 KB	Output is correct
49	Correct	47 ms	1172 KB	Output is correct
50	Correct	39 ms	1100 KB	Output is correct
51	Correct	49 ms	1100 KB	Output is correct
52	Correct	33 ms	1172 KB	Output is correct
53	Correct	49 ms	1172 KB	Output is correct
54	Correct	50 ms	1100 KB	Output is correct
55	Runtime error	48 ms	6044 KB	Execution killed with signal 11
56	Halted	0 ms	0 KB	-

Subtask #6
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	0 ms	1108 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 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	2 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1100 KB	Output is correct
20	Correct	2 ms	1100 KB	Output is correct
21	Correct	2 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	1 ms	1100 KB	Output is correct
25	Correct	1 ms	1100 KB	Output is correct
26	Correct	2 ms	1100 KB	Output is correct
27	Correct	2 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	38 ms	1228 KB	Output is correct
30	Correct	34 ms	1100 KB	Output is correct
31	Correct	32 ms	1172 KB	Output is correct
32	Correct	19 ms	1172 KB	Output is correct
33	Correct	15 ms	1164 KB	Output is correct
34	Correct	26 ms	1100 KB	Output is correct
35	Correct	46 ms	1100 KB	Output is correct
36	Correct	36 ms	1152 KB	Output is correct
37	Correct	64 ms	1176 KB	Output is correct
38	Correct	85 ms	1164 KB	Output is correct
39	Correct	58 ms	1100 KB	Output is correct
40	Correct	31 ms	1168 KB	Output is correct
41	Correct	37 ms	1168 KB	Output is correct
42	Correct	35 ms	1100 KB	Output is correct
43	Correct	45 ms	1148 KB	Output is correct
44	Correct	41 ms	1168 KB	Output is correct
45	Correct	38 ms	1176 KB	Output is correct
46	Correct	43 ms	1172 KB	Output is correct
47	Correct	32 ms	1100 KB	Output is correct
48	Correct	44 ms	1172 KB	Output is correct
49	Correct	47 ms	1172 KB	Output is correct
50	Correct	39 ms	1100 KB	Output is correct
51	Correct	49 ms	1100 KB	Output is correct
52	Correct	33 ms	1172 KB	Output is correct
53	Correct	49 ms	1172 KB	Output is correct
54	Correct	50 ms	1100 KB	Output is correct
55	Correct	120 ms	6272 KB	Output is correct
56	Correct	107 ms	6720 KB	Output is correct
57	Correct	120 ms	6724 KB	Output is correct
58	Correct	118 ms	6276 KB	Output is correct
59	Correct	116 ms	6212 KB	Output is correct
60	Correct	112 ms	6148 KB	Output is correct
61	Correct	112 ms	6580 KB	Output is correct
62	Correct	131 ms	6916 KB	Output is correct
63	Correct	111 ms	6212 KB	Output is correct
64	Correct	114 ms	6716 KB	Output is correct
65	Correct	120 ms	5988 KB	Output is correct
66	Correct	136 ms	6128 KB	Output is correct
67	Correct	114 ms	6428 KB	Output is correct
68	Correct	124 ms	6704 KB	Output is correct
69	Correct	590 ms	7428 KB	Output is correct
70	Correct	1434 ms	11852 KB	Output is correct
71	Correct	1346 ms	12240 KB	Output is correct
72	Correct	164 ms	11716 KB	Output is correct
73	Correct	184 ms	11856 KB	Output is correct
74	Correct	545 ms	11488 KB	Output is correct
75	Correct	888 ms	12104 KB	Output is correct
76	Correct	884 ms	11520 KB	Output is correct
77	Correct	699 ms	11956 KB	Output is correct
78	Correct	665 ms	12336 KB	Output is correct
79	Correct	744 ms	11300 KB	Output is correct
80	Correct	498 ms	11644 KB	Output is correct
81	Correct	679 ms	12064 KB	Output is correct
82	Correct	809 ms	12356 KB	Output is correct
83	Runtime error	48 ms	6044 KB	Execution killed with signal 11
84	Halted	0 ms	0 KB	-

답안 #438686

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 8.0 / 8.0

Subtask #3 25.0 / 25.0

Subtask #4 10.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
25.0 / 25.0

Subtask #4
10.0 / 10.0

Subtask #5
0 / 22.0

Subtask #6
0 / 29.0