oj.uz

Submission #1054550

# Submission time Handle Problem Language Result Execution time Memory
1054550 2024-08-12T10:36:18 Z allin27x Joker (BOI20_joker) C++17
49 / 100
 2000 ms 15548 KB 
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
#define forn(i,n) for(int i=0; i<n; i++)
#define readv(a,n) vector<int>a(n);forn(i,n)cin>>a[i];
#define readvv(a,n,m) vector<vector<int>> a(n,vector<int>(m));forn(i,n)forn(j,m)cin>>a[i][j];
#define all(a) a.begin(), a.end()
#define _max(x,y) x = max(x,y)
#define _min(x,y) x = min(x,y)
// #define f first
// #define s second

const int N = 2e5+4;
const int SQRT = 460;
int ans[N];

struct qr{
	int l, r, i;
	bool operator<(qr b){
		return make_pair(l/SQRT, r) < make_pair(b.l/SQRT,b.r);
	}
};

vector<qr> queries[SQRT];
int edges[N][2];

int e1[2*N];
void build1(int N) {for (int i=0; i<N; i++) e1[i] = -1;}
int get1(int x) { return e1[x] < 0 ? x : e1[x] = get1(e1[x]); }
bool conn1(int a, int b) { return get1(a) == get1(b); }
int size1(int x) { return -e1[get1(x)]; }
void unite1(int x, int y) {
	x = get1(x), y = get1(y);
	if (x == y) return;
	if (e1[x] > e1[y]) swap(x, y);
	e1[x] += e1[y];
	e1[y] = x;
}
int nd = 0;
int ch[2*N];

int e2[2*N];
void build2(int N) {for (int i=0; i<N; i++) e2[i] = -1;}
int get2(int x) { 
	if (e2[x] < 0) return x;
	ch[nd++] = x;
	return e2[x] = get2(e2[x]); 

}
bool conn2(int a, int b) { return get2(a) == get2(b); }
int size2(int x) { return -e2[get2(x)]; }
void unite2(int x, int y) {
	x = get2(x), y = get2(y);
	if (x == y) return;
	if (e2[x] > e2[y]) swap(x, y);
	ch[nd++] = x; ch[nd++] = y;
	e2[x] += e2[y];
	e2[y] = x;
}

int st[2*N];

void solve(){
	int n,m,q; cin>>n>>m>>q;
	for (int i=0; i<m; i++){
		int a,b; cin>>a>>b; a--;b--; edges[i][0]=a; edges[i][1] = b;
	}
	for (int i=0; i<q; i++){
		int l,r; cin>>l>>r; l--; r--;
		qr p; p.l=l;p.r=r;p.i=i;
		queries[l/SQRT].push_back(p);
	}
	for (int i=0; i<SQRT; i++) sort(queries[i].begin(), queries[i].end());
	build1(2*n); build2(2*n);
	int fM =0; 
	for (int t=0; t<SQRT; t++){
		for (int i=0; i<2*n; i++) get1(i); 
		for (int i=0; i<2*n; i++) e2[i] = e1[i],st[i] = e2[i];
		if (t*SQRT >= m) break;
		int fm = 0;
		int i = m-1; int j = queries[t].size()-1;
		while (i>=0){
			if (j<0) break;
			qr p = queries[t][j];
			while (p.r == i){
				int f = 0;
				nd = 0;
				for (int ll=t*SQRT; ll<p.l; ll++){
					if (conn2(edges[ll][0],edges[ll][1])) f++;
					unite2(edges[ll][0]+n, edges[ll][1]);
					unite2(edges[ll][0], edges[ll][1]+n);
				}
				for (int rr =0; rr<nd; rr++){
					e2[ch[rr]] = st[ch[rr]];
				}
				if (f || fm || fM) ans[p.i] = 1;
				j--;
				if (j<0) break;
				p = queries[t][j];
			}
			if (j<0) break;
			nd = 0;
			fm += conn2(edges[i][0], edges[i][1]);
			unite2(edges[i][0] + n, edges[i][1]);
			unite2(edges[i][0], edges[i][1] + n);
			for (int rr =0; rr<nd; rr++){
				st[ch[rr]] = e2[ch[rr]];
			}
			i--;
		}
		for (int ll=SQRT*t; ll<min(m, SQRT*t + SQRT); ll++){
			fM += conn1(edges[ll][0], edges[ll][1]);
			unite1(edges[ll][0] + n, edges[ll][1]);
			unite1(edges[ll][0], edges[ll][1] + n);
		}
	}
	for (int i=0;i<q; i++) cout<<(ans[i]?"YES\n":"NO\n");
}


signed main(){ 
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t=1;
	while(t--){
		solve();
	}	
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8552 KB Output is correct
14 Correct 2 ms 8792 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 1 ms 8660 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8552 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 8 ms 8540 KB Output is correct
30 Correct 10 ms 8540 KB Output is correct
31 Correct 9 ms 8540 KB Output is correct
32 Correct 9 ms 8540 KB Output is correct
33 Correct 9 ms 8540 KB Output is correct
34 Correct 11 ms 8728 KB Output is correct
35 Correct 10 ms 8540 KB Output is correct
36 Correct 9 ms 8720 KB Output is correct
37 Correct 9 ms 8732 KB Output is correct
38 Correct 10 ms 8540 KB Output is correct
39 Correct 12 ms 8728 KB Output is correct
40 Correct 9 ms 8540 KB Output is correct
41 Correct 12 ms 8540 KB Output is correct
42 Correct 9 ms 8540 KB Output is correct
43 Correct 9 ms 8720 KB Output is correct
44 Correct 11 ms 8540 KB Output is correct
45 Correct 9 ms 8540 KB Output is correct
46 Correct 9 ms 8728 KB Output is correct
47 Correct 10 ms 8536 KB Output is correct
48 Correct 9 ms 8720 KB Output is correct
49 Correct 9 ms 8540 KB Output is correct
50 Correct 9 ms 8540 KB Output is correct
51 Correct 11 ms 8700 KB Output is correct
52 Correct 11 ms 8536 KB Output is correct
53 Correct 9 ms 8536 KB Output is correct
54 Correct 12 ms 8724 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 278 ms 12056 KB Output is correct
4 Correct 534 ms 11828 KB Output is correct
5 Correct 468 ms 11968 KB Output is correct
6 Correct 283 ms 12736 KB Output is correct
7 Correct 240 ms 12732 KB Output is correct
8 Correct 166 ms 12220 KB Output is correct
9 Correct 255 ms 12712 KB Output is correct
10 Correct 574 ms 12312 KB Output is correct
11 Correct 256 ms 12060 KB Output is correct
12 Correct 509 ms 12052 KB Output is correct
13 Correct 81 ms 12716 KB Output is correct
14 Correct 153 ms 12056 KB Output is correct
15 Correct 360 ms 12328 KB Output is correct
16 Correct 567 ms 12684 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8552 KB Output is correct
14 Correct 2 ms 8792 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 1 ms 8660 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8552 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 278 ms 12056 KB Output is correct
30 Correct 534 ms 11828 KB Output is correct
31 Correct 468 ms 11968 KB Output is correct
32 Correct 283 ms 12736 KB Output is correct
33 Correct 240 ms 12732 KB Output is correct
34 Correct 166 ms 12220 KB Output is correct
35 Correct 255 ms 12712 KB Output is correct
36 Correct 574 ms 12312 KB Output is correct
37 Correct 256 ms 12060 KB Output is correct
38 Correct 509 ms 12052 KB Output is correct
39 Correct 81 ms 12716 KB Output is correct
40 Correct 153 ms 12056 KB Output is correct
41 Correct 360 ms 12328 KB Output is correct
42 Correct 567 ms 12684 KB Output is correct
43 Correct 546 ms 12060 KB Output is correct
44 Correct 845 ms 11812 KB Output is correct
45 Correct 823 ms 12452 KB Output is correct
46 Correct 552 ms 11960 KB Output is correct
47 Correct 561 ms 11960 KB Output is correct
48 Correct 639 ms 12480 KB Output is correct
49 Correct 935 ms 12988 KB Output is correct
50 Correct 597 ms 12224 KB Output is correct
51 Correct 757 ms 12224 KB Output is correct
52 Correct 954 ms 12084 KB Output is correct
53 Correct 480 ms 14620 KB Output is correct
54 Correct 646 ms 14604 KB Output is correct
55 Correct 764 ms 15548 KB Output is correct
56 Correct 968 ms 14776 KB Output is correct

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8552 KB Output is correct
14 Correct 2 ms 8792 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 1 ms 8660 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8552 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 8 ms 8540 KB Output is correct
30 Correct 10 ms 8540 KB Output is correct
31 Correct 9 ms 8540 KB Output is correct
32 Correct 9 ms 8540 KB Output is correct
33 Correct 9 ms 8540 KB Output is correct
34 Correct 11 ms 8728 KB Output is correct
35 Correct 10 ms 8540 KB Output is correct
36 Correct 9 ms 8720 KB Output is correct
37 Correct 9 ms 8732 KB Output is correct
38 Correct 10 ms 8540 KB Output is correct
39 Correct 12 ms 8728 KB Output is correct
40 Correct 9 ms 8540 KB Output is correct
41 Correct 12 ms 8540 KB Output is correct
42 Correct 9 ms 8540 KB Output is correct
43 Correct 9 ms 8720 KB Output is correct
44 Correct 11 ms 8540 KB Output is correct
45 Correct 9 ms 8540 KB Output is correct
46 Correct 9 ms 8728 KB Output is correct
47 Correct 10 ms 8536 KB Output is correct
48 Correct 9 ms 8720 KB Output is correct
49 Correct 9 ms 8540 KB Output is correct
50 Correct 9 ms 8540 KB Output is correct
51 Correct 11 ms 8700 KB Output is correct
52 Correct 11 ms 8536 KB Output is correct
53 Correct 9 ms 8536 KB Output is correct
54 Correct 12 ms 8724 KB Output is correct
55 Correct 870 ms 8796 KB Output is correct
56 Correct 1854 ms 8864 KB Output is correct
57 Correct 1154 ms 10836 KB Output is correct
58 Correct 912 ms 10652 KB Output is correct
59 Correct 1776 ms 10832 KB Output is correct
60 Execution timed out 2054 ms 10196 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8536 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8552 KB Output is correct
14 Correct 2 ms 8792 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 1 ms 8660 KB Output is correct
22 Correct 2 ms 8540 KB Output is correct
23 Correct 1 ms 8552 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 8 ms 8540 KB Output is correct
30 Correct 10 ms 8540 KB Output is correct
31 Correct 9 ms 8540 KB Output is correct
32 Correct 9 ms 8540 KB Output is correct
33 Correct 9 ms 8540 KB Output is correct
34 Correct 11 ms 8728 KB Output is correct
35 Correct 10 ms 8540 KB Output is correct
36 Correct 9 ms 8720 KB Output is correct
37 Correct 9 ms 8732 KB Output is correct
38 Correct 10 ms 8540 KB Output is correct
39 Correct 12 ms 8728 KB Output is correct
40 Correct 9 ms 8540 KB Output is correct
41 Correct 12 ms 8540 KB Output is correct
42 Correct 9 ms 8540 KB Output is correct
43 Correct 9 ms 8720 KB Output is correct
44 Correct 11 ms 8540 KB Output is correct
45 Correct 9 ms 8540 KB Output is correct
46 Correct 9 ms 8728 KB Output is correct
47 Correct 10 ms 8536 KB Output is correct
48 Correct 9 ms 8720 KB Output is correct
49 Correct 9 ms 8540 KB Output is correct
50 Correct 9 ms 8540 KB Output is correct
51 Correct 11 ms 8700 KB Output is correct
52 Correct 11 ms 8536 KB Output is correct
53 Correct 9 ms 8536 KB Output is correct
54 Correct 12 ms 8724 KB Output is correct
55 Correct 278 ms 12056 KB Output is correct
56 Correct 534 ms 11828 KB Output is correct
57 Correct 468 ms 11968 KB Output is correct
58 Correct 283 ms 12736 KB Output is correct
59 Correct 240 ms 12732 KB Output is correct
60 Correct 166 ms 12220 KB Output is correct
61 Correct 255 ms 12712 KB Output is correct
62 Correct 574 ms 12312 KB Output is correct
63 Correct 256 ms 12060 KB Output is correct
64 Correct 509 ms 12052 KB Output is correct
65 Correct 81 ms 12716 KB Output is correct
66 Correct 153 ms 12056 KB Output is correct
67 Correct 360 ms 12328 KB Output is correct
68 Correct 567 ms 12684 KB Output is correct
69 Correct 546 ms 12060 KB Output is correct
70 Correct 845 ms 11812 KB Output is correct
71 Correct 823 ms 12452 KB Output is correct
72 Correct 552 ms 11960 KB Output is correct
73 Correct 561 ms 11960 KB Output is correct
74 Correct 639 ms 12480 KB Output is correct
75 Correct 935 ms 12988 KB Output is correct
76 Correct 597 ms 12224 KB Output is correct
77 Correct 757 ms 12224 KB Output is correct
78 Correct 954 ms 12084 KB Output is correct
79 Correct 480 ms 14620 KB Output is correct
80 Correct 646 ms 14604 KB Output is correct
81 Correct 764 ms 15548 KB Output is correct
82 Correct 968 ms 14776 KB Output is correct
83 Correct 870 ms 8796 KB Output is correct
84 Correct 1854 ms 8864 KB Output is correct
85 Correct 1154 ms 10836 KB Output is correct
86 Correct 912 ms 10652 KB Output is correct
87 Correct 1776 ms 10832 KB Output is correct
88 Execution timed out 2054 ms 10196 KB Time limit exceeded
89 Halted 0 ms 0 KB -