oj.uz

Submission #427358

# Submission time Handle Problem Language Result Execution time Memory
427358 2021-06-14T14:31:43 Z amunduzbaev Stray Cat (JOI20_stray) C++14
14 / 100
 74 ms 14424 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] == 0) return last = 1;
			if(y[1] == 0) return last = 0;
			assert(0); 
		}
		
		if(y[0] + y[1] + (last != -1) > 2){
			if(last != -1) y[last]++;
			ok = 1;
			if(y[0] == 1){
				if(last == 0) return -1;
				return last = 0;
			} if(y[1] == 1){
				if(last == 1) return -1;
				return last = 1;
			}
		} 
		
		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 5 ms 1380 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 11256 KB Output is correct
2 Correct 46 ms 12364 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 36 ms 11208 KB Output is correct
5 Correct 67 ms 13900 KB Output is correct
6 Correct 63 ms 13868 KB Output is correct
7 Correct 44 ms 13448 KB Output is correct
8 Correct 52 ms 13416 KB Output is correct
9 Correct 55 ms 14404 KB Output is correct
10 Correct 59 ms 14336 KB Output is correct
11 Correct 60 ms 14356 KB Output is correct
12 Correct 69 ms 14336 KB Output is correct
13 Correct 74 ms 14376 KB Output is correct
14 Correct 60 ms 14312 KB Output is correct
15 Correct 61 ms 14308 KB Output is correct
16 Correct 59 ms 14312 KB Output is correct
17 Correct 65 ms 14060 KB Output is correct
18 Correct 64 ms 14036 KB Output is correct
19 Correct 51 ms 14152 KB Output is correct
20 Correct 51 ms 14036 KB Output is correct
21 Correct 54 ms 14080 KB Output is correct
22 Correct 70 ms 14096 KB Output is correct
23 Correct 40 ms 11696 KB Output is correct
24 Correct 40 ms 11664 KB Output is correct
25 Correct 51 ms 12124 KB Output is correct
26 Correct 43 ms 12176 KB Output is correct
27 Correct 57 ms 13040 KB Output is correct
28 Correct 46 ms 13036 KB Output is correct
29 Correct 50 ms 13016 KB Output is correct
30 Correct 54 ms 13100 KB Output is correct
31 Correct 44 ms 11580 KB Output is correct
32 Correct 44 ms 11688 KB Output is correct
33 Correct 43 ms 12100 KB Output is correct
34 Correct 52 ms 12056 KB Output is correct
35 Incorrect 56 ms 12344 KB Wrong Answer [5]
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 11132 KB Output is correct
2 Correct 43 ms 12148 KB Output is correct
3 Correct 2 ms 1000 KB Output is correct
4 Correct 49 ms 11084 KB Output is correct
5 Correct 57 ms 13988 KB Output is correct
6 Correct 62 ms 13956 KB Output is correct
7 Correct 57 ms 13092 KB Output is correct
8 Correct 53 ms 13596 KB Output is correct
9 Correct 68 ms 14300 KB Output is correct
10 Correct 51 ms 14360 KB Output is correct
11 Correct 72 ms 14424 KB Output is correct
12 Correct 62 ms 14296 KB Output is correct
13 Correct 64 ms 14312 KB Output is correct
14 Correct 72 ms 14296 KB Output is correct
15 Correct 56 ms 14292 KB Output is correct
16 Correct 64 ms 14400 KB Output is correct
17 Correct 71 ms 14020 KB Output is correct
18 Correct 55 ms 14052 KB Output is correct
19 Correct 68 ms 14108 KB Output is correct
20 Correct 73 ms 14116 KB Output is correct
21 Correct 60 ms 14008 KB Output is correct
22 Correct 56 ms 14048 KB Output is correct
23 Correct 48 ms 11640 KB Output is correct
24 Correct 49 ms 11692 KB Output is correct
25 Correct 53 ms 12100 KB Output is correct
26 Correct 41 ms 12144 KB Output is correct
27 Correct 50 ms 13032 KB Output is correct
28 Correct 51 ms 13064 KB Output is correct
29 Correct 59 ms 13048 KB Output is correct
30 Correct 56 ms 13080 KB Output is correct
31 Correct 46 ms 11616 KB Output is correct
32 Correct 49 ms 11624 KB Output is correct
33 Correct 50 ms 12120 KB Output is correct
34 Correct 43 ms 12252 KB Output is correct
35 Correct 50 ms 12876 KB Output is correct
36 Correct 48 ms 12740 KB Output is correct
37 Correct 52 ms 12840 KB Output is correct
38 Correct 51 ms 12784 KB Output is correct
39 Correct 59 ms 12848 KB Output is correct
40 Correct 50 ms 12784 KB Output is correct
41 Correct 48 ms 13536 KB Output is correct
42 Correct 53 ms 13468 KB Output is correct
43 Correct 50 ms 13504 KB Output is correct
44 Correct 59 ms 13532 KB Output is correct
45 Correct 49 ms 13520 KB Output is correct
46 Correct 49 ms 13608 KB Output is correct
47 Correct 45 ms 12808 KB Output is correct
48 Correct 44 ms 12656 KB Output is correct
49 Correct 51 ms 12648 KB Output is correct
50 Correct 46 ms 12724 KB Output is correct
51 Correct 40 ms 11836 KB Output is correct
52 Correct 53 ms 11884 KB Output is correct
53 Correct 52 ms 11816 KB Output is correct
54 Correct 40 ms 11884 KB Output is correct
55 Correct 46 ms 11872 KB Output is correct
56 Correct 53 ms 11740 KB Output is correct
57 Correct 41 ms 11616 KB Output is correct
58 Correct 49 ms 11580 KB Output is correct
59 Correct 43 ms 11952 KB Output is correct
60 Correct 43 ms 11792 KB Output is correct