oj.uz

Submission #427283

# Submission time Handle Problem Language Result Execution time Memory
427283 2021-06-14T13:55:34 Z amunduzbaev Stray Cat (JOI20_stray) C++14
14 / 100
 88 ms 14464 KB 
#include "Anthony.h"
#include "bits/stdc++.h"
using namespace std;

#define ff first
#define ss second
#define pb push_back
#define sz(x) (int)x.size()

const int N = 2e4+5;

namespace sol1{
	
	vector<int> res;
	vector<int> patt = {1, 0, 0, 1, 1, 0};
	vector<pair<int, int>> edges[N];
	
	
	void dfs(int u, int p = -1, int cur = 0, int in = 0){
		for(auto x : edges[u]){
			if(x.ff == p) continue;
			if(sz(edges[u]) == 2){
				res[x.ss] = patt[in];
				dfs(x.ff, u, res[x.ss], (in + 1) % 6);
			} else {
				res[x.ss] = cur ^ 1;
				if(cur) dfs(x.ff, u, cur ^ 1, 0);
				else dfs(x.ff, u, cur ^ 1, 0);
			}
		}
	}
	
	vector<int> Mark1(int n, int m, int a, int b, vector<int> u, vector<int> v){
		res.resize(m);
		for(int i=0;i<m;i++){
			int a = u[i] + 1, b = v[i] + 1;
			edges[a].pb({b, i}), edges[b].pb({a, i});
			res[i] = -1;
		} 
		
		edges[1].pb({-1, -1});
		dfs(1);
		
		//~ for(int i=0;i<m;i++) cout<<res[i]<<" ";
		//~ cout<<"\n";
		
		return res;
	}
}

namespace sol2{
	vector<int> Mark2(int n, int m, int a, int b, vector<int> u, vector<int> v){
		return {};
	}
}

vector<int> Mark(int n, int m, int a, int b, vector<int> u, vector<int> v) {
	if(a == 2) {
		return sol1::Mark1(n, m, a, b, u, v);
	} else {
		return sol2::Mark2(n, m, a, b, u, v);
	}
}

#include "Catherine.h"
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define sz(x) (int)x.size()

vector<int> path;
int a;

void Init(int a, int b) { ::a = a; }

namespace sol1{
	vector<int> ppat = {1, 1, 0, 1, 0, 0, 1, 1, 0, 1};
	int ok = 0, last = -1;
	vector<int> path;
	
	int Move(vector<int> y){
		if(ok){
			assert(~last);
			if(y[0] + y[1] + 1 > 2) return last ^= 1;
			if(y[0]) return last = 0;
			if(y[1]) return last = 1;
			return -1;
		}
		
		if(y[0] + y[1] + (last != -1) > 2){
			ok = 1;
			if(~last){
				if(min(y[0], y[1]) == 0) return -1;
				if(min(y[0], y[1]) == 1) return last ^= 1;
				assert(0);
			} else {
				if(y[0] == 1) return last = 0;
				if(y[1] == 1) return last = 1;
				assert(0);
			}
		} 
		
		if(y[0] + y[1] + (last != -1) == 1){
			ok = 1;
			if(y[0] == 1) return last = 0;
			if(y[1] == 1) return last = 1;
			return -1;
		}
		
		if(~last){
			if(y[0] == 1) path.pb(0), last = 0;
			else path.pb(1), last = 1;
		} else {
			if(y[0] == 2) path.pb(0), path.pb(0), last = 0;
			else if(y[1] == 2) path.pb(1), path.pb(1), last = 1;
			else path.pb(0), path.pb(1), last = 1;
		}
		
		if(sz(path) == 5){ ok = 1; 
			for(int i=0;i+5<=sz(ppat);i++){
				int l = i, r = i + 5 - 1, okk = 1;
				for(int j=l;j<=r;j++) okk &= (ppat[j] == path[j-i]);
				if(okk) return -1;
			} if(y[0]) return last = 0;
			else return last = 1;
		} else return last;
	} 
}

namespace sol2{
	int Move(vector<int> y){
		return 0;
	} 
}

int Move(vector<int> y) {
	if(a == 2) return sol1::Move(y);
	else return sol2::Move(y);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1512 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1512 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 11248 KB Output is correct
2 Correct 62 ms 12488 KB Output is correct
3 Correct 3 ms 1004 KB Output is correct
4 Correct 37 ms 11444 KB Output is correct
5 Correct 67 ms 14312 KB Output is correct
6 Correct 57 ms 14432 KB Output is correct
7 Correct 57 ms 13424 KB Output is correct
8 Correct 59 ms 13516 KB Output is correct
9 Correct 53 ms 14388 KB Output is correct
10 Correct 62 ms 14388 KB Output is correct
11 Correct 76 ms 14456 KB Output is correct
12 Correct 68 ms 14396 KB Output is correct
13 Correct 66 ms 14456 KB Output is correct
14 Correct 80 ms 14360 KB Output is correct
15 Correct 68 ms 14464 KB Output is correct
16 Correct 65 ms 14420 KB Output is correct
17 Correct 51 ms 13964 KB Output is correct
18 Correct 56 ms 14056 KB Output is correct
19 Correct 55 ms 14020 KB Output is correct
20 Correct 73 ms 14120 KB Output is correct
21 Correct 51 ms 14044 KB Output is correct
22 Correct 57 ms 14100 KB Output is correct
23 Correct 41 ms 11732 KB Output is correct
24 Correct 50 ms 11592 KB Output is correct
25 Correct 47 ms 12048 KB Output is correct
26 Correct 49 ms 12184 KB Output is correct
27 Correct 51 ms 12912 KB Output is correct
28 Correct 63 ms 13024 KB Output is correct
29 Correct 50 ms 13084 KB Output is correct
30 Correct 88 ms 13040 KB Output is correct
31 Correct 46 ms 11760 KB Output is correct
32 Correct 40 ms 11652 KB Output is correct
33 Correct 67 ms 12052 KB Output is correct
34 Correct 80 ms 12196 KB Output is correct
35 Incorrect 63 ms 12820 KB Wrong Answer [6]
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 11672 KB Output is correct
2 Correct 55 ms 12760 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 41 ms 11412 KB Output is correct
5 Correct 57 ms 14276 KB Output is correct
6 Correct 71 ms 14320 KB Output is correct
7 Correct 63 ms 13468 KB Output is correct
8 Correct 66 ms 13564 KB Output is correct
9 Correct 72 ms 14416 KB Output is correct
10 Correct 59 ms 14352 KB Output is correct
11 Correct 66 ms 14352 KB Output is correct
12 Correct 55 ms 14372 KB Output is correct
13 Correct 59 ms 14392 KB Output is correct
14 Correct 62 ms 14244 KB Output is correct
15 Correct 66 ms 14284 KB Output is correct
16 Correct 58 ms 14372 KB Output is correct
17 Correct 52 ms 14120 KB Output is correct
18 Correct 69 ms 13976 KB Output is correct
19 Correct 54 ms 14100 KB Output is correct
20 Correct 53 ms 14024 KB Output is correct
21 Correct 53 ms 14008 KB Output is correct
22 Correct 53 ms 14052 KB Output is correct
23 Correct 40 ms 11588 KB Output is correct
24 Correct 41 ms 11664 KB Output is correct
25 Correct 43 ms 12012 KB Output is correct
26 Correct 53 ms 12096 KB Output is correct
27 Correct 48 ms 13024 KB Output is correct
28 Correct 46 ms 13048 KB Output is correct
29 Correct 53 ms 13036 KB Output is correct
30 Correct 53 ms 13104 KB Output is correct
31 Correct 45 ms 11668 KB Output is correct
32 Correct 40 ms 11644 KB Output is correct
33 Correct 48 ms 12172 KB Output is correct
34 Correct 46 ms 12164 KB Output is correct
35 Correct 61 ms 12856 KB Output is correct
36 Correct 56 ms 12940 KB Output is correct
37 Correct 53 ms 12736 KB Output is correct
38 Correct 67 ms 12876 KB Output is correct
39 Correct 51 ms 12892 KB Output is correct
40 Correct 48 ms 12852 KB Output is correct
41 Correct 51 ms 13452 KB Output is correct
42 Correct 58 ms 13452 KB Output is correct
43 Correct 50 ms 13384 KB Output is correct
44 Correct 56 ms 13456 KB Output is correct
45 Correct 57 ms 13436 KB Output is correct
46 Correct 53 ms 13528 KB Output is correct
47 Correct 52 ms 12708 KB Output is correct
48 Correct 53 ms 12556 KB Output is correct
49 Correct 48 ms 12608 KB Output is correct
50 Correct 47 ms 12784 KB Output is correct
51 Correct 43 ms 11852 KB Output is correct
52 Correct 45 ms 11896 KB Output is correct
53 Correct 45 ms 11824 KB Output is correct
54 Correct 41 ms 11904 KB Output is correct
55 Correct 41 ms 11948 KB Output is correct
56 Correct 44 ms 11912 KB Output is correct
57 Correct 47 ms 11692 KB Output is correct
58 Correct 41 ms 11588 KB Output is correct
59 Correct 46 ms 11888 KB Output is correct
60 Correct 41 ms 11924 KB Output is correct