oj.uz

Submission #260585

# Submission time Handle Problem Language Result Execution time Memory
260585 2020-08-10T14:41:39 Z Saboon Stray Cat (JOI20_stray) C++14
24 / 100
 70 ms 16788 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){
		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 51 ms 15620 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 44 ms 15060 KB Output is correct
4 Correct 66 ms 16748 KB Output is correct
5 Correct 68 ms 16788 KB Output is correct
6 Correct 51 ms 15356 KB Output is correct
7 Correct 50 ms 15476 KB Output is correct
8 Correct 59 ms 16160 KB Output is correct
9 Correct 58 ms 16204 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 15620 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 44 ms 15060 KB Output is correct
4 Correct 66 ms 16748 KB Output is correct
5 Correct 68 ms 16788 KB Output is correct
6 Correct 51 ms 15356 KB Output is correct
7 Correct 50 ms 15476 KB Output is correct
8 Correct 59 ms 16160 KB Output is correct
9 Correct 58 ms 16204 KB Output is correct
10 Correct 46 ms 13428 KB Output is correct
11 Correct 52 ms 13432 KB Output is correct
12 Correct 57 ms 13564 KB Output is correct
13 Correct 44 ms 13656 KB Output is correct
14 Correct 47 ms 13552 KB Output is correct
15 Correct 53 ms 14324 KB Output is correct
16 Correct 58 ms 16244 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 13192 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 45 ms 12792 KB Output is correct
4 Correct 63 ms 14460 KB Output is correct
5 Correct 64 ms 14628 KB Output is correct
6 Correct 47 ms 13308 KB Output is correct
7 Correct 48 ms 13288 KB Output is correct
8 Correct 62 ms 13952 KB Output is correct
9 Correct 62 ms 14016 KB Output is correct
10 Correct 50 ms 13732 KB Output is correct
11 Correct 54 ms 13704 KB Output is correct
12 Correct 62 ms 13684 KB Output is correct
13 Correct 53 ms 13712 KB Output is correct
14 Correct 54 ms 13928 KB Output is correct
15 Correct 55 ms 13992 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 13192 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 45 ms 12792 KB Output is correct
4 Correct 63 ms 14460 KB Output is correct
5 Correct 64 ms 14628 KB Output is correct
6 Correct 47 ms 13308 KB Output is correct
7 Correct 48 ms 13288 KB Output is correct
8 Correct 62 ms 13952 KB Output is correct
9 Correct 62 ms 14016 KB Output is correct
10 Correct 50 ms 13732 KB Output is correct
11 Correct 54 ms 13704 KB Output is correct
12 Correct 62 ms 13684 KB Output is correct
13 Correct 53 ms 13712 KB Output is correct
14 Correct 54 ms 13928 KB Output is correct
15 Correct 55 ms 13992 KB Output is correct
16 Correct 41 ms 11512 KB Output is correct
17 Correct 40 ms 11812 KB Output is correct
18 Correct 46 ms 12000 KB Output is correct
19 Correct 41 ms 11728 KB Output is correct
20 Correct 49 ms 12152 KB Output is correct
21 Correct 45 ms 11900 KB Output is correct
22 Correct 57 ms 13944 KB Output is correct
23 Correct 43 ms 11876 KB Output is correct
24 Correct 43 ms 11640 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 1792 KB Output is correct
6 Correct 2 ms 1792 KB Output is correct
7 Correct 2 ms 1792 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 3 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 2 ms 1792 KB Output is correct
14 Correct 2 ms 1792 KB Output is correct
15 Correct 2 ms 1792 KB Output is correct
16 Correct 2 ms 1792 KB Output is correct
17 Correct 2 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 2 ms 1792 KB Output is correct
21 Correct 2 ms 1792 KB Output is correct
22 Incorrect 2 ms 1792 KB Wrong Answer [5]
23 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 11420 KB Output is correct
2 Correct 49 ms 12156 KB Output is correct
3 Correct 2 ms 1792 KB Output is correct
4 Correct 40 ms 11764 KB Output is correct
5 Correct 58 ms 13132 KB Output is correct
6 Correct 57 ms 13256 KB Output is correct
7 Correct 47 ms 12484 KB Output is correct
8 Correct 47 ms 12244 KB Output is correct
9 Correct 60 ms 13068 KB Output is correct
10 Correct 57 ms 13380 KB Output is correct
11 Correct 62 ms 13132 KB Output is correct
12 Correct 70 ms 13272 KB Output is correct
13 Correct 59 ms 13436 KB Output is correct
14 Correct 63 ms 13328 KB Output is correct
15 Correct 60 ms 13056 KB Output is correct
16 Correct 60 ms 13260 KB Output is correct
17 Correct 64 ms 12748 KB Output is correct
18 Correct 65 ms 13000 KB Output is correct
19 Correct 53 ms 13016 KB Output is correct
20 Correct 54 ms 12748 KB Output is correct
21 Correct 59 ms 12756 KB Output is correct
22 Correct 52 ms 13008 KB Output is correct
23 Correct 44 ms 11948 KB Output is correct
24 Correct 46 ms 11852 KB Output is correct
25 Correct 52 ms 12108 KB Output is correct
26 Correct 46 ms 12196 KB Output is correct
27 Correct 51 ms 12640 KB Output is correct
28 Correct 49 ms 12832 KB Output is correct
29 Correct 52 ms 12820 KB Output is correct
30 Correct 53 ms 12948 KB Output is correct
31 Correct 47 ms 11952 KB Output is correct
32 Correct 55 ms 11960 KB Output is correct
33 Correct 45 ms 12076 KB Output is correct
34 Correct 46 ms 12056 KB Output is correct
35 Incorrect 45 ms 12244 KB Wrong Answer [5]
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 11444 KB Output is correct
2 Correct 50 ms 12372 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 38 ms 11572 KB Output is correct
5 Correct 56 ms 13256 KB Output is correct
6 Correct 59 ms 13132 KB Output is correct
7 Correct 45 ms 12500 KB Output is correct
8 Correct 45 ms 12448 KB Output is correct
9 Correct 56 ms 13344 KB Output is correct
10 Correct 59 ms 13276 KB Output is correct
11 Correct 61 ms 13140 KB Output is correct
12 Correct 57 ms 13264 KB Output is correct
13 Correct 55 ms 13280 KB Output is correct
14 Correct 55 ms 13384 KB Output is correct
15 Correct 54 ms 13212 KB Output is correct
16 Correct 54 ms 13384 KB Output is correct
17 Correct 54 ms 12928 KB Output is correct
18 Correct 52 ms 13008 KB Output is correct
19 Correct 54 ms 13008 KB Output is correct
20 Correct 54 ms 12756 KB Output is correct
21 Correct 60 ms 12788 KB Output is correct
22 Correct 53 ms 12756 KB Output is correct
23 Correct 45 ms 12076 KB Output is correct
24 Correct 45 ms 11932 KB Output is correct
25 Correct 47 ms 12232 KB Output is correct
26 Correct 47 ms 12220 KB Output is correct
27 Correct 52 ms 12844 KB Output is correct
28 Correct 51 ms 13008 KB Output is correct
29 Correct 61 ms 12816 KB Output is correct
30 Correct 64 ms 12808 KB Output is correct
31 Correct 46 ms 11732 KB Output is correct
32 Correct 44 ms 11948 KB Output is correct
33 Correct 46 ms 12036 KB Output is correct
34 Correct 46 ms 11988 KB Output is correct
35 Correct 51 ms 12636 KB Output is correct
36 Correct 50 ms 12620 KB Output is correct
37 Correct 50 ms 12500 KB Output is correct
38 Correct 50 ms 12712 KB Output is correct
39 Correct 52 ms 12700 KB Output is correct
40 Correct 53 ms 12584 KB Output is correct
41 Correct 54 ms 12892 KB Output is correct
42 Correct 51 ms 12748 KB Output is correct
43 Correct 53 ms 12916 KB Output is correct
44 Correct 54 ms 12900 KB Output is correct
45 Correct 53 ms 12912 KB Output is correct
46 Correct 54 ms 12912 KB Output is correct
47 Correct 48 ms 12536 KB Output is correct
48 Correct 50 ms 12532 KB Output is correct
49 Correct 47 ms 12416 KB Output is correct
50 Correct 50 ms 12560 KB Output is correct
51 Correct 48 ms 12256 KB Output is correct
52 Correct 46 ms 12184 KB Output is correct
53 Correct 45 ms 12224 KB Output is correct
54 Correct 45 ms 12360 KB Output is correct
55 Correct 49 ms 12244 KB Output is correct
56 Correct 49 ms 12340 KB Output is correct
57 Correct 45 ms 11924 KB Output is correct
58 Correct 45 ms 12100 KB Output is correct
59 Correct 45 ms 12356 KB Output is correct
60 Correct 44 ms 12376 KB Output is correct