답안 #384358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
384358	2021-04-01T13:03:25 Z	LinusTorvaldsFan	Joker (BOI20_joker)	C++14	49 / 100	2000 ms	20824 KB

Joker

#pragma GCC optimize("Ofast")


#include <iostream>
#include <string.h>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <assert.h>
#include <cmath>
#include <memory.h>
#include <queue>
#include <bitset>
#include <set>

using namespace std;

#define rep(i, n) for(int i =0;i<(n);i++)
#define per(i, n) for (int i=((int)n-1);i>=0;i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define make_unique(x) { sort(all(x)); x.resize(unique(x.begin(), x.end()) - x.begin()); }
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define add insert
#define debug(x) { cerr << #x << "= " << x << "\n"; }
typedef long long ll;
typedef vector<int>vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef pair<ll, ll> pll;
typedef vector<string> vs;
const int N = 200100;
int dsu[2 * N];
int sz[2 * N];

bool is_bipar = true;

vector<tuple<int, int, int, int>> ba;
vector<bool> bipar;


inline int find(int x) {
	while (x != dsu[x]) x = dsu[x];
	return x;
}

inline void unite(int a, int b) {
	
	a = find(a);
	b = find(b);

	if (sz[a] < sz[b]) swap(a, b);
	
	if (a == b) return;

	
	bipar.pb(is_bipar);
	ba.eb(a, sz[a], b, dsu[b]);

	dsu[b] = a;
	sz[a] += sz[b];

}

bool same(int a, int b) {
	return find(a) == find(b);
}

void merge(int a, int b) {

	unite(a, b + N);
	unite(b, a + N);

	if (same(a, a + N) || same(b, b + N)) {
		is_bipar = false;
	}
}

void back() {
	int a, b, c, d;
	tie(a, b, c, d) = ba.back();
	sz[a] = b;
	dsu[c] = d;
	is_bipar = bipar.back();
	ba.pop_back();
	bipar.pop_back();
}

void init() {
	rep(i, 2 * N) {
		dsu[i] = i;
		sz[i] = 1;
	}
}

bool ans[N];

struct Q {
	int l, r, i;
};

bool operator<(Q a, Q b) {
	return a.r > b.r;
}

vector<Q> qu[N];

int main() {
	bipar.reserve(2 * N);
	ba.reserve(2 * N);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	vpii edges;
	rep(i, m) {
		int u, v;
		cin >> u >> v;
		edges.eb(u, v);
	}
	const int K = 1000;

	rep(i, q) {
		int l, r;
		cin >> l >> r;
		l--; r--;
		qu[l / K].pb({ l, r, i });
	}
	init();
	rep(bl, N) {
		int bl_l = bl * K;
		int bl_r = min((bl + 1) * K - 1, m - 1);
		if (qu[bl].size()) {
			sort(all(qu[bl]));
			int pr = m - 1;
			int was_on_start = ba.size();
			rep(j, sz(qu[bl])) {
				while (pr > qu[bl][j].r) {
					int v1 = edges[pr].ff;
					int v2 = edges[pr].ss;
					pr--;
					merge(v1, v2);
				}
				int was = ba.size();
				for (int i = qu[bl][j].l - 1; i >= bl_l; i--) {
					int v1 = edges[i].ff;
					int v2 = edges[i].ss;
					merge(v1, v2);
				}
				ans[qu[bl][j].i] = is_bipar;
				while (ba.size() != was) {
					back();
				}
			}

			while (ba.size() != was_on_start) {
				back();
			}
		}
		for (int i = bl_l; i <= bl_r; i++) {
			int v1 = edges[i].ff;
			int v2 = edges[i].ss;
			merge(v1, v2);
		}
	}

	rep(i, q) {
		if (ans[i]) cout << "NO\n";
		else cout << "YES\n";
	}

	return 0;
}

Compilation message

Joker.cpp: In function 'int main()':
Joker.cpp:158:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  158 |     while (ba.size() != was) {
      |            ~~~~~~~~~~^~~~~~
Joker.cpp:163:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  163 |    while (ba.size() != was_on_start) {
      |           ~~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	7 ms	8172 KB	Output is correct
4	Correct	7 ms	8172 KB	Output is correct
5	Correct	7 ms	8192 KB	Output is correct
6	Correct	7 ms	8172 KB	Output is correct
7	Correct	8 ms	8172 KB	Output is correct
8	Correct	8 ms	8172 KB	Output is correct
9	Correct	9 ms	8172 KB	Output is correct
10	Correct	10 ms	8172 KB	Output is correct
11	Correct	8 ms	8172 KB	Output is correct
12	Correct	8 ms	8172 KB	Output is correct
13	Correct	8 ms	8172 KB	Output is correct
14	Correct	8 ms	8172 KB	Output is correct
15	Correct	8 ms	8172 KB	Output is correct
16	Correct	8 ms	8192 KB	Output is correct
17	Correct	8 ms	8172 KB	Output is correct
18	Correct	9 ms	8172 KB	Output is correct
19	Correct	8 ms	8172 KB	Output is correct
20	Correct	8 ms	8172 KB	Output is correct
21	Correct	8 ms	8172 KB	Output is correct
22	Correct	8 ms	8172 KB	Output is correct
23	Correct	8 ms	8172 KB	Output is correct
24	Correct	8 ms	8172 KB	Output is correct
25	Correct	8 ms	8172 KB	Output is correct
26	Correct	8 ms	8172 KB	Output is correct
27	Correct	8 ms	8172 KB	Output is correct
28	Correct	8 ms	8172 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	7 ms	8172 KB	Output is correct
4	Correct	7 ms	8172 KB	Output is correct
5	Correct	7 ms	8192 KB	Output is correct
6	Correct	7 ms	8172 KB	Output is correct
7	Correct	8 ms	8172 KB	Output is correct
8	Correct	8 ms	8172 KB	Output is correct
9	Correct	9 ms	8172 KB	Output is correct
10	Correct	10 ms	8172 KB	Output is correct
11	Correct	8 ms	8172 KB	Output is correct
12	Correct	8 ms	8172 KB	Output is correct
13	Correct	8 ms	8172 KB	Output is correct
14	Correct	8 ms	8172 KB	Output is correct
15	Correct	8 ms	8172 KB	Output is correct
16	Correct	8 ms	8192 KB	Output is correct
17	Correct	8 ms	8172 KB	Output is correct
18	Correct	9 ms	8172 KB	Output is correct
19	Correct	8 ms	8172 KB	Output is correct
20	Correct	8 ms	8172 KB	Output is correct
21	Correct	8 ms	8172 KB	Output is correct
22	Correct	8 ms	8172 KB	Output is correct
23	Correct	8 ms	8172 KB	Output is correct
24	Correct	8 ms	8172 KB	Output is correct
25	Correct	8 ms	8172 KB	Output is correct
26	Correct	8 ms	8172 KB	Output is correct
27	Correct	8 ms	8172 KB	Output is correct
28	Correct	8 ms	8172 KB	Output is correct
29	Correct	66 ms	8300 KB	Output is correct
30	Correct	71 ms	8300 KB	Output is correct
31	Correct	74 ms	8300 KB	Output is correct
32	Correct	65 ms	8300 KB	Output is correct
33	Correct	62 ms	8300 KB	Output is correct
34	Correct	82 ms	8300 KB	Output is correct
35	Correct	84 ms	8300 KB	Output is correct
36	Correct	40 ms	8428 KB	Output is correct
37	Correct	77 ms	8300 KB	Output is correct
38	Correct	65 ms	8300 KB	Output is correct
39	Correct	68 ms	8300 KB	Output is correct
40	Correct	64 ms	8300 KB	Output is correct
41	Correct	63 ms	8428 KB	Output is correct
42	Correct	58 ms	8300 KB	Output is correct
43	Correct	66 ms	8300 KB	Output is correct
44	Correct	59 ms	8300 KB	Output is correct
45	Correct	67 ms	8300 KB	Output is correct
46	Correct	80 ms	8300 KB	Output is correct
47	Correct	52 ms	8332 KB	Output is correct
48	Correct	60 ms	8300 KB	Output is correct
49	Correct	72 ms	8428 KB	Output is correct
50	Correct	74 ms	8428 KB	Output is correct
51	Correct	77 ms	8428 KB	Output is correct
52	Correct	73 ms	8416 KB	Output is correct
53	Correct	86 ms	8428 KB	Output is correct
54	Correct	81 ms	8300 KB	Output is correct

Subtask #3
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	154 ms	17624 KB	Output is correct
4	Correct	145 ms	20696 KB	Output is correct
5	Correct	146 ms	20184 KB	Output is correct
6	Correct	133 ms	17624 KB	Output is correct
7	Correct	145 ms	17732 KB	Output is correct
8	Correct	156 ms	16472 KB	Output is correct
9	Correct	144 ms	17880 KB	Output is correct
10	Correct	150 ms	19928 KB	Output is correct
11	Correct	136 ms	17624 KB	Output is correct
12	Correct	144 ms	19416 KB	Output is correct
13	Correct	135 ms	15192 KB	Output is correct
14	Correct	138 ms	16344 KB	Output is correct
15	Correct	148 ms	18648 KB	Output is correct
16	Correct	174 ms	19800 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	7 ms	8172 KB	Output is correct
4	Correct	7 ms	8172 KB	Output is correct
5	Correct	7 ms	8192 KB	Output is correct
6	Correct	7 ms	8172 KB	Output is correct
7	Correct	8 ms	8172 KB	Output is correct
8	Correct	8 ms	8172 KB	Output is correct
9	Correct	9 ms	8172 KB	Output is correct
10	Correct	10 ms	8172 KB	Output is correct
11	Correct	8 ms	8172 KB	Output is correct
12	Correct	8 ms	8172 KB	Output is correct
13	Correct	8 ms	8172 KB	Output is correct
14	Correct	8 ms	8172 KB	Output is correct
15	Correct	8 ms	8172 KB	Output is correct
16	Correct	8 ms	8192 KB	Output is correct
17	Correct	8 ms	8172 KB	Output is correct
18	Correct	9 ms	8172 KB	Output is correct
19	Correct	8 ms	8172 KB	Output is correct
20	Correct	8 ms	8172 KB	Output is correct
21	Correct	8 ms	8172 KB	Output is correct
22	Correct	8 ms	8172 KB	Output is correct
23	Correct	8 ms	8172 KB	Output is correct
24	Correct	8 ms	8172 KB	Output is correct
25	Correct	8 ms	8172 KB	Output is correct
26	Correct	8 ms	8172 KB	Output is correct
27	Correct	8 ms	8172 KB	Output is correct
28	Correct	8 ms	8172 KB	Output is correct
29	Correct	154 ms	17624 KB	Output is correct
30	Correct	145 ms	20696 KB	Output is correct
31	Correct	146 ms	20184 KB	Output is correct
32	Correct	133 ms	17624 KB	Output is correct
33	Correct	145 ms	17732 KB	Output is correct
34	Correct	156 ms	16472 KB	Output is correct
35	Correct	144 ms	17880 KB	Output is correct
36	Correct	150 ms	19928 KB	Output is correct
37	Correct	136 ms	17624 KB	Output is correct
38	Correct	144 ms	19416 KB	Output is correct
39	Correct	135 ms	15192 KB	Output is correct
40	Correct	138 ms	16344 KB	Output is correct
41	Correct	148 ms	18648 KB	Output is correct
42	Correct	174 ms	19800 KB	Output is correct
43	Correct	1292 ms	17752 KB	Output is correct
44	Correct	1326 ms	20708 KB	Output is correct
45	Correct	1416 ms	20824 KB	Output is correct
46	Correct	1230 ms	17720 KB	Output is correct
47	Correct	1554 ms	17624 KB	Output is correct
48	Correct	1184 ms	17752 KB	Output is correct
49	Correct	1360 ms	19956 KB	Output is correct
50	Correct	1034 ms	17216 KB	Output is correct
51	Correct	1325 ms	18776 KB	Output is correct
52	Correct	1363 ms	19840 KB	Output is correct
53	Correct	926 ms	15320 KB	Output is correct
54	Correct	1627 ms	17088 KB	Output is correct
55	Correct	1717 ms	18628 KB	Output is correct
56	Correct	1774 ms	19868 KB	Output is correct

Subtask #5
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	7 ms	8172 KB	Output is correct
4	Correct	7 ms	8172 KB	Output is correct
5	Correct	7 ms	8192 KB	Output is correct
6	Correct	7 ms	8172 KB	Output is correct
7	Correct	8 ms	8172 KB	Output is correct
8	Correct	8 ms	8172 KB	Output is correct
9	Correct	9 ms	8172 KB	Output is correct
10	Correct	10 ms	8172 KB	Output is correct
11	Correct	8 ms	8172 KB	Output is correct
12	Correct	8 ms	8172 KB	Output is correct
13	Correct	8 ms	8172 KB	Output is correct
14	Correct	8 ms	8172 KB	Output is correct
15	Correct	8 ms	8172 KB	Output is correct
16	Correct	8 ms	8192 KB	Output is correct
17	Correct	8 ms	8172 KB	Output is correct
18	Correct	9 ms	8172 KB	Output is correct
19	Correct	8 ms	8172 KB	Output is correct
20	Correct	8 ms	8172 KB	Output is correct
21	Correct	8 ms	8172 KB	Output is correct
22	Correct	8 ms	8172 KB	Output is correct
23	Correct	8 ms	8172 KB	Output is correct
24	Correct	8 ms	8172 KB	Output is correct
25	Correct	8 ms	8172 KB	Output is correct
26	Correct	8 ms	8172 KB	Output is correct
27	Correct	8 ms	8172 KB	Output is correct
28	Correct	8 ms	8172 KB	Output is correct
29	Correct	66 ms	8300 KB	Output is correct
30	Correct	71 ms	8300 KB	Output is correct
31	Correct	74 ms	8300 KB	Output is correct
32	Correct	65 ms	8300 KB	Output is correct
33	Correct	62 ms	8300 KB	Output is correct
34	Correct	82 ms	8300 KB	Output is correct
35	Correct	84 ms	8300 KB	Output is correct
36	Correct	40 ms	8428 KB	Output is correct
37	Correct	77 ms	8300 KB	Output is correct
38	Correct	65 ms	8300 KB	Output is correct
39	Correct	68 ms	8300 KB	Output is correct
40	Correct	64 ms	8300 KB	Output is correct
41	Correct	63 ms	8428 KB	Output is correct
42	Correct	58 ms	8300 KB	Output is correct
43	Correct	66 ms	8300 KB	Output is correct
44	Correct	59 ms	8300 KB	Output is correct
45	Correct	67 ms	8300 KB	Output is correct
46	Correct	80 ms	8300 KB	Output is correct
47	Correct	52 ms	8332 KB	Output is correct
48	Correct	60 ms	8300 KB	Output is correct
49	Correct	72 ms	8428 KB	Output is correct
50	Correct	74 ms	8428 KB	Output is correct
51	Correct	77 ms	8428 KB	Output is correct
52	Correct	73 ms	8416 KB	Output is correct
53	Correct	86 ms	8428 KB	Output is correct
54	Correct	81 ms	8300 KB	Output is correct
55	Correct	761 ms	13100 KB	Output is correct
56	Execution timed out	2053 ms	16272 KB	Time limit exceeded
57	Halted	0 ms	0 KB	-

Subtask #6
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	8172 KB	Output is correct
2	Correct	7 ms	8172 KB	Output is correct
3	Correct	7 ms	8172 KB	Output is correct
4	Correct	7 ms	8172 KB	Output is correct
5	Correct	7 ms	8192 KB	Output is correct
6	Correct	7 ms	8172 KB	Output is correct
7	Correct	8 ms	8172 KB	Output is correct
8	Correct	8 ms	8172 KB	Output is correct
9	Correct	9 ms	8172 KB	Output is correct
10	Correct	10 ms	8172 KB	Output is correct
11	Correct	8 ms	8172 KB	Output is correct
12	Correct	8 ms	8172 KB	Output is correct
13	Correct	8 ms	8172 KB	Output is correct
14	Correct	8 ms	8172 KB	Output is correct
15	Correct	8 ms	8172 KB	Output is correct
16	Correct	8 ms	8192 KB	Output is correct
17	Correct	8 ms	8172 KB	Output is correct
18	Correct	9 ms	8172 KB	Output is correct
19	Correct	8 ms	8172 KB	Output is correct
20	Correct	8 ms	8172 KB	Output is correct
21	Correct	8 ms	8172 KB	Output is correct
22	Correct	8 ms	8172 KB	Output is correct
23	Correct	8 ms	8172 KB	Output is correct
24	Correct	8 ms	8172 KB	Output is correct
25	Correct	8 ms	8172 KB	Output is correct
26	Correct	8 ms	8172 KB	Output is correct
27	Correct	8 ms	8172 KB	Output is correct
28	Correct	8 ms	8172 KB	Output is correct
29	Correct	66 ms	8300 KB	Output is correct
30	Correct	71 ms	8300 KB	Output is correct
31	Correct	74 ms	8300 KB	Output is correct
32	Correct	65 ms	8300 KB	Output is correct
33	Correct	62 ms	8300 KB	Output is correct
34	Correct	82 ms	8300 KB	Output is correct
35	Correct	84 ms	8300 KB	Output is correct
36	Correct	40 ms	8428 KB	Output is correct
37	Correct	77 ms	8300 KB	Output is correct
38	Correct	65 ms	8300 KB	Output is correct
39	Correct	68 ms	8300 KB	Output is correct
40	Correct	64 ms	8300 KB	Output is correct
41	Correct	63 ms	8428 KB	Output is correct
42	Correct	58 ms	8300 KB	Output is correct
43	Correct	66 ms	8300 KB	Output is correct
44	Correct	59 ms	8300 KB	Output is correct
45	Correct	67 ms	8300 KB	Output is correct
46	Correct	80 ms	8300 KB	Output is correct
47	Correct	52 ms	8332 KB	Output is correct
48	Correct	60 ms	8300 KB	Output is correct
49	Correct	72 ms	8428 KB	Output is correct
50	Correct	74 ms	8428 KB	Output is correct
51	Correct	77 ms	8428 KB	Output is correct
52	Correct	73 ms	8416 KB	Output is correct
53	Correct	86 ms	8428 KB	Output is correct
54	Correct	81 ms	8300 KB	Output is correct
55	Correct	154 ms	17624 KB	Output is correct
56	Correct	145 ms	20696 KB	Output is correct
57	Correct	146 ms	20184 KB	Output is correct
58	Correct	133 ms	17624 KB	Output is correct
59	Correct	145 ms	17732 KB	Output is correct
60	Correct	156 ms	16472 KB	Output is correct
61	Correct	144 ms	17880 KB	Output is correct
62	Correct	150 ms	19928 KB	Output is correct
63	Correct	136 ms	17624 KB	Output is correct
64	Correct	144 ms	19416 KB	Output is correct
65	Correct	135 ms	15192 KB	Output is correct
66	Correct	138 ms	16344 KB	Output is correct
67	Correct	148 ms	18648 KB	Output is correct
68	Correct	174 ms	19800 KB	Output is correct
69	Correct	1292 ms	17752 KB	Output is correct
70	Correct	1326 ms	20708 KB	Output is correct
71	Correct	1416 ms	20824 KB	Output is correct
72	Correct	1230 ms	17720 KB	Output is correct
73	Correct	1554 ms	17624 KB	Output is correct
74	Correct	1184 ms	17752 KB	Output is correct
75	Correct	1360 ms	19956 KB	Output is correct
76	Correct	1034 ms	17216 KB	Output is correct
77	Correct	1325 ms	18776 KB	Output is correct
78	Correct	1363 ms	19840 KB	Output is correct
79	Correct	926 ms	15320 KB	Output is correct
80	Correct	1627 ms	17088 KB	Output is correct
81	Correct	1717 ms	18628 KB	Output is correct
82	Correct	1774 ms	19868 KB	Output is correct
83	Correct	761 ms	13100 KB	Output is correct
84	Execution timed out	2053 ms	16272 KB	Time limit exceeded
85	Halted	0 ms	0 KB	-

답안 #384358

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