oj.uz

Submission #514019

# Submission time Handle Problem Language Result Execution time Memory
514019 2022-01-18T02:20:36 Z 8e7 Stray Cat (JOI20_stray) C++17
76 / 100
 50 ms 15704 KB 
#include "Anthony.h"
#include <vector>
#include <bits/stdc++.h>
#define maxn 20005
#define pii pair<int, int>
using namespace std;
namespace {
	vector<pii> adj[maxn];
	int res[maxn];
	int arr[6] = {0, 0, 1, 0, 1, 1};
	const int inf = 8e7;
	void dfs(int n, int par, int ind, int prv) {
		int deg = adj[n].size() - (par == -1 ? 0 : 1);
		if (deg == 1) {
			for (auto [v, id]:adj[n]) {
				if (v != par) {
					res[id] = arr[ind];
					dfs(v, n, (ind+1)%6, res[id]);
				}
			}
		} else {
			for (auto [v, id]:adj[n]) {
				if (v != par) {
					res[id] = prv ^ 1;
					dfs(v, n, res[id] ? 5 : 1, res[id]);
				}
			}
		}
	}	
}; 

vector<int> Mark(int N, int M, int A, int B,
                      vector<int> U, vector<int> V) {
	for (int i = 0;i < M;i++) adj[U[i]].push_back({V[i], i}), adj[V[i]].push_back({U[i], i});
	vector<int> X(M);
	dfs(0, -1, 0, 0);	
	for (int i = 0;i < M;i++) X[i] = res[i];
	return X;
}

#include "Catherine.h"
#include <vector>
#include "assert.h"
using namespace std;

namespace {
	int A, B;
	bool type = 0;
	int prv = 0, step = 0, mask = 0;
	int check[6] = {11, 22, 44, 25, 50, 37};
};  

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

int Move(vector<int> y) {	
	int sum = y[0] + y[1];
	sum += (step ? 1 : 0);	
	if (sum > 2) {
		step++;
		if (y[0] == 0 || y[1] == 0) {
			return -1;
		} 
		if (step > 1) y[prv]++;
		prv = y[0] == 1 ? 0 : 1;
		return prv;
	} else {
		if (step) sum--;
		step++;
		if (sum == 1) {
			if (type && step == 7) {
				bool match = 0;
				for (int i = 0;i < 6;i++) {
					if (mask == check[i]) match = 1;
				}	
				if (match) return -1;
			}
			prv = y[0] == 1 ? 0 : 1;
			if (step < 7) mask = mask * 2 + prv;
			return prv;
		} else {
			if (sum == 0) return -1;
			prv = y[0] ? 0 : 1;
			type = 1;
			mask = mask * 2 + prv;
			return prv;	
		}
	}
}
/*
11 10 2 6 6
0 2
0 3
0 4
3 5
5 7
5 8
7 10
4 6
6 9
9 1
*/

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 15704 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 15704 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13328 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 27 ms 12648 KB Output is correct
4 Correct 45 ms 15060 KB Output is correct
5 Incorrect 38 ms 15064 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13328 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 27 ms 12648 KB Output is correct
4 Correct 45 ms 15060 KB Output is correct
5 Incorrect 38 ms 15064 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10888 KB Output is correct
2 Correct 44 ms 11960 KB Output is correct
3 Correct 1 ms 1008 KB Output is correct
4 Correct 31 ms 10816 KB Output is correct
5 Correct 38 ms 13492 KB Output is correct
6 Correct 43 ms 13488 KB Output is correct
7 Correct 32 ms 12512 KB Output is correct
8 Correct 36 ms 12624 KB Output is correct
9 Correct 49 ms 13568 KB Output is correct
10 Correct 50 ms 13468 KB Output is correct
11 Correct 38 ms 13476 KB Output is correct
12 Correct 41 ms 13572 KB Output is correct
13 Correct 38 ms 13476 KB Output is correct
14 Correct 40 ms 13488 KB Output is correct
15 Correct 38 ms 13504 KB Output is correct
16 Correct 38 ms 13528 KB Output is correct
17 Correct 34 ms 13196 KB Output is correct
18 Correct 41 ms 13576 KB Output is correct
19 Correct 46 ms 13612 KB Output is correct
20 Correct 38 ms 13588 KB Output is correct
21 Correct 35 ms 13564 KB Output is correct
22 Correct 35 ms 13636 KB Output is correct
23 Correct 28 ms 11384 KB Output is correct
24 Correct 31 ms 11440 KB Output is correct
25 Correct 32 ms 11892 KB Output is correct
26 Correct 30 ms 11828 KB Output is correct
27 Correct 40 ms 12656 KB Output is correct
28 Correct 40 ms 12660 KB Output is correct
29 Correct 35 ms 12672 KB Output is correct
30 Correct 35 ms 12548 KB Output is correct
31 Correct 32 ms 11332 KB Output is correct
32 Correct 31 ms 11480 KB Output is correct
33 Correct 35 ms 11884 KB Output is correct
34 Correct 31 ms 11912 KB Output is correct
35 Correct 35 ms 12460 KB Output is correct
36 Correct 38 ms 12592 KB Output is correct
37 Correct 41 ms 12460 KB Output is correct
38 Correct 44 ms 12368 KB Output is correct
39 Correct 44 ms 12464 KB Output is correct
40 Correct 37 ms 12316 KB Output is correct
41 Correct 35 ms 13028 KB Output is correct
42 Correct 35 ms 13088 KB Output is correct
43 Correct 34 ms 13100 KB Output is correct
44 Correct 37 ms 13044 KB Output is correct
45 Correct 43 ms 13156 KB Output is correct
46 Correct 44 ms 13144 KB Output is correct
47 Correct 39 ms 12412 KB Output is correct
48 Correct 34 ms 12376 KB Output is correct
49 Correct 36 ms 12168 KB Output is correct
50 Correct 36 ms 12336 KB Output is correct
51 Correct 36 ms 11372 KB Output is correct
52 Correct 35 ms 11284 KB Output is correct
53 Correct 30 ms 11340 KB Output is correct
54 Correct 32 ms 11340 KB Output is correct
55 Correct 33 ms 11276 KB Output is correct
56 Correct 37 ms 11320 KB Output is correct
57 Correct 30 ms 11552 KB Output is correct
58 Correct 30 ms 11484 KB Output is correct
59 Correct 30 ms 11700 KB Output is correct
60 Correct 28 ms 11684 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11152 KB Output is correct
2 Correct 33 ms 11880 KB Output is correct
3 Correct 1 ms 1008 KB Output is correct
4 Correct 28 ms 10940 KB Output is correct
5 Correct 41 ms 13388 KB Output is correct
6 Correct 39 ms 13468 KB Output is correct
7 Incorrect 29 ms 12628 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -