oj.uz

답안 #722648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722648 2023-04-12T14:00:24 Z gagik_2007 Joker (BOI20_joker) C++17
14 / 100
 719 ms 42868 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <chrono>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <functional>
#include <random>
#include <cassert>
using namespace std;

typedef long long ll;
typedef long double ld;

#define ff first
#define ss second

struct Query {
	int l;
	int r;
	int ind;
	ll ans;
	Query(int _l, int _r, int _ind) :l(_l), r(_r), ind(_ind), ans(0) {}
};

struct Edge {
	int x;
	int y;
	Edge(int _x, int _y) :x(_x), y(_y) {}
};

ll ttt;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll N = 200007;
const ll LG = 31;
ll n, m, k;
set<int>g[N];
vector<Query>q;
vector<Edge>e;
int used[N];

bool dfs(int v) {
	for (int to : g[v]) {
		if (used[to] == used[v]) {
			return true;
		}
		else if (!used[to]) {
			used[to] = 3 - used[v];
			if (dfs(to)) {
				return true;
			}
		}
	}
	return false;
}

bool is_odd_cycle() {
	for (int i = 1; i <= n; i++) {
		used[i] = 0;
	}
	for (int i = 1; i <= n; i++) {
		if (!used[i]) {
			used[i] = 1;
			if (dfs(i)) {
				return true;
			}
		}
	}
	return false;
}

void remove_edges(const Query& query) {
	for (int i = query.l; i <= query.r; i++) {
		g[e[i].x].erase(e[i].y);
		g[e[i].y].erase(e[i].x);
	}
}

void add_edges(const Query& query) {
	for (int i = query.l; i <= query.r; i++) {
		g[e[i].x].insert(e[i].y);
		g[e[i].y].insert(e[i].x);
	}
}

bool do_query(const Query& query) {
	remove_edges(query);
	bool res = is_odd_cycle();
	add_edges(query);
	return res;
}

void only_l_equals_one() {
	// finding the first number i for which do_query(Query(0, i)) == false
	int l = 2, r = m + 1;
	while (l < r) {
		int mid = (l + r) / 2;
		if (do_query(Query(0, mid, 0))) {
			l = mid + 1;
		}
		else {
			r = mid;
		}
	}
	for (int i = 0; i < k; i++) {
		if (q[i].r >= l) {
			cout << "NO\n";
		}
		else cout << "YES\n";
	}
}

int main() {
	//freopen("in.txt", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> k;
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].insert(y);
		g[y].insert(x);
		e.push_back(Edge(x, y));
	}
	bool only1 = true;
	for (int i = 0; i < k; i++) {
		int l, r;
		cin >> l >> r;
		l--, r--;
		if (l != 0)only1 = false;
		q.push_back(Query(l, r, i));
	}
	if (n <= 2000 && m <= 2000 && k <= 2000) {
		for (int i = 0; i < k; i++) {
			if (do_query(q[i])) {
				cout << "YES\n";
			}
			else {
				cout << "NO\n";
			}
		}
	}
	else if (only1) {
		only_l_equals_one();
	}
}

/// ---- - --------  ------ -------- -- - - -
/// Just a reminder. Ubuntu password is I O I
/// ---- - --------  ------ -------- -- - - -

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9660 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 9 ms 9684 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 8 ms 9684 KB Output is correct
13 Correct 8 ms 9756 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9752 KB Output is correct
16 Correct 8 ms 9696 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 8 ms 9756 KB Output is correct
24 Correct 8 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 9 ms 9712 KB Output is correct
27 Correct 8 ms 9756 KB Output is correct
28 Correct 11 ms 9752 KB Output is correct
29 Correct 103 ms 9812 KB Output is correct
30 Correct 288 ms 10008 KB Output is correct
31 Correct 348 ms 10016 KB Output is correct
32 Correct 452 ms 10012 KB Output is correct
33 Correct 469 ms 10128 KB Output is correct
34 Correct 343 ms 10016 KB Output is correct
35 Correct 328 ms 10032 KB Output is correct
36 Correct 353 ms 10044 KB Output is correct
37 Correct 224 ms 10036 KB Output is correct
38 Correct 188 ms 10016 KB Output is correct
39 Correct 385 ms 10020 KB Output is correct
40 Correct 431 ms 10020 KB Output is correct
41 Correct 422 ms 10024 KB Output is correct
42 Correct 436 ms 10008 KB Output is correct
43 Correct 100 ms 10004 KB Output is correct
44 Correct 96 ms 10024 KB Output is correct
45 Correct 106 ms 10024 KB Output is correct
46 Correct 87 ms 10020 KB Output is correct
47 Correct 473 ms 10024 KB Output is correct
48 Correct 442 ms 10024 KB Output is correct
49 Correct 418 ms 10012 KB Output is correct
50 Correct 392 ms 10016 KB Output is correct
51 Correct 542 ms 10024 KB Output is correct
52 Correct 484 ms 10020 KB Output is correct
53 Correct 424 ms 10016 KB Output is correct
54 Correct 318 ms 10012 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 719 ms 40444 KB Output is correct
4 Incorrect 672 ms 42868 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9660 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 9 ms 9684 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 8 ms 9684 KB Output is correct
13 Correct 8 ms 9756 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9752 KB Output is correct
16 Correct 8 ms 9696 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 8 ms 9756 KB Output is correct
24 Correct 8 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 9 ms 9712 KB Output is correct
27 Correct 8 ms 9756 KB Output is correct
28 Correct 11 ms 9752 KB Output is correct
29 Correct 719 ms 40444 KB Output is correct
30 Incorrect 672 ms 42868 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9660 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 9 ms 9684 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 8 ms 9684 KB Output is correct
13 Correct 8 ms 9756 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9752 KB Output is correct
16 Correct 8 ms 9696 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 8 ms 9756 KB Output is correct
24 Correct 8 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 9 ms 9712 KB Output is correct
27 Correct 8 ms 9756 KB Output is correct
28 Correct 11 ms 9752 KB Output is correct
29 Correct 103 ms 9812 KB Output is correct
30 Correct 288 ms 10008 KB Output is correct
31 Correct 348 ms 10016 KB Output is correct
32 Correct 452 ms 10012 KB Output is correct
33 Correct 469 ms 10128 KB Output is correct
34 Correct 343 ms 10016 KB Output is correct
35 Correct 328 ms 10032 KB Output is correct
36 Correct 353 ms 10044 KB Output is correct
37 Correct 224 ms 10036 KB Output is correct
38 Correct 188 ms 10016 KB Output is correct
39 Correct 385 ms 10020 KB Output is correct
40 Correct 431 ms 10020 KB Output is correct
41 Correct 422 ms 10024 KB Output is correct
42 Correct 436 ms 10008 KB Output is correct
43 Correct 100 ms 10004 KB Output is correct
44 Correct 96 ms 10024 KB Output is correct
45 Correct 106 ms 10024 KB Output is correct
46 Correct 87 ms 10020 KB Output is correct
47 Correct 473 ms 10024 KB Output is correct
48 Correct 442 ms 10024 KB Output is correct
49 Correct 418 ms 10012 KB Output is correct
50 Correct 392 ms 10016 KB Output is correct
51 Correct 542 ms 10024 KB Output is correct
52 Correct 484 ms 10020 KB Output is correct
53 Correct 424 ms 10016 KB Output is correct
54 Correct 318 ms 10012 KB Output is correct
55 Incorrect 112 ms 30136 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9720 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 6 ms 9660 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 9 ms 9684 KB Output is correct
10 Correct 8 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 8 ms 9684 KB Output is correct
13 Correct 8 ms 9756 KB Output is correct
14 Correct 6 ms 9684 KB Output is correct
15 Correct 7 ms 9752 KB Output is correct
16 Correct 8 ms 9696 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 8 ms 9756 KB Output is correct
24 Correct 8 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 9 ms 9712 KB Output is correct
27 Correct 8 ms 9756 KB Output is correct
28 Correct 11 ms 9752 KB Output is correct
29 Correct 103 ms 9812 KB Output is correct
30 Correct 288 ms 10008 KB Output is correct
31 Correct 348 ms 10016 KB Output is correct
32 Correct 452 ms 10012 KB Output is correct
33 Correct 469 ms 10128 KB Output is correct
34 Correct 343 ms 10016 KB Output is correct
35 Correct 328 ms 10032 KB Output is correct
36 Correct 353 ms 10044 KB Output is correct
37 Correct 224 ms 10036 KB Output is correct
38 Correct 188 ms 10016 KB Output is correct
39 Correct 385 ms 10020 KB Output is correct
40 Correct 431 ms 10020 KB Output is correct
41 Correct 422 ms 10024 KB Output is correct
42 Correct 436 ms 10008 KB Output is correct
43 Correct 100 ms 10004 KB Output is correct
44 Correct 96 ms 10024 KB Output is correct
45 Correct 106 ms 10024 KB Output is correct
46 Correct 87 ms 10020 KB Output is correct
47 Correct 473 ms 10024 KB Output is correct
48 Correct 442 ms 10024 KB Output is correct
49 Correct 418 ms 10012 KB Output is correct
50 Correct 392 ms 10016 KB Output is correct
51 Correct 542 ms 10024 KB Output is correct
52 Correct 484 ms 10020 KB Output is correct
53 Correct 424 ms 10016 KB Output is correct
54 Correct 318 ms 10012 KB Output is correct
55 Correct 719 ms 40444 KB Output is correct
56 Incorrect 672 ms 42868 KB Output isn't correct
57 Halted 0 ms 0 KB -