oj.uz

답안 #223874

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223874 2020-04-16T19:22:44 Z super_j6 길고양이 (JOI20_stray) C++14
100 / 100
 106 ms 16796 KB 
#include "Anthony.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
#define vi vector<int>

const int maxn = 20000, k = 6;
int d[maxn];
vi graph[maxn];
queue<int> q;
int s[k] = {0, 0, 1, 0, 1, 1};
vi ans;

vi Mark(int n, int m, int a, int b, vi u, vi v){
	ans.resize(m);
	for(int i = 0; i < m; i++){
		graph[u[i]].push_back(i);
		graph[v[i]].push_back(i);
	}
	d[0] = 1;
	if(a > 2){
		q.push(0);
		while(!q.empty()){
			int c = q.front();
			q.pop();
			for(int i : graph[c]){
				int j = u[i] ^ v[i] ^ c; 
				if(!d[j]){
					d[j] = d[c] + 1;
					q.push(j);
				}
				if(d[j] == d[c] || d[j] == d[c] + 1){
					ans[i] = d[c] % 3;
				}
			}
		}
	}else{
		function<void(int, int)> dfs = [&](int c, int p){
			for(int i : graph[c]){
				int j = u[i] ^ v[i] ^ c;
				if(j != p){
					ans[i] = s[d[c]];
					d[j] = graph[j].size() > 2 ? (ans[i] ^ 1) << 1 : (d[c] + 1) % k;
					dfs(j, c);
				}
			}
		};
		dfs(0, -1);
	}
	return ans;
}
#include "Catherine.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second
#define vi vector<int>

const int k = 6;
int a, b;
int prv = -1;
bool f = 0;
int s[k] = {0, 0, 1, 0, 1, 1};
vi t;

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

int Move(vi v){
	if(a > 2){
		if(~prv) v[prv]++;
		for(int i = 0; i < 3; i++){
			if(v[i] && v[(i + 1) % 3]) return prv = i;
		}
		for(int i = 0; i < 3; i++){
			if(v[i]) return prv = i;
		}
	}else{
		if(f){
			if(v[0] + v[1] > 1) v[prv]++;
			return prv = (v[0] == 1) ^ 1;
		}
		if(!~prv){
			if(v[0] + v[1] != 2){
				f = 1;
				return prv = (v[0] == 1) ^ 1; 
			}
			prv = (v[0] > 0) ^ 1;
			t.push_back((v[0] > 1) ^ 1);
			t.push_back(prv);
			return prv;
		}
		if(v[0] + v[1] == 0){
			f = 1;
			return -1;
		}
		if(v[0] + v[1] > 1){
			f = 1;
			return !v[prv] ? -1 : prv ^= 1;
		}
		t.push_back((v[0] == 1) ^ 1);
		if(t.size() == k - 1){
			for(int i = 0; i < k; i++){
				f = 1;
				for(int j = 0; j < k - 1; j++) f &= s[(i + j) % k] == t[j];
				if(f) return -1;
			}
			f = 1;
		}
		return prv = (v[0] == 1) ^ 1;
	}
	return -2;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 15856 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 46 ms 15108 KB Output is correct
4 Correct 65 ms 16756 KB Output is correct
5 Correct 72 ms 16796 KB Output is correct
6 Correct 53 ms 15492 KB Output is correct
7 Correct 52 ms 15368 KB Output is correct
8 Correct 60 ms 15988 KB Output is correct
9 Correct 106 ms 16148 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 15856 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 46 ms 15108 KB Output is correct
4 Correct 65 ms 16756 KB Output is correct
5 Correct 72 ms 16796 KB Output is correct
6 Correct 53 ms 15492 KB Output is correct
7 Correct 52 ms 15368 KB Output is correct
8 Correct 60 ms 15988 KB Output is correct
9 Correct 106 ms 16148 KB Output is correct
10 Correct 53 ms 13660 KB Output is correct
11 Correct 51 ms 13508 KB Output is correct
12 Correct 52 ms 13668 KB Output is correct
13 Correct 55 ms 13664 KB Output is correct
14 Correct 51 ms 13700 KB Output is correct
15 Correct 54 ms 14076 KB Output is correct
16 Correct 57 ms 16280 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 13308 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 44 ms 13032 KB Output is correct
4 Correct 67 ms 14624 KB Output is correct
5 Correct 62 ms 14588 KB Output is correct
6 Correct 53 ms 13540 KB Output is correct
7 Correct 54 ms 13408 KB Output is correct
8 Correct 57 ms 13824 KB Output is correct
9 Correct 57 ms 13968 KB Output is correct
10 Correct 55 ms 13816 KB Output is correct
11 Correct 55 ms 13708 KB Output is correct
12 Correct 55 ms 13692 KB Output is correct
13 Correct 70 ms 13668 KB Output is correct
14 Correct 56 ms 13948 KB Output is correct
15 Correct 57 ms 14168 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 13308 KB Output is correct
2 Correct 10 ms 1536 KB Output is correct
3 Correct 44 ms 13032 KB Output is correct
4 Correct 67 ms 14624 KB Output is correct
5 Correct 62 ms 14588 KB Output is correct
6 Correct 53 ms 13540 KB Output is correct
7 Correct 54 ms 13408 KB Output is correct
8 Correct 57 ms 13824 KB Output is correct
9 Correct 57 ms 13968 KB Output is correct
10 Correct 55 ms 13816 KB Output is correct
11 Correct 55 ms 13708 KB Output is correct
12 Correct 55 ms 13692 KB Output is correct
13 Correct 70 ms 13668 KB Output is correct
14 Correct 56 ms 13948 KB Output is correct
15 Correct 57 ms 14168 KB Output is correct
16 Correct 48 ms 11664 KB Output is correct
17 Correct 47 ms 11672 KB Output is correct
18 Correct 49 ms 11908 KB Output is correct
19 Correct 60 ms 11840 KB Output is correct
20 Correct 52 ms 12156 KB Output is correct
21 Correct 51 ms 11904 KB Output is correct
22 Correct 62 ms 14244 KB Output is correct
23 Correct 48 ms 11752 KB Output is correct
24 Correct 48 ms 11872 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1536 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 10 ms 1792 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 10 ms 1792 KB Output is correct
6 Correct 10 ms 1792 KB Output is correct
7 Correct 10 ms 1792 KB Output is correct
8 Correct 10 ms 1908 KB Output is correct
9 Correct 10 ms 1792 KB Output is correct
10 Correct 10 ms 1792 KB Output is correct
11 Correct 10 ms 1792 KB Output is correct
12 Correct 10 ms 1792 KB Output is correct
13 Correct 10 ms 1792 KB Output is correct
14 Correct 10 ms 1792 KB Output is correct
15 Correct 10 ms 1792 KB Output is correct
16 Correct 10 ms 1536 KB Output is correct
17 Correct 10 ms 1536 KB Output is correct
18 Correct 10 ms 1536 KB Output is correct
19 Correct 10 ms 1536 KB Output is correct
20 Correct 10 ms 1792 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 10 ms 1536 KB Output is correct
23 Correct 10 ms 1792 KB Output is correct
24 Correct 10 ms 1536 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 10 ms 1600 KB Output is correct
27 Correct 10 ms 1536 KB Output is correct
28 Correct 10 ms 1536 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 11628 KB Output is correct
2 Correct 56 ms 12552 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 42 ms 11496 KB Output is correct
5 Correct 59 ms 14076 KB Output is correct
6 Correct 59 ms 14444 KB Output is correct
7 Correct 50 ms 13324 KB Output is correct
8 Correct 50 ms 13320 KB Output is correct
9 Correct 59 ms 14072 KB Output is correct
10 Correct 57 ms 14076 KB Output is correct
11 Correct 59 ms 14212 KB Output is correct
12 Correct 64 ms 14216 KB Output is correct
13 Correct 61 ms 14208 KB Output is correct
14 Correct 57 ms 14212 KB Output is correct
15 Correct 59 ms 14088 KB Output is correct
16 Correct 62 ms 14204 KB Output is correct
17 Correct 55 ms 13836 KB Output is correct
18 Correct 55 ms 13948 KB Output is correct
19 Correct 65 ms 13832 KB Output is correct
20 Correct 56 ms 13836 KB Output is correct
21 Correct 55 ms 13820 KB Output is correct
22 Correct 56 ms 14084 KB Output is correct
23 Correct 48 ms 11512 KB Output is correct
24 Correct 49 ms 11504 KB Output is correct
25 Correct 50 ms 11900 KB Output is correct
26 Correct 49 ms 11980 KB Output is correct
27 Correct 56 ms 12912 KB Output is correct
28 Correct 54 ms 12688 KB Output is correct
29 Correct 56 ms 12920 KB Output is correct
30 Correct 56 ms 12788 KB Output is correct
31 Correct 57 ms 11380 KB Output is correct
32 Correct 51 ms 11396 KB Output is correct
33 Correct 49 ms 12104 KB Output is correct
34 Correct 48 ms 11772 KB Output is correct
35 Correct 55 ms 12756 KB Output is correct
36 Correct 53 ms 12760 KB Output is correct
37 Correct 57 ms 12716 KB Output is correct
38 Correct 59 ms 12540 KB Output is correct
39 Correct 54 ms 12752 KB Output is correct
40 Correct 61 ms 12636 KB Output is correct
41 Correct 55 ms 13396 KB Output is correct
42 Correct 56 ms 13408 KB Output is correct
43 Correct 55 ms 13316 KB Output is correct
44 Correct 56 ms 13172 KB Output is correct
45 Correct 55 ms 13400 KB Output is correct
46 Correct 56 ms 13428 KB Output is correct
47 Correct 54 ms 12428 KB Output is correct
48 Correct 52 ms 12448 KB Output is correct
49 Correct 51 ms 12324 KB Output is correct
50 Correct 52 ms 12284 KB Output is correct
51 Correct 48 ms 11516 KB Output is correct
52 Correct 48 ms 11644 KB Output is correct
53 Correct 49 ms 11652 KB Output is correct
54 Correct 52 ms 11680 KB Output is correct
55 Correct 48 ms 11676 KB Output is correct
56 Correct 48 ms 11676 KB Output is correct
57 Correct 52 ms 11656 KB Output is correct
58 Correct 49 ms 11556 KB Output is correct
59 Correct 51 ms 11664 KB Output is correct
60 Correct 51 ms 11912 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 11516 KB Output is correct
2 Correct 52 ms 12416 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 43 ms 11128 KB Output is correct
5 Correct 57 ms 14076 KB Output is correct
6 Correct 57 ms 14084 KB Output is correct
7 Correct 51 ms 13436 KB Output is correct
8 Correct 52 ms 13412 KB Output is correct
9 Correct 59 ms 14444 KB Output is correct
10 Correct 63 ms 14088 KB Output is correct
11 Correct 60 ms 14316 KB Output is correct
12 Correct 59 ms 14328 KB Output is correct
13 Correct 61 ms 14356 KB Output is correct
14 Correct 64 ms 14400 KB Output is correct
15 Correct 62 ms 14212 KB Output is correct
16 Correct 60 ms 14216 KB Output is correct
17 Correct 55 ms 14072 KB Output is correct
18 Correct 57 ms 13824 KB Output is correct
19 Correct 56 ms 13684 KB Output is correct
20 Correct 57 ms 13856 KB Output is correct
21 Correct 55 ms 13824 KB Output is correct
22 Correct 60 ms 14056 KB Output is correct
23 Correct 49 ms 11484 KB Output is correct
24 Correct 48 ms 11376 KB Output is correct
25 Correct 55 ms 11816 KB Output is correct
26 Correct 49 ms 11900 KB Output is correct
27 Correct 54 ms 12692 KB Output is correct
28 Correct 57 ms 12816 KB Output is correct
29 Correct 54 ms 13028 KB Output is correct
30 Correct 54 ms 12908 KB Output is correct
31 Correct 49 ms 11628 KB Output is correct
32 Correct 49 ms 11388 KB Output is correct
33 Correct 50 ms 11900 KB Output is correct
34 Correct 50 ms 11900 KB Output is correct
35 Correct 56 ms 12540 KB Output is correct
36 Correct 53 ms 12756 KB Output is correct
37 Correct 55 ms 12540 KB Output is correct
38 Correct 55 ms 12716 KB Output is correct
39 Correct 56 ms 12768 KB Output is correct
40 Correct 54 ms 13004 KB Output is correct
41 Correct 56 ms 13604 KB Output is correct
42 Correct 56 ms 13248 KB Output is correct
43 Correct 55 ms 13404 KB Output is correct
44 Correct 56 ms 13404 KB Output is correct
45 Correct 60 ms 13348 KB Output is correct
46 Correct 55 ms 13400 KB Output is correct
47 Correct 54 ms 12472 KB Output is correct
48 Correct 53 ms 12404 KB Output is correct
49 Correct 53 ms 12276 KB Output is correct
50 Correct 53 ms 12416 KB Output is correct
51 Correct 50 ms 11680 KB Output is correct
52 Correct 49 ms 11664 KB Output is correct
53 Correct 49 ms 11664 KB Output is correct
54 Correct 52 ms 11652 KB Output is correct
55 Correct 49 ms 11688 KB Output is correct
56 Correct 48 ms 11684 KB Output is correct
57 Correct 53 ms 11652 KB Output is correct
58 Correct 50 ms 11524 KB Output is correct
59 Correct 49 ms 11688 KB Output is correct
60 Correct 51 ms 11652 KB Output is correct