oj.uz

Submission #260604

# Submission time Handle Problem Language Result Execution time Memory
260604 2020-08-10T15:04:55 Z Saboon Stray Cat (JOI20_stray) C++14
29 / 100
 66 ms 16796 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 52 ms 15636 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 43 ms 15048 KB Output is correct
4 Correct 62 ms 16764 KB Output is correct
5 Correct 62 ms 16796 KB Output is correct
6 Correct 46 ms 15356 KB Output is correct
7 Correct 48 ms 15364 KB Output is correct
8 Correct 56 ms 16140 KB Output is correct
9 Correct 58 ms 16116 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 15636 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 43 ms 15048 KB Output is correct
4 Correct 62 ms 16764 KB Output is correct
5 Correct 62 ms 16796 KB Output is correct
6 Correct 46 ms 15356 KB Output is correct
7 Correct 48 ms 15364 KB Output is correct
8 Correct 56 ms 16140 KB Output is correct
9 Correct 58 ms 16116 KB Output is correct
10 Correct 43 ms 13676 KB Output is correct
11 Correct 43 ms 13432 KB Output is correct
12 Correct 45 ms 13560 KB Output is correct
13 Correct 43 ms 13432 KB Output is correct
14 Correct 46 ms 13816 KB Output is correct
15 Correct 54 ms 14196 KB Output is correct
16 Correct 57 ms 16280 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 13316 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 39 ms 12856 KB Output is correct
4 Correct 60 ms 14768 KB Output is correct
5 Correct 57 ms 14580 KB Output is correct
6 Correct 50 ms 13392 KB Output is correct
7 Correct 44 ms 13428 KB Output is correct
8 Correct 52 ms 13940 KB Output is correct
9 Correct 53 ms 13840 KB Output is correct
10 Correct 51 ms 13728 KB Output is correct
11 Correct 52 ms 13720 KB Output is correct
12 Correct 62 ms 13716 KB Output is correct
13 Correct 52 ms 13820 KB Output is correct
14 Correct 59 ms 14104 KB Output is correct
15 Correct 57 ms 13976 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 13316 KB Output is correct
2 Correct 1 ms 1792 KB Output is correct
3 Correct 39 ms 12856 KB Output is correct
4 Correct 60 ms 14768 KB Output is correct
5 Correct 57 ms 14580 KB Output is correct
6 Correct 50 ms 13392 KB Output is correct
7 Correct 44 ms 13428 KB Output is correct
8 Correct 52 ms 13940 KB Output is correct
9 Correct 53 ms 13840 KB Output is correct
10 Correct 51 ms 13728 KB Output is correct
11 Correct 52 ms 13720 KB Output is correct
12 Correct 62 ms 13716 KB Output is correct
13 Correct 52 ms 13820 KB Output is correct
14 Correct 59 ms 14104 KB Output is correct
15 Correct 57 ms 13976 KB Output is correct
16 Correct 40 ms 11512 KB Output is correct
17 Correct 44 ms 11816 KB Output is correct
18 Correct 43 ms 11740 KB Output is correct
19 Correct 49 ms 11712 KB Output is correct
20 Correct 53 ms 12404 KB Output is correct
21 Correct 47 ms 11896 KB Output is correct
22 Correct 56 ms 14104 KB Output is correct
23 Correct 50 ms 11796 KB Output is correct
24 Correct 46 ms 11880 KB Output is correct

Subtask #5
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 3 ms 1792 KB Output is correct
5 Correct 2 ms 1792 KB Output is correct
6 Correct 3 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 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 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 3 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 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 41 ms 11424 KB Output is correct
2 Correct 48 ms 12028 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 38 ms 11504 KB Output is correct
5 Correct 55 ms 12920 KB Output is correct
6 Correct 55 ms 12788 KB Output is correct
7 Correct 47 ms 11772 KB Output is correct
8 Correct 48 ms 12008 KB Output is correct
9 Correct 62 ms 12768 KB Output is correct
10 Correct 58 ms 12948 KB Output is correct
11 Correct 56 ms 12868 KB Output is correct
12 Correct 58 ms 12796 KB Output is correct
13 Correct 61 ms 12880 KB Output is correct
14 Correct 57 ms 12660 KB Output is correct
15 Correct 56 ms 12668 KB Output is correct
16 Correct 58 ms 12752 KB Output is correct
17 Correct 54 ms 12500 KB Output is correct
18 Correct 62 ms 12548 KB Output is correct
19 Correct 53 ms 12496 KB Output is correct
20 Correct 60 ms 12412 KB Output is correct
21 Correct 56 ms 12412 KB Output is correct
22 Correct 64 ms 12284 KB Output is correct
23 Correct 44 ms 11596 KB Output is correct
24 Correct 49 ms 11440 KB Output is correct
25 Correct 45 ms 11700 KB Output is correct
26 Correct 48 ms 11936 KB Output is correct
27 Correct 54 ms 12308 KB Output is correct
28 Correct 59 ms 12300 KB Output is correct
29 Correct 55 ms 12404 KB Output is correct
30 Correct 52 ms 12156 KB Output is correct
31 Correct 44 ms 11436 KB Output is correct
32 Correct 45 ms 11516 KB Output is correct
33 Correct 45 ms 11560 KB Output is correct
34 Correct 45 ms 11576 KB Output is correct
35 Incorrect 42 ms 11644 KB Wrong Answer [5]
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11492 KB Output is correct
2 Correct 46 ms 11932 KB Output is correct
3 Correct 1 ms 1792 KB Output is correct
4 Correct 38 ms 11128 KB Output is correct
5 Correct 56 ms 12668 KB Output is correct
6 Correct 57 ms 12660 KB Output is correct
7 Correct 45 ms 11996 KB Output is correct
8 Correct 45 ms 11892 KB Output is correct
9 Correct 55 ms 12744 KB Output is correct
10 Correct 56 ms 12884 KB Output is correct
11 Correct 59 ms 12864 KB Output is correct
12 Correct 57 ms 12880 KB Output is correct
13 Correct 54 ms 12756 KB Output is correct
14 Correct 55 ms 12732 KB Output is correct
15 Correct 66 ms 12668 KB Output is correct
16 Correct 57 ms 12660 KB Output is correct
17 Correct 53 ms 12284 KB Output is correct
18 Correct 56 ms 12492 KB Output is correct
19 Correct 56 ms 12404 KB Output is correct
20 Correct 56 ms 12412 KB Output is correct
21 Correct 62 ms 12540 KB Output is correct
22 Correct 54 ms 12500 KB Output is correct
23 Correct 44 ms 11432 KB Output is correct
24 Correct 45 ms 11388 KB Output is correct
25 Correct 47 ms 11708 KB Output is correct
26 Correct 49 ms 11648 KB Output is correct
27 Correct 52 ms 12180 KB Output is correct
28 Correct 53 ms 12328 KB Output is correct
29 Correct 52 ms 12324 KB Output is correct
30 Correct 55 ms 12216 KB Output is correct
31 Correct 44 ms 11384 KB Output is correct
32 Correct 43 ms 11440 KB Output is correct
33 Correct 44 ms 11524 KB Output is correct
34 Correct 48 ms 11680 KB Output is correct
35 Correct 52 ms 12184 KB Output is correct
36 Correct 57 ms 12340 KB Output is correct
37 Correct 56 ms 12180 KB Output is correct
38 Correct 51 ms 12028 KB Output is correct
39 Correct 51 ms 12156 KB Output is correct
40 Correct 60 ms 12148 KB Output is correct
41 Correct 61 ms 12788 KB Output is correct
42 Correct 54 ms 12540 KB Output is correct
43 Correct 59 ms 12460 KB Output is correct
44 Correct 55 ms 12780 KB Output is correct
45 Correct 54 ms 12656 KB Output is correct
46 Correct 66 ms 12648 KB Output is correct
47 Correct 49 ms 12156 KB Output is correct
48 Correct 51 ms 12032 KB Output is correct
49 Correct 50 ms 11892 KB Output is correct
50 Correct 50 ms 12032 KB Output is correct
51 Correct 43 ms 11644 KB Output is correct
52 Correct 43 ms 11772 KB Output is correct
53 Correct 50 ms 11836 KB Output is correct
54 Correct 49 ms 11972 KB Output is correct
55 Correct 51 ms 11836 KB Output is correct
56 Correct 44 ms 11852 KB Output is correct
57 Correct 48 ms 11628 KB Output is correct
58 Correct 51 ms 11388 KB Output is correct
59 Correct 46 ms 11836 KB Output is correct
60 Correct 45 ms 11644 KB Output is correct