oj.uz

Submission #926228

# Submission time Handle Problem Language Result Execution time Memory
926228 2024-02-12T17:36:48 Z mansur Joker (BOI20_joker) C++17
14 / 100
 170 ms 16076 KB 
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 3e5 + 1, mod = 998244353;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

bool ok = 1, was[N];
vector<pii> g(N);

int p[N + 1], pr[N];
int sz[N + 1], pt[N + 1];
vector<array<int, 2>> h;

pii get(int x) {
 	if (p[x] == x) return {x, 0};
 	pii val = get(p[x]);
 	return {val.f, ((pr[x] + val.s) & 1)};
}

void add(int id) {
	int u = g[id].f;
	int v = g[id].s;
	pii x = get(u);
	pii y = get(v);
	if (x.f == y.f) {
		if (x.s == y.s) {
			if (ok) {
			    h.push_back({-1, -1});
				ok = 0;
			}    
		}
		return;
	}
	if (sz[x.f] > sz[y.f]) swap(x, y);
	h.push_back({x.f, sz[x.f]});
	h.push_back({y.f, sz[y.f]});
	p[x.f] = y.f;
	pr[x.f] = ((x.s + y.s + 1) & 1);  	
	sz[y.f] += sz[x.f];
}

void rb() {
	while (sz(h) && !pt[sz(h)]) {
		array<int, 2> x = h.back();
		h.pop_back();
		if (x[0] == -1) {
			ok = 1;
			continue;
		}
		p[x[0]] = x[0];
		pr[x[0]] = 0;
		sz[x[0]] = x[1];
	}
	pt[sz(h)]--; 
}

int ps[N];

void f(int l, int r, int tr) {
	if (l > r) return;
	int m = (l + r) / 2;
	pt[sz(h)]++;
	for (int i = m - 1; i >= l; i--) 
		add(i);
	pt[sz(h)]++;
	if (!ok) ps[m] = tr + 1;
	for (int i = tr; ok && i > m; i--) {
		add(i);
		if (!ok) {
			ps[m] = i;
			break;
		}
	}
	rb();
	add(m);
	f(m + 1, r, tr);
	rb();
	pt[sz(h)]++;
	for (int i = tr; i > ps[m]; i--)
		add(i);
	f(l, m - 1, min(tr, ps[m]));
	rb();
}

void slv() {
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		g[i] = {u, v};
	}
	for (int i = 1; i <= n; i++) 
		p[i] = i, sz[i] = 1;
	f(1, m, m);
	for (int i = 1; i <= q; i++) {
		int l, r;
		cin >> l >> r;
		if (ps[l] > r) cout << "YES\n";
		else cout << "NO\n";
	}
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

Joker.cpp:128:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  128 | main() {
      | ^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 118 ms 9676 KB Output is correct
4 Correct 170 ms 13520 KB Output is correct
5 Incorrect 100 ms 13184 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6896 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 2 ms 6744 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 7000 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 118 ms 9676 KB Output is correct
30 Correct 170 ms 13520 KB Output is correct
31 Incorrect 100 ms 13184 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6896 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 2 ms 6744 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 7000 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 3 ms 7004 KB Output is correct
31 Correct 3 ms 7004 KB Output is correct
32 Correct 3 ms 7004 KB Output is correct
33 Correct 2 ms 7004 KB Output is correct
34 Correct 3 ms 7004 KB Output is correct
35 Correct 3 ms 7004 KB Output is correct
36 Correct 3 ms 7256 KB Output is correct
37 Correct 3 ms 7256 KB Output is correct
38 Correct 3 ms 7004 KB Output is correct
39 Correct 3 ms 7004 KB Output is correct
40 Correct 3 ms 7004 KB Output is correct
41 Correct 2 ms 7004 KB Output is correct
42 Correct 3 ms 7004 KB Output is correct
43 Correct 2 ms 7004 KB Output is correct
44 Correct 3 ms 7004 KB Output is correct
45 Correct 3 ms 6972 KB Output is correct
46 Correct 2 ms 7004 KB Output is correct
47 Correct 3 ms 7004 KB Output is correct
48 Correct 3 ms 7000 KB Output is correct
49 Correct 2 ms 7004 KB Output is correct
50 Correct 3 ms 7004 KB Output is correct
51 Correct 3 ms 7004 KB Output is correct
52 Correct 3 ms 7004 KB Output is correct
53 Correct 3 ms 7004 KB Output is correct
54 Correct 3 ms 7056 KB Output is correct
55 Correct 94 ms 11728 KB Output is correct
56 Correct 133 ms 16076 KB Output is correct
57 Incorrect 72 ms 14800 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Correct 2 ms 6748 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 2 ms 6748 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 2 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 2 ms 6748 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 1 ms 6896 KB Output is correct
17 Correct 2 ms 6748 KB Output is correct
18 Correct 2 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 2 ms 6748 KB Output is correct
23 Correct 2 ms 6744 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 2 ms 7000 KB Output is correct
28 Correct 2 ms 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 3 ms 7004 KB Output is correct
31 Correct 3 ms 7004 KB Output is correct
32 Correct 3 ms 7004 KB Output is correct
33 Correct 2 ms 7004 KB Output is correct
34 Correct 3 ms 7004 KB Output is correct
35 Correct 3 ms 7004 KB Output is correct
36 Correct 3 ms 7256 KB Output is correct
37 Correct 3 ms 7256 KB Output is correct
38 Correct 3 ms 7004 KB Output is correct
39 Correct 3 ms 7004 KB Output is correct
40 Correct 3 ms 7004 KB Output is correct
41 Correct 2 ms 7004 KB Output is correct
42 Correct 3 ms 7004 KB Output is correct
43 Correct 2 ms 7004 KB Output is correct
44 Correct 3 ms 7004 KB Output is correct
45 Correct 3 ms 6972 KB Output is correct
46 Correct 2 ms 7004 KB Output is correct
47 Correct 3 ms 7004 KB Output is correct
48 Correct 3 ms 7000 KB Output is correct
49 Correct 2 ms 7004 KB Output is correct
50 Correct 3 ms 7004 KB Output is correct
51 Correct 3 ms 7004 KB Output is correct
52 Correct 3 ms 7004 KB Output is correct
53 Correct 3 ms 7004 KB Output is correct
54 Correct 3 ms 7056 KB Output is correct
55 Correct 118 ms 9676 KB Output is correct
56 Correct 170 ms 13520 KB Output is correct
57 Incorrect 100 ms 13184 KB Output isn't correct
58 Halted 0 ms 0 KB -