oj.uz

답안 #427622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427622 2021-06-14T17:57:47 Z amunduzbaev 길고양이 (JOI20_stray) C++14
85 / 100
 69 ms 14056 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 = {0, 1, 1, 0, 0, 1};
	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, 1);
				else dfs(x.ff, u, cur ^ 1, 2);
			}
		}
	}
	
	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 = {0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 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){
			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 == -1){
			if(y[0] == 2) { path.pb(0), path.pb(0); return last = 0; }
			else if(y[1] == 2) { path.pb(1), path.pb(1); return last = 1; }
			else { path.pb(0), path.pb(1); return last = 1; }
		} 
		else {
			if(y[0] == 1) last = 0, path.pb(0);
			if(y[1] == 1) last = 1, path.pb(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 1384 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

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

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1260 KB Output is correct
2 Correct 2 ms 1000 KB Output is correct
3 Correct 2 ms 1256 KB Output is correct
4 Correct 2 ms 1260 KB Output is correct
5 Correct 3 ms 1256 KB Output is correct
6 Correct 2 ms 1260 KB Output is correct
7 Correct 2 ms 1264 KB Output is correct
8 Correct 2 ms 1260 KB Output is correct
9 Correct 2 ms 1268 KB Output is correct
10 Correct 2 ms 1260 KB Output is correct
11 Correct 2 ms 1268 KB Output is correct
12 Correct 2 ms 1392 KB Output is correct
13 Correct 2 ms 1264 KB Output is correct
14 Correct 2 ms 1268 KB Output is correct
15 Correct 2 ms 1260 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 2 ms 1260 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 2 ms 1260 KB Output is correct
20 Correct 3 ms 1260 KB Output is correct
21 Correct 2 ms 1260 KB Output is correct
22 Correct 2 ms 1260 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 1268 KB Output is correct
26 Correct 2 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 3 ms 1260 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 11304 KB Output is correct
2 Correct 48 ms 12472 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 36 ms 11192 KB Output is correct
5 Correct 53 ms 13984 KB Output is correct
6 Correct 54 ms 13976 KB Output is correct
7 Correct 44 ms 13076 KB Output is correct
8 Correct 43 ms 13264 KB Output is correct
9 Correct 57 ms 14008 KB Output is correct
10 Correct 69 ms 13932 KB Output is correct
11 Correct 52 ms 13968 KB Output is correct
12 Correct 51 ms 14028 KB Output is correct
13 Correct 52 ms 14052 KB Output is correct
14 Correct 50 ms 13980 KB Output is correct
15 Correct 51 ms 13968 KB Output is correct
16 Correct 52 ms 13960 KB Output is correct
17 Correct 48 ms 13696 KB Output is correct
18 Correct 48 ms 13556 KB Output is correct
19 Correct 49 ms 13576 KB Output is correct
20 Correct 47 ms 13668 KB Output is correct
21 Correct 48 ms 13576 KB Output is correct
22 Correct 51 ms 13712 KB Output is correct
23 Correct 40 ms 11316 KB Output is correct
24 Correct 40 ms 11324 KB Output is correct
25 Correct 43 ms 11636 KB Output is correct
26 Correct 40 ms 11672 KB Output is correct
27 Correct 48 ms 12488 KB Output is correct
28 Correct 50 ms 12524 KB Output is correct
29 Correct 46 ms 12528 KB Output is correct
30 Correct 46 ms 12548 KB Output is correct
31 Correct 40 ms 11300 KB Output is correct
32 Correct 41 ms 11148 KB Output is correct
33 Correct 39 ms 11656 KB Output is correct
34 Correct 39 ms 11668 KB Output is correct
35 Correct 45 ms 12380 KB Output is correct
36 Correct 46 ms 12492 KB Output is correct
37 Correct 45 ms 12348 KB Output is correct
38 Correct 50 ms 12348 KB Output is correct
39 Correct 46 ms 12332 KB Output is correct
40 Correct 46 ms 12464 KB Output is correct
41 Correct 49 ms 13088 KB Output is correct
42 Correct 49 ms 12944 KB Output is correct
43 Correct 50 ms 12948 KB Output is correct
44 Correct 48 ms 13164 KB Output is correct
45 Correct 49 ms 13124 KB Output is correct
46 Correct 47 ms 13076 KB Output is correct
47 Correct 47 ms 12272 KB Output is correct
48 Correct 46 ms 12152 KB Output is correct
49 Correct 46 ms 12048 KB Output is correct
50 Correct 45 ms 12360 KB Output is correct
51 Correct 40 ms 11352 KB Output is correct
52 Correct 40 ms 11416 KB Output is correct
53 Correct 40 ms 11516 KB Output is correct
54 Correct 41 ms 11520 KB Output is correct
55 Correct 44 ms 11400 KB Output is correct
56 Correct 40 ms 11404 KB Output is correct
57 Correct 40 ms 11244 KB Output is correct
58 Correct 40 ms 11252 KB Output is correct
59 Correct 40 ms 11456 KB Output is correct
60 Correct 39 ms 11576 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 11220 KB Output is correct
2 Correct 43 ms 12304 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 39 ms 11224 KB Output is correct
5 Correct 53 ms 14052 KB Output is correct
6 Correct 55 ms 13876 KB Output is correct
7 Correct 41 ms 13140 KB Output is correct
8 Correct 44 ms 13052 KB Output is correct
9 Correct 53 ms 13924 KB Output is correct
10 Correct 53 ms 14056 KB Output is correct
11 Correct 52 ms 13972 KB Output is correct
12 Correct 56 ms 13992 KB Output is correct
13 Correct 53 ms 14008 KB Output is correct
14 Correct 53 ms 13944 KB Output is correct
15 Correct 51 ms 13920 KB Output is correct
16 Correct 53 ms 13976 KB Output is correct
17 Correct 49 ms 13620 KB Output is correct
18 Correct 48 ms 13660 KB Output is correct
19 Correct 48 ms 13680 KB Output is correct
20 Correct 47 ms 13704 KB Output is correct
21 Correct 48 ms 13720 KB Output is correct
22 Correct 49 ms 13644 KB Output is correct
23 Correct 39 ms 11348 KB Output is correct
24 Correct 39 ms 11288 KB Output is correct
25 Correct 44 ms 11696 KB Output is correct
26 Correct 40 ms 11736 KB Output is correct
27 Correct 47 ms 12472 KB Output is correct
28 Correct 46 ms 12512 KB Output is correct
29 Correct 46 ms 12584 KB Output is correct
30 Correct 48 ms 12552 KB Output is correct
31 Correct 40 ms 11376 KB Output is correct
32 Correct 40 ms 11240 KB Output is correct
33 Correct 41 ms 11672 KB Output is correct
34 Correct 41 ms 11764 KB Output is correct
35 Correct 48 ms 12368 KB Output is correct
36 Correct 45 ms 12368 KB Output is correct
37 Correct 47 ms 12460 KB Output is correct
38 Correct 47 ms 12368 KB Output is correct
39 Correct 46 ms 12380 KB Output is correct
40 Correct 46 ms 12464 KB Output is correct
41 Correct 48 ms 13088 KB Output is correct
42 Correct 53 ms 13052 KB Output is correct
43 Correct 47 ms 13048 KB Output is correct
44 Correct 52 ms 13180 KB Output is correct
45 Correct 48 ms 13156 KB Output is correct
46 Correct 47 ms 13088 KB Output is correct
47 Correct 44 ms 12296 KB Output is correct
48 Correct 44 ms 12172 KB Output is correct
49 Correct 43 ms 12228 KB Output is correct
50 Correct 46 ms 12252 KB Output is correct
51 Correct 43 ms 11468 KB Output is correct
52 Correct 41 ms 11452 KB Output is correct
53 Correct 40 ms 11444 KB Output is correct
54 Correct 40 ms 11396 KB Output is correct
55 Correct 40 ms 11416 KB Output is correct
56 Correct 40 ms 11472 KB Output is correct
57 Correct 40 ms 11304 KB Output is correct
58 Correct 40 ms 11260 KB Output is correct
59 Correct 40 ms 11596 KB Output is correct
60 Correct 40 ms 11544 KB Output is correct