oj.uz

Submission #260590

# Submission time Handle Problem Language Result Execution time Memory
260590 2020-08-10T14:50:24 Z Saboon Stray Cat (JOI20_stray) C++14
29 / 100
 71 ms 16908 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

const int maxn = 20'000 + 10;

int h[maxn], c[maxn];
vector<int> g[maxn];
int Q[maxn], tail, head;

int seq[] = {1, 1, 0, 0, 1, 0};
int col[maxn];

void dfs(int v, int idx = 0, int par = -1){
	for (int i = 0; i < g[v].size(); i++){
		if (g[v][i] == par){
			g[v].erase(g[v].begin()+i);
			break;
		}
	}
	if (g[v].empty())
		return;
	if (g[v].size() == 1){
		col[g[v][0]] = seq[idx];
		dfs(g[v][0], (idx+1)%6, v);
		return;
	}
	for (auto u : g[v]){
		col[u] = 1-col[v];
		dfs(u, 0, v);
	}
}

void bfs(int v){
	memset(h, -1, sizeof h);
	Q[head++] = v;
	h[v] = 0;
	while (tail < head){
		v = Q[tail++];
		for (auto u : g[v])
			if (h[u] == -1)
				h[u] = h[v]+1, Q[head++] = u;
	}
}

vector<int> Mark(int n, int m, int A, int B, vector<int> U, vector<int> V) {
	vector<int> X(m);
	for (int i = 0; i < m; i++){
		g[U[i]].push_back(V[i]);
		g[V[i]].push_back(U[i]);
	}
	bfs(0);
	if (A >= 3){
		for (int i = 0; i < m; i++){
			int v = V[i], u = U[i];
			if (h[v] == h[u])
				X[i] = h[v]%3;
			else
				X[i] = (max(h[v],h[u])+2)%3;
		}
		return X;
	}
	dfs(0);
	for (int i = 0; i < m; i++){
		int v = V[i], u = U[i];
		if (h[v] > h[u])
			X[i] = col[v];
		else
			X[i] = col[u];
	}
	return X;
}

#include "Catherine.h"
#include <bits/stdc++.h>

using namespace std;

int A, B, last = -1, sure = 0;
string s[] = {"111100", "021001", "110010", "200101", "111011", "110110"};
string now;
bool first;

void Init(int a, int b) {
	A = a, B = b;
	last = -1, sure = 0;
	now.clear();
	first = true;
}


int Move(vector<int> y) {
	if (A >= 3){
		int a = -1, b = -1;
		for (int j = 0; j < A; ++j) {
			if (y[j] != 0){
				if (a == -1)
					a = j;
				else
					b = j;
			}
		}
		if (b == -1)
			return a;
		if (a+1 == b)
			return a;
		return b;
	}
	if (sure){
		if (y[0] + y[1] == 1)
			return last = (y[1] == 1);
		y[last] ++;
		if (y[0] > 1)
			return last = 1;
		return last = 0;
	}
	int deg = y[0] + y[1] + (last != -1);
	if (deg == 1){ // we are in a leaf
		sure = true;
		if (last != -1)
			return -1;
		return last = (y[1] == 1);
	}
	if (deg > 2){
		sure = true;
		int nex = (y[1] + (last == 1) == 1);
		if (last == nex)
			return -1;
		return last = nex;
	}
	if (first){
		now += (char)(y[0]+'0');
		now += (char)(y[1]+'0');
		now += (char)((y[1]>0)+'0');
		first = false;
		return last = (y[1] > 0);
	}
	now += (char)((y[1]==1)+'0');
	if (now.size() == 6){
		bool found = 0;
		for (int j = 0; j < 6; j++)
			if (now == s[j])
				found = 1;
		sure = 1;
		if (found)
			return -1;
		else
			return last = (y[1] == 1);
	}
	return last = (y[1] == 1);
}

Compilation message

Anthony.cpp: In function 'void dfs(int, int, int)':
Anthony.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++){
                  ~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15800 KB Output is correct
2 Correct 1 ms 2048 KB Output is correct
3 Correct 43 ms 15040 KB Output is correct
4 Correct 67 ms 16876 KB Output is correct
5 Correct 61 ms 16908 KB Output is correct
6 Correct 47 ms 15368 KB Output is correct
7 Correct 49 ms 15360 KB Output is correct
8 Correct 58 ms 16148 KB Output is correct
9 Correct 57 ms 15996 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15800 KB Output is correct
2 Correct 1 ms 2048 KB Output is correct
3 Correct 43 ms 15040 KB Output is correct
4 Correct 67 ms 16876 KB Output is correct
5 Correct 61 ms 16908 KB Output is correct
6 Correct 47 ms 15368 KB Output is correct
7 Correct 49 ms 15360 KB Output is correct
8 Correct 58 ms 16148 KB Output is correct
9 Correct 57 ms 15996 KB Output is correct
10 Correct 44 ms 13560 KB Output is correct
11 Correct 43 ms 13560 KB Output is correct
12 Correct 47 ms 13816 KB Output is correct
13 Correct 43 ms 13788 KB Output is correct
14 Correct 46 ms 13560 KB Output is correct
15 Correct 51 ms 14084 KB Output is correct
16 Correct 55 ms 16252 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13208 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 40 ms 12836 KB Output is correct
4 Correct 63 ms 14736 KB Output is correct
5 Correct 59 ms 14620 KB Output is correct
6 Correct 47 ms 13432 KB Output is correct
7 Correct 47 ms 13300 KB Output is correct
8 Correct 58 ms 13876 KB Output is correct
9 Correct 57 ms 13952 KB Output is correct
10 Correct 51 ms 13720 KB Output is correct
11 Correct 52 ms 13564 KB Output is correct
12 Correct 55 ms 13624 KB Output is correct
13 Correct 52 ms 13716 KB Output is correct
14 Correct 64 ms 14028 KB Output is correct
15 Correct 56 ms 13972 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13208 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 40 ms 12836 KB Output is correct
4 Correct 63 ms 14736 KB Output is correct
5 Correct 59 ms 14620 KB Output is correct
6 Correct 47 ms 13432 KB Output is correct
7 Correct 47 ms 13300 KB Output is correct
8 Correct 58 ms 13876 KB Output is correct
9 Correct 57 ms 13952 KB Output is correct
10 Correct 51 ms 13720 KB Output is correct
11 Correct 52 ms 13564 KB Output is correct
12 Correct 55 ms 13624 KB Output is correct
13 Correct 52 ms 13716 KB Output is correct
14 Correct 64 ms 14028 KB Output is correct
15 Correct 56 ms 13972 KB Output is correct
16 Correct 48 ms 11672 KB Output is correct
17 Correct 41 ms 11640 KB Output is correct
18 Correct 47 ms 11876 KB Output is correct
19 Correct 43 ms 11744 KB Output is correct
20 Correct 56 ms 12272 KB Output is correct
21 Correct 49 ms 12024 KB Output is correct
22 Correct 57 ms 14100 KB Output is correct
23 Correct 45 ms 11744 KB Output is correct
24 Correct 47 ms 11876 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 11560 KB Output is correct
2 Correct 49 ms 12156 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 37 ms 11388 KB Output is correct
5 Correct 57 ms 12884 KB Output is correct
6 Correct 57 ms 12660 KB Output is correct
7 Correct 50 ms 11868 KB Output is correct
8 Correct 50 ms 11772 KB Output is correct
9 Correct 61 ms 12876 KB Output is correct
10 Correct 60 ms 12872 KB Output is correct
11 Correct 61 ms 12744 KB Output is correct
12 Correct 63 ms 12660 KB Output is correct
13 Correct 60 ms 12752 KB Output is correct
14 Correct 58 ms 12876 KB Output is correct
15 Correct 61 ms 12752 KB Output is correct
16 Correct 59 ms 12692 KB Output is correct
17 Correct 52 ms 12388 KB Output is correct
18 Correct 51 ms 12496 KB Output is correct
19 Correct 55 ms 12412 KB Output is correct
20 Correct 52 ms 12496 KB Output is correct
21 Correct 53 ms 12284 KB Output is correct
22 Correct 52 ms 12500 KB Output is correct
23 Correct 43 ms 11432 KB Output is correct
24 Correct 43 ms 11260 KB Output is correct
25 Correct 44 ms 11644 KB Output is correct
26 Correct 44 ms 11516 KB Output is correct
27 Correct 52 ms 12156 KB Output is correct
28 Correct 51 ms 12296 KB Output is correct
29 Correct 55 ms 12312 KB Output is correct
30 Correct 56 ms 12156 KB Output is correct
31 Correct 44 ms 11372 KB Output is correct
32 Correct 46 ms 11388 KB Output is correct
33 Correct 43 ms 11388 KB Output is correct
34 Correct 44 ms 11676 KB Output is correct
35 Incorrect 42 ms 11928 KB Wrong Answer [5]
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 11424 KB Output is correct
2 Correct 47 ms 12004 KB Output is correct
3 Correct 1 ms 2048 KB Output is correct
4 Correct 38 ms 11264 KB Output is correct
5 Correct 56 ms 12872 KB Output is correct
6 Correct 60 ms 12916 KB Output is correct
7 Correct 48 ms 11988 KB Output is correct
8 Correct 45 ms 11992 KB Output is correct
9 Correct 67 ms 12816 KB Output is correct
10 Correct 61 ms 12748 KB Output is correct
11 Correct 58 ms 12796 KB Output is correct
12 Correct 61 ms 12784 KB Output is correct
13 Correct 60 ms 12772 KB Output is correct
14 Correct 58 ms 12668 KB Output is correct
15 Correct 58 ms 12768 KB Output is correct
16 Correct 58 ms 12660 KB Output is correct
17 Correct 61 ms 12500 KB Output is correct
18 Correct 54 ms 12496 KB Output is correct
19 Correct 52 ms 12500 KB Output is correct
20 Correct 53 ms 12488 KB Output is correct
21 Correct 52 ms 12404 KB Output is correct
22 Correct 51 ms 12500 KB Output is correct
23 Correct 41 ms 11428 KB Output is correct
24 Correct 41 ms 11420 KB Output is correct
25 Correct 44 ms 11624 KB Output is correct
26 Correct 45 ms 11540 KB Output is correct
27 Correct 55 ms 12316 KB Output is correct
28 Correct 70 ms 12240 KB Output is correct
29 Correct 53 ms 12316 KB Output is correct
30 Correct 54 ms 12284 KB Output is correct
31 Correct 53 ms 11384 KB Output is correct
32 Correct 44 ms 11380 KB Output is correct
33 Correct 45 ms 11516 KB Output is correct
34 Correct 48 ms 11648 KB Output is correct
35 Correct 51 ms 12020 KB Output is correct
36 Correct 51 ms 12200 KB Output is correct
37 Correct 55 ms 12224 KB Output is correct
38 Correct 56 ms 12188 KB Output is correct
39 Correct 50 ms 12184 KB Output is correct
40 Correct 51 ms 12020 KB Output is correct
41 Correct 51 ms 12656 KB Output is correct
42 Correct 54 ms 12564 KB Output is correct
43 Correct 51 ms 12668 KB Output is correct
44 Correct 54 ms 12652 KB Output is correct
45 Correct 53 ms 12532 KB Output is correct
46 Correct 53 ms 12412 KB Output is correct
47 Correct 52 ms 11900 KB Output is correct
48 Correct 71 ms 11888 KB Output is correct
49 Correct 53 ms 11908 KB Output is correct
50 Correct 50 ms 12028 KB Output is correct
51 Correct 52 ms 11844 KB Output is correct
52 Correct 49 ms 11764 KB Output is correct
53 Correct 48 ms 11844 KB Output is correct
54 Correct 53 ms 11848 KB Output is correct
55 Correct 45 ms 11852 KB Output is correct
56 Correct 46 ms 11772 KB Output is correct
57 Correct 46 ms 11516 KB Output is correct
58 Correct 45 ms 11604 KB Output is correct
59 Correct 48 ms 11844 KB Output is correct
60 Correct 46 ms 11644 KB Output is correct