oj.uz

답안 #218194

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218194 2020-04-01T12:08:53 Z _7_7_ 길고양이 (JOI20_stray) C++14
100 / 100
 83 ms 19716 KB 
#include "Anthony.h"
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e4 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
 
namespace {
vi g[N], res, G = {0, 1, 0, 0, 1, 1};
unordered_map < int, int > gg[N];
queue < int > q;
int n, d[N];
}


void dfs (int v, int par = 0, int c = 0) {
	int son = sz(g[v]) - 1 + (!v), cc;
	if (son == 1)
		cc = (c + 1) % 6;
	else
		cc = 1 - G[c];

	for (auto to : g[v])
		if (to != par) {
			res[gg[v][to]] = G[cc];
			dfs(to, v, cc);
		}
}

 
 
vi Mark(int _n, int m, int A, int B, vi U, vi V) {
	n = _n;
	res.resize(m);
 
	for (int i = 0; i < m; ++i) {
		g[V[i]].pb(U[i]); 
		g[U[i]].pb(V[i]);
		gg[V[i]][U[i]] = gg[U[i]][V[i]] = i;
	}
	
	memset(d, -1, sizeof(d));
	q.push(0);
	d[0] = 0;
	while (sz(q)) {
		int v = q.front();
		q.pop();
		for (auto to : g[v])
			if (d[to] == -1) {
				d[to] = d[v] + 1;
				q.push(to);
			}
	}

	if (A > 2) 
		for (int i = 0; i < m; ++i)
			res[i] = min(d[V[i]], d[U[i]]) % A;
	else 
		dfs(0);
	/*for (int i = 0; i < m; ++i)
		cerr << res[i] << ' ';*/	
 
	return res;
}
#include "Catherine.h"
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e5 + 11;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
 
namespace {
vi vv, G = {0, 1, 0, 0, 1, 1};
int A, B, timer, lst = -1;
bool ok;
}
 
 
void Init(int _A, int _B) {
	A = _A;
	B = _B;                       	
}
 
int Move(vi y) {
    if (A > 2) { 
		int a = -1, b = -1;
		for (int i = 0; i < sz(y); ++i)
			if (y[i]) {
				if (a == -1)
					a = i;
				else if (b == -1)
					b = i;
				else 
					assert(0);			
			}
		if (b == -1)
			return a;
 	
		if (b == A - 1 && a == 0)
			return b;
		return a;
	}
 
	++timer;
	int deg = y[0] + y[1] + (lst > -1);
	if (ok) {
		if (deg >= 3) 
			return lst = 1 - lst; 
 
		if (y[0])
			return lst = 0;
		if (y[1])
			return lst = 1;
		return -1;
	}
 
	if (deg == 1) {
		ok = 1;
		if (lst != -1)
			return -1;
		if (y[0])
			return lst = 0;
//		assert(y[1]);
		return lst = 1;
	}
	            
	if (deg > 2) {
		ok = 1;
		if (lst > -1)
			++y[lst];
		
		int a = y[0] == 1 ? 0 : 1;
//		assert(y[a] == 1);
		if (lst == a)
			return -1;
		return lst = a;					
	}
 
	//deg == 2
	if (timer == 4) {
		int a = y[0] ? 0 : 1;
//		assert(y[a]);
		vv.pb(a);
		bool found = 0;
		for (int i = 0; i < 6; ++i) {
			bool tmp = 1;
			for (int j = 0; j < 5; ++j)		
				if (vv[4 - j] != G[(i + j) % 6]) {
					tmp = 0;
					break;
				}
 
			if (tmp)
				found = 1;
		}
 
		ok = 1;
		if (found) 
			return lst = a;
		return -1;						
	}
 
	//deg = 2 and timer <= 3
	int a = y[0] ? 0 : 1;
 
	if (timer == 1) {
		vv.pb(y[a] == 2 ? a : 1 - a);
	}
		
	vv.pb(a);		
//	assert(y[a]);
	return lst = a;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 18888 KB Output is correct
2 Correct 10 ms 3840 KB Output is correct
3 Correct 56 ms 18188 KB Output is correct
4 Correct 83 ms 19716 KB Output is correct
5 Correct 80 ms 19628 KB Output is correct
6 Correct 66 ms 18540 KB Output is correct
7 Correct 64 ms 18612 KB Output is correct
8 Correct 70 ms 19228 KB Output is correct
9 Correct 72 ms 19448 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 18888 KB Output is correct
2 Correct 10 ms 3840 KB Output is correct
3 Correct 56 ms 18188 KB Output is correct
4 Correct 83 ms 19716 KB Output is correct
5 Correct 80 ms 19628 KB Output is correct
6 Correct 66 ms 18540 KB Output is correct
7 Correct 64 ms 18612 KB Output is correct
8 Correct 70 ms 19228 KB Output is correct
9 Correct 72 ms 19448 KB Output is correct
10 Correct 67 ms 16524 KB Output is correct
11 Correct 60 ms 16800 KB Output is correct
12 Correct 62 ms 16692 KB Output is correct
13 Correct 61 ms 16668 KB Output is correct
14 Correct 61 ms 16856 KB Output is correct
15 Correct 68 ms 17252 KB Output is correct
16 Correct 68 ms 19316 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 16484 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 53 ms 16052 KB Output is correct
4 Correct 71 ms 17540 KB Output is correct
5 Correct 71 ms 17676 KB Output is correct
6 Correct 62 ms 16460 KB Output is correct
7 Correct 60 ms 16380 KB Output is correct
8 Correct 68 ms 17028 KB Output is correct
9 Correct 80 ms 17108 KB Output is correct
10 Correct 64 ms 16864 KB Output is correct
11 Correct 66 ms 16780 KB Output is correct
12 Correct 64 ms 16776 KB Output is correct
13 Correct 65 ms 16764 KB Output is correct
14 Correct 67 ms 17028 KB Output is correct
15 Correct 67 ms 17044 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 16484 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 53 ms 16052 KB Output is correct
4 Correct 71 ms 17540 KB Output is correct
5 Correct 71 ms 17676 KB Output is correct
6 Correct 62 ms 16460 KB Output is correct
7 Correct 60 ms 16380 KB Output is correct
8 Correct 68 ms 17028 KB Output is correct
9 Correct 80 ms 17108 KB Output is correct
10 Correct 64 ms 16864 KB Output is correct
11 Correct 66 ms 16780 KB Output is correct
12 Correct 64 ms 16776 KB Output is correct
13 Correct 65 ms 16764 KB Output is correct
14 Correct 67 ms 17028 KB Output is correct
15 Correct 67 ms 17044 KB Output is correct
16 Correct 60 ms 14832 KB Output is correct
17 Correct 56 ms 14968 KB Output is correct
18 Correct 57 ms 14748 KB Output is correct
19 Correct 58 ms 14772 KB Output is correct
20 Correct 72 ms 15444 KB Output is correct
21 Correct 61 ms 15200 KB Output is correct
22 Correct 65 ms 17020 KB Output is correct
23 Correct 60 ms 14912 KB Output is correct
24 Correct 59 ms 15048 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 14596 KB Output is correct
2 Correct 65 ms 16412 KB Output is correct
3 Correct 9 ms 3840 KB Output is correct
4 Correct 52 ms 14984 KB Output is correct
5 Correct 71 ms 17956 KB Output is correct
6 Correct 79 ms 17960 KB Output is correct
7 Correct 61 ms 17088 KB Output is correct
8 Correct 61 ms 17196 KB Output is correct
9 Correct 69 ms 17976 KB Output is correct
10 Correct 69 ms 17940 KB Output is correct
11 Correct 71 ms 17968 KB Output is correct
12 Correct 72 ms 17960 KB Output is correct
13 Correct 70 ms 17964 KB Output is correct
14 Correct 72 ms 18096 KB Output is correct
15 Correct 72 ms 17960 KB Output is correct
16 Correct 72 ms 18004 KB Output is correct
17 Correct 70 ms 17704 KB Output is correct
18 Correct 69 ms 17604 KB Output is correct
19 Correct 69 ms 17716 KB Output is correct
20 Correct 68 ms 17612 KB Output is correct
21 Correct 77 ms 17576 KB Output is correct
22 Correct 69 ms 17716 KB Output is correct
23 Correct 60 ms 15120 KB Output is correct
24 Correct 60 ms 15116 KB Output is correct
25 Correct 67 ms 15916 KB Output is correct
26 Correct 61 ms 15444 KB Output is correct
27 Correct 66 ms 16700 KB Output is correct
28 Correct 67 ms 16684 KB Output is correct
29 Correct 67 ms 16668 KB Output is correct
30 Correct 67 ms 16648 KB Output is correct
31 Correct 60 ms 15136 KB Output is correct
32 Correct 59 ms 15140 KB Output is correct
33 Correct 59 ms 15644 KB Output is correct
34 Correct 61 ms 15668 KB Output is correct
35 Correct 68 ms 16380 KB Output is correct
36 Correct 65 ms 16384 KB Output is correct
37 Correct 72 ms 16704 KB Output is correct
38 Correct 66 ms 16392 KB Output is correct
39 Correct 66 ms 16212 KB Output is correct
40 Correct 67 ms 16400 KB Output is correct
41 Correct 73 ms 17276 KB Output is correct
42 Correct 70 ms 16972 KB Output is correct
43 Correct 70 ms 17148 KB Output is correct
44 Correct 68 ms 16972 KB Output is correct
45 Correct 72 ms 17340 KB Output is correct
46 Correct 69 ms 17008 KB Output is correct
47 Correct 64 ms 16104 KB Output is correct
48 Correct 65 ms 16100 KB Output is correct
49 Correct 64 ms 15956 KB Output is correct
50 Correct 64 ms 16232 KB Output is correct
51 Correct 59 ms 15264 KB Output is correct
52 Correct 60 ms 15268 KB Output is correct
53 Correct 59 ms 15192 KB Output is correct
54 Correct 59 ms 15260 KB Output is correct
55 Correct 60 ms 15256 KB Output is correct
56 Correct 60 ms 15252 KB Output is correct
57 Correct 66 ms 15456 KB Output is correct
58 Correct 60 ms 15064 KB Output is correct
59 Correct 60 ms 15052 KB Output is correct
60 Correct 60 ms 15076 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 14740 KB Output is correct
2 Correct 64 ms 15784 KB Output is correct
3 Correct 11 ms 3840 KB Output is correct
4 Correct 54 ms 14760 KB Output is correct
5 Correct 70 ms 17988 KB Output is correct
6 Correct 73 ms 17964 KB Output is correct
7 Correct 61 ms 17152 KB Output is correct
8 Correct 62 ms 17112 KB Output is correct
9 Correct 72 ms 18004 KB Output is correct
10 Correct 71 ms 17972 KB Output is correct
11 Correct 72 ms 18092 KB Output is correct
12 Correct 71 ms 17984 KB Output is correct
13 Correct 70 ms 17996 KB Output is correct
14 Correct 71 ms 17960 KB Output is correct
15 Correct 71 ms 17996 KB Output is correct
16 Correct 76 ms 18144 KB Output is correct
17 Correct 68 ms 17720 KB Output is correct
18 Correct 67 ms 17612 KB Output is correct
19 Correct 69 ms 17712 KB Output is correct
20 Correct 68 ms 17832 KB Output is correct
21 Correct 71 ms 17708 KB Output is correct
22 Correct 68 ms 17708 KB Output is correct
23 Correct 57 ms 15252 KB Output is correct
24 Correct 60 ms 15056 KB Output is correct
25 Correct 62 ms 15456 KB Output is correct
26 Correct 66 ms 15584 KB Output is correct
27 Correct 74 ms 16692 KB Output is correct
28 Correct 69 ms 16488 KB Output is correct
29 Correct 66 ms 16672 KB Output is correct
30 Correct 66 ms 16636 KB Output is correct
31 Correct 61 ms 15108 KB Output is correct
32 Correct 62 ms 15144 KB Output is correct
33 Correct 61 ms 15436 KB Output is correct
34 Correct 62 ms 15444 KB Output is correct
35 Correct 69 ms 16388 KB Output is correct
36 Correct 66 ms 16332 KB Output is correct
37 Correct 66 ms 16408 KB Output is correct
38 Correct 66 ms 16376 KB Output is correct
39 Correct 66 ms 16384 KB Output is correct
40 Correct 65 ms 16404 KB Output is correct
41 Correct 69 ms 17020 KB Output is correct
42 Correct 68 ms 17028 KB Output is correct
43 Correct 67 ms 17012 KB Output is correct
44 Correct 80 ms 17008 KB Output is correct
45 Correct 68 ms 16988 KB Output is correct
46 Correct 78 ms 17128 KB Output is correct
47 Correct 65 ms 16340 KB Output is correct
48 Correct 65 ms 16116 KB Output is correct
49 Correct 63 ms 16068 KB Output is correct
50 Correct 70 ms 16640 KB Output is correct
51 Correct 62 ms 15260 KB Output is correct
52 Correct 60 ms 15260 KB Output is correct
53 Correct 61 ms 15252 KB Output is correct
54 Correct 64 ms 15388 KB Output is correct
55 Correct 60 ms 15196 KB Output is correct
56 Correct 61 ms 15256 KB Output is correct
57 Correct 60 ms 15072 KB Output is correct
58 Correct 64 ms 15304 KB Output is correct
59 Correct 60 ms 15088 KB Output is correct
60 Correct 60 ms 15072 KB Output is correct