oj.uz

답안 #786042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786042 2023-07-17T23:08:29 Z doowey 길고양이 (JOI20_stray) C++14
91 / 100
 42 ms 16568 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

namespace {

const int N = (int)20010;
vector<pii> T[N];
vector<int> pattern = {1,1,0,1,0,0};
int dd[N];

}  // namespace


int n, m;
vector<int> idx;
int dep[N];

void make1(){
	queue<int> que;
	for(int i = 0 ; i < n; i ++ ){
		dep[i]=-1;
	}
	for(int i = 0 ; i < m ; i ++ ){
		idx[i]=-1;
	}
	dep[0]=0;
	que.push(0);
	int nd;
	while(!que.empty()){
		nd=que.front();
		que.pop();
		for(auto x : T[nd]){
			if(dep[x.fi] == -1){
				dep[x.fi]=(dep[nd]+1)%3;
				que.push(x.fi);
			}
			if(idx[x.se] == -1) idx[x.se]=dep[nd];
			
		}
	}
}



void dfs0(int u, int par, int bit){
	vector<pii> nex;
	for(auto x : T[u]){
		if(x.fi == par) continue;
		nex.push_back(x);
	}
	if(nex.size() == 1){
		if(dd[u]==-1){
			dd[u]=0;
			while(pattern[dd[u]] != bit) dd[u] ++ ;
		}
		dd[nex[0].fi] = (dd[u] + 1) % 6;
		idx[nex[0].se] = pattern[dd[nex[0].fi]];
		dfs0(nex[0].fi, u, pattern[(dd[u] + 1) % 6]);
	}
	else{
		for(auto x : nex){
			idx[x.se] = bit ^ 1;
			dfs0(x.fi, u, bit ^ 1);
		}
	}
}

void make2(){
	for(int i = 0 ; i < n; i ++ ){
		dd[i]=-1;
	}
	dfs0(0, -1, 0);
}

vector<int> Mark(int _n, int _m, int a, int b, vector<int> u, vector<int> v) {
	n = _n;
	m = _m;
	for(int i = 0 ; i < m ; i ++ ){
		T[u[i]].push_back(mp(v[i],i));
		T[v[i]].push_back(mp(u[i],i));
	}
	idx.resize(m);
	if(a >= 3) make1();
	else make2();
	return idx;
}

#include "Catherine.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

namespace {

int A;
vector<int> trav;
int las;
bool know;

vector<int> pattern = {1, 1, 0, 1, 0, 0};

}  // namespace


void Init(int a, int b) {
	A = a;
	trav.clear();
	las = -1;
	know = false;
}

int move_3(vector<int> y){
	for(int d = 0; d < 3; d ++ ){
		if(y[d] > 0 && y[(d + 1) % 3] > 0) return d;
	}
	for(int d = 0; d < 3; d ++ ){
		if(y[d] > 0) return d;
	}
	return -1;
}

int move_2(vector<int> y){
	vector<int> g = y;
	if(las != -1) g[las] ++ ;
	
	int pick = -1;
	if(g[0] + g[1] != 2){
		
		know = true;
		
		trav.clear();
		if(g[0] == 1) pick = 0;
		else pick = 1;
		las = pick;
	}
	else{
		if(know){
			if(!trav.empty()){
				pick = -1;
				las=trav.back();
				trav.pop_back();
			}
			else{
				if(y[0] == 1) pick = 0;
				else pick = 1;
				las=pick;
			}
		}
		else{
			if(trav.empty()){
				for(int d = 0; d < 2; d ++ ){
					for(int p = 0 ; p < y[d]; p ++ ){
						trav.push_back(d);
						pick=d;
						las=d;
					}
				}
			}
			else if(trav.size() <= 3){
				if(y[0]==1) pick=0;
				else pick=1;
				las = pick;
				trav.push_back(pick);
			}
			else{
				if(y[0] == 1) trav.push_back(0);
				else trav.push_back(1);
				bool rev = false;
				for(int i = 0 ; i < 6 ; i ++ ){
					vector<int> g;
					for(int j = 0 ; j < 5; j ++ ){
						g.push_back(pattern[(i + j) % 6]);
					}
					if(g == trav) rev = true;
				}
				if(rev == true){
					pick = -1;
					trav.pop_back();
					trav.erase(trav.begin());
					las = trav.back();
					trav.pop_back();
				}
				else{
					trav.clear();
					if(y[0] == 1) pick = 0;
					else pick = 1;
					las = pick;
				}
				
				know=true;
			}
		}
	}
	if(pick == -1 || y[pick] == 0) pick = -1;
	return pick;
}

int Move(std::vector<int> y) {
   if(A >= 3) return move_3(y);
   else{
	   return move_2(y);
   }
   return -1;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15508 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 23 ms 14956 KB Output is correct
4 Correct 34 ms 16476 KB Output is correct
5 Correct 34 ms 16568 KB Output is correct
6 Correct 27 ms 15296 KB Output is correct
7 Correct 26 ms 15184 KB Output is correct
8 Correct 40 ms 16044 KB Output is correct
9 Correct 34 ms 15904 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15508 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 23 ms 14956 KB Output is correct
4 Correct 34 ms 16476 KB Output is correct
5 Correct 34 ms 16568 KB Output is correct
6 Correct 27 ms 15296 KB Output is correct
7 Correct 26 ms 15184 KB Output is correct
8 Correct 40 ms 16044 KB Output is correct
9 Correct 34 ms 15904 KB Output is correct
10 Correct 25 ms 13412 KB Output is correct
11 Correct 31 ms 13380 KB Output is correct
12 Correct 29 ms 13392 KB Output is correct
13 Correct 25 ms 13380 KB Output is correct
14 Correct 26 ms 13692 KB Output is correct
15 Correct 27 ms 14052 KB Output is correct
16 Correct 31 ms 16080 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 13048 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12720 KB Output is correct
4 Correct 33 ms 14440 KB Output is correct
5 Correct 32 ms 14432 KB Output is correct
6 Correct 26 ms 13152 KB Output is correct
7 Correct 26 ms 13092 KB Output is correct
8 Correct 36 ms 13660 KB Output is correct
9 Correct 31 ms 13588 KB Output is correct
10 Correct 27 ms 13420 KB Output is correct
11 Correct 33 ms 13464 KB Output is correct
12 Correct 27 ms 13584 KB Output is correct
13 Correct 27 ms 13492 KB Output is correct
14 Correct 30 ms 13816 KB Output is correct
15 Correct 30 ms 13788 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 13048 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12720 KB Output is correct
4 Correct 33 ms 14440 KB Output is correct
5 Correct 32 ms 14432 KB Output is correct
6 Correct 26 ms 13152 KB Output is correct
7 Correct 26 ms 13092 KB Output is correct
8 Correct 36 ms 13660 KB Output is correct
9 Correct 31 ms 13588 KB Output is correct
10 Correct 27 ms 13420 KB Output is correct
11 Correct 33 ms 13464 KB Output is correct
12 Correct 27 ms 13584 KB Output is correct
13 Correct 27 ms 13492 KB Output is correct
14 Correct 30 ms 13816 KB Output is correct
15 Correct 30 ms 13788 KB Output is correct
16 Correct 24 ms 11560 KB Output is correct
17 Correct 23 ms 11608 KB Output is correct
18 Correct 24 ms 11472 KB Output is correct
19 Correct 25 ms 11484 KB Output is correct
20 Correct 30 ms 12120 KB Output is correct
21 Correct 27 ms 12024 KB Output is correct
22 Correct 28 ms 13884 KB Output is correct
23 Correct 24 ms 11736 KB Output is correct
24 Correct 24 ms 11756 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1364 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 2 ms 1292 KB Output is correct
4 Correct 2 ms 1412 KB Output is correct
5 Correct 2 ms 1420 KB Output is correct
6 Correct 2 ms 1416 KB Output is correct
7 Correct 2 ms 1424 KB Output is correct
8 Correct 2 ms 1416 KB Output is correct
9 Correct 2 ms 1420 KB Output is correct
10 Correct 2 ms 1420 KB Output is correct
11 Correct 2 ms 1416 KB Output is correct
12 Correct 2 ms 1424 KB Output is correct
13 Correct 2 ms 1420 KB Output is correct
14 Correct 2 ms 1436 KB Output is correct
15 Correct 2 ms 1412 KB Output is correct
16 Correct 2 ms 1292 KB Output is correct
17 Correct 2 ms 1284 KB Output is correct
18 Correct 2 ms 1296 KB Output is correct
19 Correct 2 ms 1296 KB Output is correct
20 Correct 2 ms 1284 KB Output is correct
21 Correct 2 ms 1292 KB Output is correct
22 Correct 2 ms 1284 KB Output is correct
23 Correct 2 ms 1292 KB Output is correct
24 Correct 2 ms 1348 KB Output is correct
25 Correct 2 ms 1292 KB Output is correct
26 Correct 2 ms 1292 KB Output is correct
27 Correct 2 ms 1292 KB Output is correct
28 Correct 2 ms 1284 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11180 KB Output is correct
2 Correct 35 ms 13020 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 20 ms 11112 KB Output is correct
5 Correct 36 ms 15384 KB Output is correct
6 Correct 32 ms 15408 KB Output is correct
7 Correct 33 ms 14732 KB Output is correct
8 Correct 27 ms 14536 KB Output is correct
9 Correct 42 ms 15500 KB Output is correct
10 Correct 32 ms 15484 KB Output is correct
11 Correct 31 ms 15432 KB Output is correct
12 Correct 32 ms 15472 KB Output is correct
13 Correct 32 ms 15496 KB Output is correct
14 Correct 33 ms 15380 KB Output is correct
15 Correct 32 ms 15444 KB Output is correct
16 Correct 39 ms 15476 KB Output is correct
17 Correct 32 ms 15092 KB Output is correct
18 Correct 30 ms 15212 KB Output is correct
19 Correct 30 ms 15112 KB Output is correct
20 Correct 30 ms 15176 KB Output is correct
21 Correct 30 ms 15152 KB Output is correct
22 Correct 30 ms 15172 KB Output is correct
23 Correct 25 ms 11196 KB Output is correct
24 Correct 27 ms 11416 KB Output is correct
25 Correct 27 ms 12004 KB Output is correct
26 Correct 30 ms 12008 KB Output is correct
27 Correct 32 ms 13420 KB Output is correct
28 Correct 35 ms 13320 KB Output is correct
29 Correct 27 ms 13252 KB Output is correct
30 Correct 27 ms 13284 KB Output is correct
31 Correct 28 ms 11228 KB Output is correct
32 Correct 24 ms 11232 KB Output is correct
33 Correct 30 ms 12024 KB Output is correct
34 Correct 25 ms 11872 KB Output is correct
35 Correct 27 ms 13072 KB Output is correct
36 Correct 27 ms 13032 KB Output is correct
37 Correct 27 ms 13064 KB Output is correct
38 Correct 28 ms 13052 KB Output is correct
39 Correct 31 ms 13012 KB Output is correct
40 Correct 31 ms 13028 KB Output is correct
41 Correct 30 ms 14168 KB Output is correct
42 Correct 30 ms 14096 KB Output is correct
43 Correct 28 ms 14160 KB Output is correct
44 Correct 31 ms 14116 KB Output is correct
45 Correct 31 ms 14168 KB Output is correct
46 Correct 28 ms 14184 KB Output is correct
47 Correct 37 ms 12772 KB Output is correct
48 Correct 27 ms 12988 KB Output is correct
49 Correct 27 ms 12836 KB Output is correct
50 Correct 34 ms 12912 KB Output is correct
51 Correct 27 ms 11352 KB Output is correct
52 Correct 27 ms 11392 KB Output is correct
53 Correct 39 ms 11400 KB Output is correct
54 Correct 24 ms 11368 KB Output is correct
55 Correct 35 ms 11316 KB Output is correct
56 Correct 27 ms 11408 KB Output is correct
57 Correct 26 ms 11344 KB Output is correct
58 Correct 25 ms 11376 KB Output is correct
59 Correct 25 ms 11516 KB Output is correct
60 Correct 28 ms 11460 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11328 KB Output is correct
2 Correct 27 ms 13028 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 27 ms 11216 KB Output is correct
5 Correct 37 ms 15364 KB Output is correct
6 Correct 42 ms 15412 KB Output is correct
7 Correct 28 ms 14436 KB Output is correct
8 Incorrect 27 ms 14532 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -