oj.uz

Submission #212379

# Submission time Handle Problem Language Result Execution time Memory
212379 2020-03-22T20:19:26 Z JustasZ Stray Cat (JOI20_stray) C++14
15 / 100
 96 ms 17100 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 == 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 = "010011";
						bool chk = false;
						for (int rot = 0; rot < 6; rot++) {
							if (s == t) {
								chk = true;
							}
							rotate(t.begin(), t.begin() + 1, t.end());
						}
						if (chk) {
							flag = true;
							moves.pb(y[0] > 0 ? 0 : 1);
						} else {
							flag = true;
							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]) {
						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:120: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 82 ms 15996 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 50 ms 15444 KB Output is correct
4 Correct 80 ms 17048 KB Output is correct
5 Correct 82 ms 17100 KB Output is correct
6 Correct 62 ms 15792 KB Output is correct
7 Correct 73 ms 15760 KB Output is correct
8 Correct 68 ms 16468 KB Output is correct
9 Correct 88 ms 16520 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 15996 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 50 ms 15444 KB Output is correct
4 Correct 80 ms 17048 KB Output is correct
5 Correct 82 ms 17100 KB Output is correct
6 Correct 62 ms 15792 KB Output is correct
7 Correct 73 ms 15760 KB Output is correct
8 Correct 68 ms 16468 KB Output is correct
9 Correct 88 ms 16520 KB Output is correct
10 Correct 67 ms 13908 KB Output is correct
11 Correct 61 ms 14020 KB Output is correct
12 Correct 53 ms 13952 KB Output is correct
13 Correct 55 ms 13904 KB Output is correct
14 Correct 64 ms 14044 KB Output is correct
15 Correct 67 ms 14408 KB Output is correct
16 Correct 64 ms 16500 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 13572 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 49 ms 13164 KB Output is correct
4 Correct 79 ms 14764 KB Output is correct
5 Correct 71 ms 14804 KB Output is correct
6 Correct 70 ms 13552 KB Output is correct
7 Correct 55 ms 13604 KB Output is correct
8 Correct 76 ms 14216 KB Output is correct
9 Correct 92 ms 14196 KB Output is correct
10 Correct 64 ms 13952 KB Output is correct
11 Correct 76 ms 14076 KB Output is correct
12 Correct 60 ms 14176 KB Output is correct
13 Correct 60 ms 13948 KB Output is correct
14 Correct 75 ms 14460 KB Output is correct
15 Correct 64 ms 14332 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 13572 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 49 ms 13164 KB Output is correct
4 Correct 79 ms 14764 KB Output is correct
5 Correct 71 ms 14804 KB Output is correct
6 Correct 70 ms 13552 KB Output is correct
7 Correct 55 ms 13604 KB Output is correct
8 Correct 76 ms 14216 KB Output is correct
9 Correct 92 ms 14196 KB Output is correct
10 Correct 64 ms 13952 KB Output is correct
11 Correct 76 ms 14076 KB Output is correct
12 Correct 60 ms 14176 KB Output is correct
13 Correct 60 ms 13948 KB Output is correct
14 Correct 75 ms 14460 KB Output is correct
15 Correct 64 ms 14332 KB Output is correct
16 Correct 62 ms 11992 KB Output is correct
17 Correct 49 ms 11896 KB Output is correct
18 Correct 51 ms 12024 KB Output is correct
19 Correct 57 ms 11884 KB Output is correct
20 Correct 55 ms 12508 KB Output is correct
21 Correct 62 ms 12280 KB Output is correct
22 Correct 71 ms 14336 KB Output is correct
23 Correct 52 ms 12248 KB Output is correct
24 Correct 51 ms 12044 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1792 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 10 ms 1792 KB Output is correct
4 Correct 12 ms 1792 KB Output is correct
5 Correct 12 ms 1792 KB Output is correct
6 Incorrect 11 ms 1744 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 11756 KB Output is correct
2 Correct 96 ms 13052 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 53 ms 11648 KB Output is correct
5 Correct 71 ms 14324 KB Output is correct
6 Incorrect 59 ms 13428 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 11652 KB Output is correct
2 Correct 59 ms 12876 KB Output is correct
3 Correct 10 ms 1536 KB Output is correct
4 Correct 57 ms 11512 KB Output is correct
5 Correct 78 ms 14452 KB Output is correct
6 Incorrect 57 ms 13448 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -