oj.uz

답안 #427289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427289 2021-06-14T13:57:32 Z amunduzbaev 길고양이 (JOI20_stray) C++14
14 / 100
 76 ms 21020 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;
			assert(0);
		}
		
		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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1860 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 1860 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 1916 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 1916 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1244 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1272 KB Output is correct
4 Correct 2 ms 1264 KB Output is correct
5 Correct 2 ms 1316 KB Output is correct
6 Correct 3 ms 1264 KB Output is correct
7 Correct 2 ms 1264 KB Output is correct
8 Correct 2 ms 1264 KB Output is correct
9 Correct 2 ms 1244 KB Output is correct
10 Correct 4 ms 1256 KB Output is correct
11 Correct 2 ms 1268 KB Output is correct
12 Correct 3 ms 1260 KB Output is correct
13 Correct 2 ms 1308 KB Output is correct
14 Correct 2 ms 1284 KB Output is correct
15 Correct 2 ms 1296 KB Output is correct
16 Correct 2 ms 1264 KB Output is correct
17 Correct 2 ms 1264 KB Output is correct
18 Correct 3 ms 1260 KB Output is correct
19 Correct 2 ms 1264 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 1268 KB Output is correct
23 Correct 2 ms 1240 KB Output is correct
24 Correct 3 ms 1264 KB Output is correct
25 Correct 3 ms 1272 KB Output is correct
26 Correct 2 ms 1260 KB Output is correct
27 Correct 2 ms 1268 KB Output is correct
28 Correct 2 ms 1276 KB Output is correct

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 11620 KB Output is correct
2 Correct 56 ms 12912 KB Output is correct
3 Correct 2 ms 1008 KB Output is correct
4 Correct 41 ms 11388 KB Output is correct
5 Correct 63 ms 14348 KB Output is correct
6 Correct 68 ms 14444 KB Output is correct
7 Correct 59 ms 13376 KB Output is correct
8 Correct 47 ms 13432 KB Output is correct
9 Correct 63 ms 14324 KB Output is correct
10 Correct 59 ms 14288 KB Output is correct
11 Correct 74 ms 14372 KB Output is correct
12 Correct 61 ms 14484 KB Output is correct
13 Correct 54 ms 14296 KB Output is correct
14 Correct 61 ms 14448 KB Output is correct
15 Correct 69 ms 14348 KB Output is correct
16 Correct 76 ms 14452 KB Output is correct
17 Correct 58 ms 14060 KB Output is correct
18 Correct 54 ms 14000 KB Output is correct
19 Correct 56 ms 14072 KB Output is correct
20 Correct 66 ms 14032 KB Output is correct
21 Correct 54 ms 14112 KB Output is correct
22 Correct 64 ms 14008 KB Output is correct
23 Correct 46 ms 11696 KB Output is correct
24 Correct 46 ms 11636 KB Output is correct
25 Correct 44 ms 12044 KB Output is correct
26 Correct 43 ms 12120 KB Output is correct
27 Correct 56 ms 13052 KB Output is correct
28 Correct 54 ms 13028 KB Output is correct
29 Correct 57 ms 13012 KB Output is correct
30 Correct 57 ms 12932 KB Output is correct
31 Correct 52 ms 11728 KB Output is correct
32 Correct 45 ms 11696 KB Output is correct
33 Correct 44 ms 12076 KB Output is correct
34 Correct 48 ms 12092 KB Output is correct
35 Runtime error 49 ms 21020 KB Execution killed with signal 6
36 Halted 0 ms 0 KB -

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 11620 KB Output is correct
2 Correct 49 ms 12684 KB Output is correct
3 Correct 2 ms 1008 KB Output is correct
4 Correct 46 ms 11392 KB Output is correct
5 Correct 60 ms 14308 KB Output is correct
6 Correct 55 ms 14400 KB Output is correct
7 Correct 56 ms 13584 KB Output is correct
8 Correct 46 ms 13484 KB Output is correct
9 Correct 54 ms 14312 KB Output is correct
10 Correct 55 ms 14280 KB Output is correct
11 Correct 57 ms 14464 KB Output is correct
12 Correct 57 ms 14380 KB Output is correct
13 Correct 53 ms 14332 KB Output is correct
14 Correct 57 ms 14324 KB Output is correct
15 Correct 53 ms 14312 KB Output is correct
16 Correct 52 ms 14332 KB Output is correct
17 Correct 50 ms 14048 KB Output is correct
18 Correct 65 ms 13940 KB Output is correct
19 Correct 50 ms 14136 KB Output is correct
20 Correct 60 ms 14112 KB Output is correct
21 Correct 58 ms 14056 KB Output is correct
22 Correct 52 ms 14136 KB Output is correct
23 Correct 42 ms 11620 KB Output is correct
24 Correct 39 ms 11616 KB Output is correct
25 Correct 40 ms 12028 KB Output is correct
26 Correct 49 ms 12100 KB Output is correct
27 Correct 49 ms 12948 KB Output is correct
28 Correct 46 ms 13096 KB Output is correct
29 Correct 48 ms 13068 KB Output is correct
30 Correct 58 ms 13100 KB Output is correct
31 Correct 40 ms 11632 KB Output is correct
32 Correct 40 ms 11656 KB Output is correct
33 Correct 43 ms 12144 KB Output is correct
34 Correct 45 ms 12248 KB Output is correct
35 Correct 45 ms 12440 KB Output is correct
36 Correct 47 ms 12512 KB Output is correct
37 Correct 47 ms 12388 KB Output is correct
38 Correct 46 ms 12488 KB Output is correct
39 Correct 47 ms 12416 KB Output is correct
40 Correct 47 ms 12492 KB Output is correct
41 Correct 48 ms 13060 KB Output is correct
42 Correct 49 ms 13076 KB Output is correct
43 Correct 56 ms 13048 KB Output is correct
44 Correct 51 ms 13028 KB Output is correct
45 Correct 52 ms 13044 KB Output is correct
46 Correct 66 ms 13008 KB Output is correct
47 Correct 57 ms 12236 KB Output is correct
48 Correct 66 ms 12160 KB Output is correct
49 Correct 45 ms 12128 KB Output is correct
50 Correct 55 ms 12352 KB Output is correct
51 Correct 45 ms 11360 KB Output is correct
52 Correct 41 ms 11532 KB Output is correct
53 Correct 44 ms 11468 KB Output is correct
54 Correct 47 ms 11392 KB Output is correct
55 Correct 44 ms 11344 KB Output is correct
56 Correct 40 ms 11400 KB Output is correct
57 Correct 50 ms 11256 KB Output is correct
58 Correct 44 ms 11140 KB Output is correct
59 Correct 45 ms 11552 KB Output is correct
60 Correct 43 ms 11376 KB Output is correct