oj.uz

Submission #212396

# Submission time Handle Problem Language Result Execution time Memory
212396 2020-03-22T21:35:30 Z JustasZ Stray Cat (JOI20_stray) C++14
100 / 100
 112 ms 17024 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e4 + 100;
const int mod = 1e9 + 7;

namespace {

	int n, m, A, B;
	vector<int>U, V, label;
	vector<pii>adj[maxn];
	
	void solve1() {
		queue<int>Q;
		vector<int>dist(n, mod);
		dist[0] = 0;
		Q.push(0);

		while (sz(Q)) {
			int v = Q.front();
			Q.pop();
			for (pii to : adj[v]) {
				if (dist[to.x] > dist[v] + 1) {
					dist[to.x] = dist[v] + 1;
					Q.push(to.x);
				}
			}
		}

		for (int i = 0; i < m; i++) {
			label[i] = min(dist[V[i]], dist[U[i]]) % 3;
		}
	}

	string s = "010011";
	void dfs(int v, int p, int prev_label) {
		for (pii to : adj[v]) {
			if (to.x != p) {
				if (sz(adj[v]) > 2) {
					int new_label = (s[prev_label] - '0') ^ 1;
					label[to.y] = new_label;
					dfs(to.x, v, new_label);
				} else {
					int new_label = (prev_label + 1) % 6;
					label[to.y] = (s[new_label] - '0');
					dfs(to.x, v, new_label);
				}
			}
		}
	}

	void solve2() {
		dfs(0, 0, 0);
	}

	vector<int> solve(int N, int M, int AA, int BB, vector<int>UU, vector<int>VV) {
		n = N, m = M, A = AA, B = BB;
		U = UU, V = VV;
		label.resize(m);
		for (int i = 0; i < m; i++) {
			adj[U[i]].pb({V[i], i});
			adj[V[i]].pb({U[i], i});
		}
		if (A >= 3) {
			solve1();
		} else {
			solve2();
		}
		return label;
	}

}  // namespace

vector<int>Mark(int N, int M, int A, int B, vector<int>U, vector<int>V) {
	return solve(N, M, A, B, U, V);
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 2e4 + 100;
const int mod = 1e9 + 7;

namespace {

	int A, B;
	string cur;
	vector<int>moves;
	bool flag = false;
	int go(vector<int>y) {
		int cnt = y[0] + y[1];
		if (flag) {
			if (cnt == 1) {
				moves.pb((y[0] > 0 ? 0 : 1));
			} else {
				moves.pb(moves.back() ^ 1);
			}
		} else {
			if (cnt == 0) {
				flag = true;
				moves.pb(moves.back());
				return -1;
			}
			if (cnt == 1) {
				if (!sz(moves)) {
					flag = true;
					moves.pb((y[0] > 0 ? 0 : 1));
				} else {
					if (sz(moves) < 4) {
						moves.pb((y[0] > 0 ? 0 : 1));
					} else {
						string t;
						for (int move : moves) {
							t += (move + '0');
						}
						t += (y[0] > 0 ? '0' : '1');
						string s = "110010";
						bool chk = false;
						for (int rot = 0; rot < 6; rot++) {
							if (s.substr(0, 5) == t) {
								chk = true;
							}
							rotate(s.begin(), s.begin() + 1, s.end());
						}
						flag = true;
						if (chk) {
							moves.pb((y[0] > 0 ? 0 : 1));
						} else {
							moves.pb(moves.back());
							return -1;
						}
					}
				}
			} else if (cnt == 2) {
				if (!sz(moves)) {
					if (y[0] && y[1]) {
						moves.pb(0), moves.pb(1);
					} else if (y[0] > 0) {
						moves.pb(0), moves.pb(0);
					} else {
						moves.pb(1), moves.pb(1);
					}
				} else {
					if (!y[0] || !y[1]) {
						flag = true;
						moves.pb(moves.back());
						return -1;
					} else {
						flag = true;
						moves.pb(moves.back() ^ 1);
					}
				}
			} else if (cnt >= 3) {
				flag = true;
				if (!sz(moves)) {
					moves.pb((y[0] == 1 ? 0 : 1));
				} else {
					if (!y[0] || !y[1]) {
						moves.pb(moves.back());
						return -1;
					} else {
						moves.pb(moves.back() ^ 1);
					}
				}
			}
		}

		return moves.back();
	}
}  // namespace

void Init(int A, int B) {
  ::A = A;
  ::B = B;
}

int Move(vector<int>y) {
	if (A >= 3) {
		for (int i = 0; i < 3; i++) {
			if (y[i] > 0 && y[(i + 1) % 3] > 0) {
				return i;
			}
		}
		for (int i = 0; i < 3; i++) {
			if (y[i] > 0) {
				return i;
			}
		}
	} else {
		return go(y);
	}
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:124:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 15832 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 49 ms 15356 KB Output is correct
4 Correct 79 ms 16884 KB Output is correct
5 Correct 86 ms 17024 KB Output is correct
6 Correct 57 ms 15892 KB Output is correct
7 Correct 67 ms 15732 KB Output is correct
8 Correct 81 ms 16464 KB Output is correct
9 Correct 74 ms 16388 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 15832 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 49 ms 15356 KB Output is correct
4 Correct 79 ms 16884 KB Output is correct
5 Correct 86 ms 17024 KB Output is correct
6 Correct 57 ms 15892 KB Output is correct
7 Correct 67 ms 15732 KB Output is correct
8 Correct 81 ms 16464 KB Output is correct
9 Correct 74 ms 16388 KB Output is correct
10 Correct 63 ms 13924 KB Output is correct
11 Correct 61 ms 13964 KB Output is correct
12 Correct 57 ms 13716 KB Output is correct
13 Correct 56 ms 13788 KB Output is correct
14 Correct 67 ms 14192 KB Output is correct
15 Correct 83 ms 14460 KB Output is correct
16 Correct 72 ms 16500 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 13564 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 56 ms 13156 KB Output is correct
4 Correct 86 ms 14900 KB Output is correct
5 Correct 84 ms 14868 KB Output is correct
6 Correct 63 ms 13556 KB Output is correct
7 Correct 64 ms 13564 KB Output is correct
8 Correct 72 ms 14300 KB Output is correct
9 Correct 71 ms 14176 KB Output is correct
10 Correct 67 ms 14076 KB Output is correct
11 Correct 64 ms 14028 KB Output is correct
12 Correct 64 ms 14076 KB Output is correct
13 Correct 62 ms 14064 KB Output is correct
14 Correct 69 ms 14284 KB Output is correct
15 Correct 73 ms 14196 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 13564 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 56 ms 13156 KB Output is correct
4 Correct 86 ms 14900 KB Output is correct
5 Correct 84 ms 14868 KB Output is correct
6 Correct 63 ms 13556 KB Output is correct
7 Correct 64 ms 13564 KB Output is correct
8 Correct 72 ms 14300 KB Output is correct
9 Correct 71 ms 14176 KB Output is correct
10 Correct 67 ms 14076 KB Output is correct
11 Correct 64 ms 14028 KB Output is correct
12 Correct 64 ms 14076 KB Output is correct
13 Correct 62 ms 14064 KB Output is correct
14 Correct 69 ms 14284 KB Output is correct
15 Correct 73 ms 14196 KB Output is correct
16 Correct 50 ms 11984 KB Output is correct
17 Correct 55 ms 12048 KB Output is correct
18 Correct 53 ms 12024 KB Output is correct
19 Correct 57 ms 12084 KB Output is correct
20 Correct 64 ms 12528 KB Output is correct
21 Correct 63 ms 12488 KB Output is correct
22 Correct 63 ms 14436 KB Output is correct
23 Correct 55 ms 11888 KB Output is correct
24 Correct 58 ms 12148 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 11772 KB Output is correct
2 Correct 62 ms 13056 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 45 ms 11512 KB Output is correct
5 Correct 87 ms 14452 KB Output is correct
6 Correct 91 ms 14452 KB Output is correct
7 Correct 53 ms 13564 KB Output is correct
8 Correct 60 ms 13416 KB Output is correct
9 Correct 67 ms 14452 KB Output is correct
10 Correct 89 ms 14540 KB Output is correct
11 Correct 93 ms 14584 KB Output is correct
12 Correct 112 ms 14452 KB Output is correct
13 Correct 94 ms 14540 KB Output is correct
14 Correct 98 ms 14324 KB Output is correct
15 Correct 84 ms 14332 KB Output is correct
16 Correct 93 ms 14488 KB Output is correct
17 Correct 67 ms 14204 KB Output is correct
18 Correct 69 ms 14068 KB Output is correct
19 Correct 67 ms 14200 KB Output is correct
20 Correct 82 ms 14232 KB Output is correct
21 Correct 76 ms 14080 KB Output is correct
22 Correct 75 ms 14196 KB Output is correct
23 Correct 61 ms 11756 KB Output is correct
24 Correct 74 ms 11748 KB Output is correct
25 Correct 70 ms 12284 KB Output is correct
26 Correct 68 ms 12236 KB Output is correct
27 Correct 61 ms 13104 KB Output is correct
28 Correct 82 ms 13160 KB Output is correct
29 Correct 87 ms 13020 KB Output is correct
30 Correct 62 ms 13044 KB Output is correct
31 Correct 61 ms 11772 KB Output is correct
32 Correct 62 ms 11764 KB Output is correct
33 Correct 55 ms 12132 KB Output is correct
34 Correct 54 ms 12148 KB Output is correct
35 Correct 59 ms 12916 KB Output is correct
36 Correct 60 ms 12916 KB Output is correct
37 Correct 60 ms 12908 KB Output is correct
38 Correct 72 ms 12908 KB Output is correct
39 Correct 66 ms 13052 KB Output is correct
40 Correct 60 ms 13044 KB Output is correct
41 Correct 76 ms 13752 KB Output is correct
42 Correct 79 ms 13688 KB Output is correct
43 Correct 68 ms 13700 KB Output is correct
44 Correct 71 ms 13684 KB Output is correct
45 Correct 67 ms 13668 KB Output is correct
46 Correct 68 ms 13668 KB Output is correct
47 Correct 59 ms 12796 KB Output is correct
48 Correct 59 ms 12804 KB Output is correct
49 Correct 57 ms 12756 KB Output is correct
50 Correct 64 ms 12924 KB Output is correct
51 Correct 63 ms 11856 KB Output is correct
52 Correct 61 ms 12044 KB Output is correct
53 Correct 60 ms 12004 KB Output is correct
54 Correct 60 ms 12028 KB Output is correct
55 Correct 61 ms 11892 KB Output is correct
56 Correct 56 ms 12012 KB Output is correct
57 Correct 56 ms 11996 KB Output is correct
58 Correct 52 ms 12036 KB Output is correct
59 Correct 60 ms 11900 KB Output is correct
60 Correct 52 ms 11932 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 11800 KB Output is correct
2 Correct 64 ms 12860 KB Output is correct
3 Correct 10 ms 1600 KB Output is correct
4 Correct 46 ms 11464 KB Output is correct
5 Correct 78 ms 14580 KB Output is correct
6 Correct 77 ms 14508 KB Output is correct
7 Correct 59 ms 13448 KB Output is correct
8 Correct 56 ms 13556 KB Output is correct
9 Correct 71 ms 14500 KB Output is correct
10 Correct 66 ms 14332 KB Output is correct
11 Correct 80 ms 14484 KB Output is correct
12 Correct 64 ms 14432 KB Output is correct
13 Correct 70 ms 14452 KB Output is correct
14 Correct 68 ms 14436 KB Output is correct
15 Correct 71 ms 14412 KB Output is correct
16 Correct 70 ms 14528 KB Output is correct
17 Correct 74 ms 14148 KB Output is correct
18 Correct 65 ms 14204 KB Output is correct
19 Correct 66 ms 14148 KB Output is correct
20 Correct 70 ms 14096 KB Output is correct
21 Correct 68 ms 14148 KB Output is correct
22 Correct 65 ms 14268 KB Output is correct
23 Correct 51 ms 11644 KB Output is correct
24 Correct 55 ms 11648 KB Output is correct
25 Correct 56 ms 12156 KB Output is correct
26 Correct 63 ms 12124 KB Output is correct
27 Correct 64 ms 13116 KB Output is correct
28 Correct 62 ms 13028 KB Output is correct
29 Correct 63 ms 13188 KB Output is correct
30 Correct 73 ms 13172 KB Output is correct
31 Correct 60 ms 11828 KB Output is correct
32 Correct 56 ms 11796 KB Output is correct
33 Correct 60 ms 12260 KB Output is correct
34 Correct 60 ms 12404 KB Output is correct
35 Correct 66 ms 13100 KB Output is correct
36 Correct 60 ms 13036 KB Output is correct
37 Correct 59 ms 13048 KB Output is correct
38 Correct 77 ms 13000 KB Output is correct
39 Correct 66 ms 13020 KB Output is correct
40 Correct 67 ms 12916 KB Output is correct
41 Correct 72 ms 13560 KB Output is correct
42 Correct 74 ms 13684 KB Output is correct
43 Correct 78 ms 13568 KB Output is correct
44 Correct 81 ms 13692 KB Output is correct
45 Correct 71 ms 13684 KB Output is correct
46 Correct 64 ms 13652 KB Output is correct
47 Correct 62 ms 12772 KB Output is correct
48 Correct 60 ms 12924 KB Output is correct
49 Correct 62 ms 12740 KB Output is correct
50 Correct 71 ms 12924 KB Output is correct
51 Correct 62 ms 11896 KB Output is correct
52 Correct 54 ms 11992 KB Output is correct
53 Correct 51 ms 11900 KB Output is correct
54 Correct 63 ms 11956 KB Output is correct
55 Correct 70 ms 12048 KB Output is correct
56 Correct 61 ms 11892 KB Output is correct
57 Correct 61 ms 11764 KB Output is correct
58 Correct 87 ms 11892 KB Output is correct
59 Correct 65 ms 11900 KB Output is correct
60 Correct 59 ms 11896 KB Output is correct