oj.uz

답안 #427620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
427620 2021-06-14T17:55:55 Z amunduzbaev 길고양이 (JOI20_stray) C++14
85 / 100
 67 ms 14124 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};
	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 6 ms 1392 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

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

Subtask #5
5.0 / 5.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 11312 KB Output is correct
2 Correct 45 ms 12432 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 34 ms 11176 KB Output is correct
5 Correct 56 ms 13984 KB Output is correct
6 Correct 60 ms 13960 KB Output is correct
7 Correct 44 ms 13088 KB Output is correct
8 Correct 44 ms 13132 KB Output is correct
9 Correct 59 ms 13860 KB Output is correct
10 Correct 54 ms 13956 KB Output is correct
11 Correct 51 ms 13968 KB Output is correct
12 Correct 49 ms 14028 KB Output is correct
13 Correct 52 ms 13948 KB Output is correct
14 Correct 52 ms 14048 KB Output is correct
15 Correct 51 ms 13952 KB Output is correct
16 Correct 50 ms 13924 KB Output is correct
17 Correct 49 ms 13612 KB Output is correct
18 Correct 56 ms 13836 KB Output is correct
19 Correct 51 ms 13656 KB Output is correct
20 Correct 48 ms 13696 KB Output is correct
21 Correct 50 ms 13692 KB Output is correct
22 Correct 48 ms 13728 KB Output is correct
23 Correct 40 ms 11280 KB Output is correct
24 Correct 43 ms 11212 KB Output is correct
25 Correct 45 ms 11724 KB Output is correct
26 Correct 43 ms 11592 KB Output is correct
27 Correct 52 ms 12520 KB Output is correct
28 Correct 51 ms 12532 KB Output is correct
29 Correct 49 ms 12496 KB Output is correct
30 Correct 49 ms 12448 KB Output is correct
31 Correct 40 ms 11276 KB Output is correct
32 Correct 45 ms 11308 KB Output is correct
33 Correct 41 ms 11652 KB Output is correct
34 Correct 40 ms 11720 KB Output is correct
35 Correct 47 ms 12440 KB Output is correct
36 Correct 46 ms 12416 KB Output is correct
37 Correct 50 ms 12432 KB Output is correct
38 Correct 47 ms 12372 KB Output is correct
39 Correct 49 ms 12440 KB Output is correct
40 Correct 52 ms 12472 KB Output is correct
41 Correct 52 ms 13084 KB Output is correct
42 Correct 49 ms 13092 KB Output is correct
43 Correct 53 ms 13040 KB Output is correct
44 Correct 59 ms 13156 KB Output is correct
45 Correct 49 ms 13080 KB Output is correct
46 Correct 51 ms 13056 KB Output is correct
47 Correct 44 ms 12240 KB Output is correct
48 Correct 48 ms 12304 KB Output is correct
49 Correct 48 ms 12292 KB Output is correct
50 Correct 49 ms 12252 KB Output is correct
51 Correct 41 ms 11400 KB Output is correct
52 Correct 40 ms 11432 KB Output is correct
53 Correct 40 ms 11476 KB Output is correct
54 Correct 43 ms 11452 KB Output is correct
55 Correct 46 ms 11392 KB Output is correct
56 Correct 40 ms 11416 KB Output is correct
57 Correct 40 ms 11220 KB Output is correct
58 Correct 40 ms 11288 KB Output is correct
59 Correct 41 ms 11544 KB Output is correct
60 Correct 41 ms 11484 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 11176 KB Output is correct
2 Correct 43 ms 12144 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 34 ms 11132 KB Output is correct
5 Correct 52 ms 13912 KB Output is correct
6 Correct 53 ms 13924 KB Output is correct
7 Correct 44 ms 13100 KB Output is correct
8 Correct 48 ms 13036 KB Output is correct
9 Correct 67 ms 13996 KB Output is correct
10 Correct 52 ms 13956 KB Output is correct
11 Correct 51 ms 13968 KB Output is correct
12 Correct 65 ms 14088 KB Output is correct
13 Correct 53 ms 13832 KB Output is correct
14 Correct 50 ms 13956 KB Output is correct
15 Correct 51 ms 14124 KB Output is correct
16 Correct 52 ms 13968 KB Output is correct
17 Correct 49 ms 13692 KB Output is correct
18 Correct 51 ms 13696 KB Output is correct
19 Correct 47 ms 13720 KB Output is correct
20 Correct 49 ms 13740 KB Output is correct
21 Correct 50 ms 13712 KB Output is correct
22 Correct 49 ms 13656 KB Output is correct
23 Correct 40 ms 11276 KB Output is correct
24 Correct 40 ms 11308 KB Output is correct
25 Correct 40 ms 11596 KB Output is correct
26 Correct 41 ms 11852 KB Output is correct
27 Correct 46 ms 12420 KB Output is correct
28 Correct 46 ms 12456 KB Output is correct
29 Correct 46 ms 12620 KB Output is correct
30 Correct 50 ms 12528 KB Output is correct
31 Correct 40 ms 11280 KB Output is correct
32 Correct 38 ms 11340 KB Output is correct
33 Correct 40 ms 11764 KB Output is correct
34 Correct 40 ms 11756 KB Output is correct
35 Correct 46 ms 12384 KB Output is correct
36 Correct 45 ms 12408 KB Output is correct
37 Correct 45 ms 12452 KB Output is correct
38 Correct 47 ms 12340 KB Output is correct
39 Correct 54 ms 12380 KB Output is correct
40 Correct 46 ms 12396 KB Output is correct
41 Correct 49 ms 13068 KB Output is correct
42 Correct 51 ms 12984 KB Output is correct
43 Correct 52 ms 13032 KB Output is correct
44 Correct 64 ms 13144 KB Output is correct
45 Correct 48 ms 13008 KB Output is correct
46 Correct 49 ms 13084 KB Output is correct
47 Correct 45 ms 12344 KB Output is correct
48 Correct 47 ms 12156 KB Output is correct
49 Correct 49 ms 12236 KB Output is correct
50 Correct 44 ms 12308 KB Output is correct
51 Correct 40 ms 11480 KB Output is correct
52 Correct 40 ms 11464 KB Output is correct
53 Correct 40 ms 11408 KB Output is correct
54 Correct 52 ms 11328 KB Output is correct
55 Correct 45 ms 11592 KB Output is correct
56 Correct 40 ms 11500 KB Output is correct
57 Correct 40 ms 11284 KB Output is correct
58 Correct 41 ms 11304 KB Output is correct
59 Correct 50 ms 11548 KB Output is correct
60 Correct 41 ms 11548 KB Output is correct