oj.uz

답안 #218166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218166 2020-04-01T11:08:53 Z _7_7_ 길고양이 (JOI20_stray) C++14
15 / 100
 88 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[c];
			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);
	
 
	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;
		return lst = 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[j] != G[(j + i) % 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 18916 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 57 ms 18040 KB Output is correct
4 Correct 73 ms 19716 KB Output is correct
5 Correct 75 ms 19716 KB Output is correct
6 Correct 63 ms 18640 KB Output is correct
7 Correct 68 ms 18668 KB Output is correct
8 Correct 73 ms 19228 KB Output is correct
9 Correct 72 ms 19220 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 18916 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 57 ms 18040 KB Output is correct
4 Correct 73 ms 19716 KB Output is correct
5 Correct 75 ms 19716 KB Output is correct
6 Correct 63 ms 18640 KB Output is correct
7 Correct 68 ms 18668 KB Output is correct
8 Correct 73 ms 19228 KB Output is correct
9 Correct 72 ms 19220 KB Output is correct
10 Correct 64 ms 16656 KB Output is correct
11 Correct 59 ms 16692 KB Output is correct
12 Correct 60 ms 16624 KB Output is correct
13 Correct 60 ms 16496 KB Output is correct
14 Correct 63 ms 17144 KB Output is correct
15 Correct 69 ms 17360 KB Output is correct
16 Correct 71 ms 19200 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 16500 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 54 ms 16032 KB Output is correct
4 Correct 75 ms 17544 KB Output is correct
5 Correct 76 ms 17644 KB Output is correct
6 Correct 65 ms 16380 KB Output is correct
7 Correct 64 ms 16432 KB Output is correct
8 Correct 74 ms 17028 KB Output is correct
9 Correct 72 ms 17264 KB Output is correct
10 Correct 79 ms 16768 KB Output is correct
11 Correct 70 ms 17000 KB Output is correct
12 Correct 74 ms 16772 KB Output is correct
13 Correct 70 ms 16856 KB Output is correct
14 Correct 77 ms 17012 KB Output is correct
15 Correct 82 ms 17128 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 16500 KB Output is correct
2 Correct 9 ms 3840 KB Output is correct
3 Correct 54 ms 16032 KB Output is correct
4 Correct 75 ms 17544 KB Output is correct
5 Correct 76 ms 17644 KB Output is correct
6 Correct 65 ms 16380 KB Output is correct
7 Correct 64 ms 16432 KB Output is correct
8 Correct 74 ms 17028 KB Output is correct
9 Correct 72 ms 17264 KB Output is correct
10 Correct 79 ms 16768 KB Output is correct
11 Correct 70 ms 17000 KB Output is correct
12 Correct 74 ms 16772 KB Output is correct
13 Correct 70 ms 16856 KB Output is correct
14 Correct 77 ms 17012 KB Output is correct
15 Correct 82 ms 17128 KB Output is correct
16 Correct 63 ms 14852 KB Output is correct
17 Correct 71 ms 14776 KB Output is correct
18 Correct 61 ms 14712 KB Output is correct
19 Correct 63 ms 14792 KB Output is correct
20 Correct 75 ms 15464 KB Output is correct
21 Correct 62 ms 15088 KB Output is correct
22 Correct 77 ms 17064 KB Output is correct
23 Correct 71 ms 14832 KB Output is correct
24 Correct 70 ms 14704 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 4096 KB Output is correct
2 Correct 10 ms 4096 KB Output is correct
3 Correct 11 ms 4096 KB Output is correct
4 Correct 11 ms 4096 KB Output is correct
5 Correct 12 ms 4096 KB Output is correct
6 Correct 11 ms 4096 KB Output is correct
7 Incorrect 12 ms 4096 KB Wrong Answer [5]
8 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 14716 KB Output is correct
2 Correct 70 ms 16180 KB Output is correct
3 Correct 10 ms 3840 KB Output is correct
4 Correct 63 ms 14400 KB Output is correct
5 Correct 84 ms 17772 KB Output is correct
6 Correct 80 ms 17868 KB Output is correct
7 Incorrect 69 ms 17020 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 14588 KB Output is correct
2 Correct 69 ms 15836 KB Output is correct
3 Correct 9 ms 3840 KB Output is correct
4 Correct 88 ms 14320 KB Output is correct
5 Correct 79 ms 17772 KB Output is correct
6 Correct 77 ms 17968 KB Output is correct
7 Incorrect 61 ms 16884 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -