oj.uz

Submission #722646

# Submission time Handle Problem Language Result Execution time Memory
722646 2023-04-12T13:47:25 Z gagik_2007 Joker (BOI20_joker) C++17
14 / 100
 506 ms 37748 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 ind;
	int l;
	int r;
	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;
}

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";
			}
		}
	}
}

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

Compilation message

Joker.cpp: In constructor 'Query::Query(int, int, int)':
Joker.cpp:32:6: warning: 'Query::r' will be initialized after [-Wreorder]
   32 |  int r;
      |      ^
Joker.cpp:30:6: warning:   'int Query::ind' [-Wreorder]
   30 |  int ind;
      |      ^~~
Joker.cpp:34:2: warning:   when initialized here [-Wreorder]
   34 |  Query(int _l, int _r, int _ind) :l(_l), r(_r), ind(_ind), ans(0) {}
      |  ^~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:118:7: warning: variable 'only1' set but not used [-Wunused-but-set-variable]
  118 |  bool only1 = true;
      |       ^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 9 ms 9684 KB Output is correct
11 Correct 8 ms 9668 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 9688 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 9 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9720 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9724 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 11 ms 9764 KB Output is correct
24 Correct 10 ms 9764 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 11 ms 9704 KB Output is correct
27 Correct 9 ms 9756 KB Output is correct
28 Correct 9 ms 9640 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 9 ms 9684 KB Output is correct
11 Correct 8 ms 9668 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 9688 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 9 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9720 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9724 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 11 ms 9764 KB Output is correct
24 Correct 10 ms 9764 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 11 ms 9704 KB Output is correct
27 Correct 9 ms 9756 KB Output is correct
28 Correct 9 ms 9640 KB Output is correct
29 Correct 94 ms 9860 KB Output is correct
30 Correct 339 ms 10028 KB Output is correct
31 Correct 361 ms 10056 KB Output is correct
32 Correct 468 ms 10056 KB Output is correct
33 Correct 506 ms 10040 KB Output is correct
34 Correct 338 ms 10052 KB Output is correct
35 Correct 357 ms 10112 KB Output is correct
36 Correct 339 ms 10084 KB Output is correct
37 Correct 236 ms 10068 KB Output is correct
38 Correct 167 ms 10052 KB Output is correct
39 Correct 360 ms 10176 KB Output is correct
40 Correct 381 ms 10068 KB Output is correct
41 Correct 397 ms 10056 KB Output is correct
42 Correct 403 ms 10048 KB Output is correct
43 Correct 94 ms 10040 KB Output is correct
44 Correct 83 ms 10056 KB Output is correct
45 Correct 89 ms 10052 KB Output is correct
46 Correct 76 ms 10068 KB Output is correct
47 Correct 425 ms 10068 KB Output is correct
48 Correct 436 ms 10048 KB Output is correct
49 Correct 400 ms 10044 KB Output is correct
50 Correct 366 ms 10044 KB Output is correct
51 Correct 505 ms 10068 KB Output is correct
52 Correct 432 ms 10064 KB Output is correct
53 Correct 408 ms 10068 KB Output is correct
54 Correct 319 ms 10060 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Incorrect 137 ms 37748 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 9 ms 9684 KB Output is correct
11 Correct 8 ms 9668 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 9688 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 9 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9720 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9724 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 11 ms 9764 KB Output is correct
24 Correct 10 ms 9764 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 11 ms 9704 KB Output is correct
27 Correct 9 ms 9756 KB Output is correct
28 Correct 9 ms 9640 KB Output is correct
29 Incorrect 137 ms 37748 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 9 ms 9684 KB Output is correct
11 Correct 8 ms 9668 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 9688 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 9 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9720 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9724 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 11 ms 9764 KB Output is correct
24 Correct 10 ms 9764 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 11 ms 9704 KB Output is correct
27 Correct 9 ms 9756 KB Output is correct
28 Correct 9 ms 9640 KB Output is correct
29 Correct 94 ms 9860 KB Output is correct
30 Correct 339 ms 10028 KB Output is correct
31 Correct 361 ms 10056 KB Output is correct
32 Correct 468 ms 10056 KB Output is correct
33 Correct 506 ms 10040 KB Output is correct
34 Correct 338 ms 10052 KB Output is correct
35 Correct 357 ms 10112 KB Output is correct
36 Correct 339 ms 10084 KB Output is correct
37 Correct 236 ms 10068 KB Output is correct
38 Correct 167 ms 10052 KB Output is correct
39 Correct 360 ms 10176 KB Output is correct
40 Correct 381 ms 10068 KB Output is correct
41 Correct 397 ms 10056 KB Output is correct
42 Correct 403 ms 10048 KB Output is correct
43 Correct 94 ms 10040 KB Output is correct
44 Correct 83 ms 10056 KB Output is correct
45 Correct 89 ms 10052 KB Output is correct
46 Correct 76 ms 10068 KB Output is correct
47 Correct 425 ms 10068 KB Output is correct
48 Correct 436 ms 10048 KB Output is correct
49 Correct 400 ms 10044 KB Output is correct
50 Correct 366 ms 10044 KB Output is correct
51 Correct 505 ms 10068 KB Output is correct
52 Correct 432 ms 10064 KB Output is correct
53 Correct 408 ms 10068 KB Output is correct
54 Correct 319 ms 10060 KB Output is correct
55 Incorrect 112 ms 32468 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9680 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9716 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 10 ms 9812 KB Output is correct
10 Correct 9 ms 9684 KB Output is correct
11 Correct 8 ms 9668 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 7 ms 9688 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 9 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 8 ms 9720 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9724 KB Output is correct
22 Correct 6 ms 9724 KB Output is correct
23 Correct 11 ms 9764 KB Output is correct
24 Correct 10 ms 9764 KB Output is correct
25 Correct 9 ms 9684 KB Output is correct
26 Correct 11 ms 9704 KB Output is correct
27 Correct 9 ms 9756 KB Output is correct
28 Correct 9 ms 9640 KB Output is correct
29 Correct 94 ms 9860 KB Output is correct
30 Correct 339 ms 10028 KB Output is correct
31 Correct 361 ms 10056 KB Output is correct
32 Correct 468 ms 10056 KB Output is correct
33 Correct 506 ms 10040 KB Output is correct
34 Correct 338 ms 10052 KB Output is correct
35 Correct 357 ms 10112 KB Output is correct
36 Correct 339 ms 10084 KB Output is correct
37 Correct 236 ms 10068 KB Output is correct
38 Correct 167 ms 10052 KB Output is correct
39 Correct 360 ms 10176 KB Output is correct
40 Correct 381 ms 10068 KB Output is correct
41 Correct 397 ms 10056 KB Output is correct
42 Correct 403 ms 10048 KB Output is correct
43 Correct 94 ms 10040 KB Output is correct
44 Correct 83 ms 10056 KB Output is correct
45 Correct 89 ms 10052 KB Output is correct
46 Correct 76 ms 10068 KB Output is correct
47 Correct 425 ms 10068 KB Output is correct
48 Correct 436 ms 10048 KB Output is correct
49 Correct 400 ms 10044 KB Output is correct
50 Correct 366 ms 10044 KB Output is correct
51 Correct 505 ms 10068 KB Output is correct
52 Correct 432 ms 10064 KB Output is correct
53 Correct 408 ms 10068 KB Output is correct
54 Correct 319 ms 10060 KB Output is correct
55 Incorrect 137 ms 37748 KB Output isn't correct
56 Halted 0 ms 0 KB -