oj.uz

답안 #786045

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786045 2023-07-17T23:13:09 Z doowey 길고양이 (JOI20_stray) C++14
91 / 100
 43 ms 16572 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 < trav.size(); 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;
}

Compilation message

Catherine.cpp: In function 'int move_2(std::vector<int>)':
Catherine.cpp:91:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |      for(int j = 0 ; j < trav.size(); j ++ ){
      |                      ~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15568 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 24 ms 14832 KB Output is correct
4 Correct 34 ms 16508 KB Output is correct
5 Correct 34 ms 16572 KB Output is correct
6 Correct 26 ms 15320 KB Output is correct
7 Correct 28 ms 15256 KB Output is correct
8 Correct 31 ms 15984 KB Output is correct
9 Correct 38 ms 15984 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15568 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 24 ms 14832 KB Output is correct
4 Correct 34 ms 16508 KB Output is correct
5 Correct 34 ms 16572 KB Output is correct
6 Correct 26 ms 15320 KB Output is correct
7 Correct 28 ms 15256 KB Output is correct
8 Correct 31 ms 15984 KB Output is correct
9 Correct 38 ms 15984 KB Output is correct
10 Correct 25 ms 13312 KB Output is correct
11 Correct 25 ms 13416 KB Output is correct
12 Correct 25 ms 13392 KB Output is correct
13 Correct 25 ms 13420 KB Output is correct
14 Correct 28 ms 13652 KB Output is correct
15 Correct 28 ms 14088 KB Output is correct
16 Correct 31 ms 16084 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 13152 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12684 KB Output is correct
4 Correct 41 ms 14372 KB Output is correct
5 Correct 33 ms 14440 KB Output is correct
6 Correct 26 ms 13096 KB Output is correct
7 Correct 26 ms 13092 KB Output is correct
8 Correct 30 ms 13740 KB Output is correct
9 Correct 31 ms 13672 KB Output is correct
10 Correct 28 ms 13400 KB Output is correct
11 Correct 28 ms 13492 KB Output is correct
12 Correct 27 ms 13424 KB Output is correct
13 Correct 28 ms 13392 KB Output is correct
14 Correct 30 ms 13848 KB Output is correct
15 Correct 31 ms 13784 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 13152 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 22 ms 12684 KB Output is correct
4 Correct 41 ms 14372 KB Output is correct
5 Correct 33 ms 14440 KB Output is correct
6 Correct 26 ms 13096 KB Output is correct
7 Correct 26 ms 13092 KB Output is correct
8 Correct 30 ms 13740 KB Output is correct
9 Correct 31 ms 13672 KB Output is correct
10 Correct 28 ms 13400 KB Output is correct
11 Correct 28 ms 13492 KB Output is correct
12 Correct 27 ms 13424 KB Output is correct
13 Correct 28 ms 13392 KB Output is correct
14 Correct 30 ms 13848 KB Output is correct
15 Correct 31 ms 13784 KB Output is correct
16 Correct 23 ms 11652 KB Output is correct
17 Correct 22 ms 11632 KB Output is correct
18 Correct 26 ms 11428 KB Output is correct
19 Correct 25 ms 11484 KB Output is correct
20 Correct 27 ms 12128 KB Output is correct
21 Correct 26 ms 11856 KB Output is correct
22 Correct 28 ms 13872 KB Output is correct
23 Correct 26 ms 11616 KB Output is correct
24 Correct 26 ms 11736 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1284 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 1292 KB Output is correct
4 Correct 2 ms 1420 KB Output is correct
5 Correct 2 ms 1412 KB Output is correct
6 Correct 2 ms 1412 KB Output is correct
7 Correct 2 ms 1412 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 1412 KB Output is correct
11 Correct 2 ms 1420 KB Output is correct
12 Correct 2 ms 1420 KB Output is correct
13 Correct 2 ms 1412 KB Output is correct
14 Correct 2 ms 1412 KB Output is correct
15 Correct 2 ms 1420 KB Output is correct
16 Correct 2 ms 1364 KB Output is correct
17 Correct 2 ms 1292 KB Output is correct
18 Correct 2 ms 1292 KB Output is correct
19 Correct 2 ms 1288 KB Output is correct
20 Correct 2 ms 1288 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 1284 KB Output is correct
25 Correct 2 ms 1284 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 27 ms 11252 KB Output is correct
2 Correct 27 ms 13324 KB Output is correct
3 Correct 0 ms 1024 KB Output is correct
4 Correct 20 ms 11148 KB Output is correct
5 Correct 35 ms 15380 KB Output is correct
6 Correct 32 ms 15372 KB Output is correct
7 Correct 27 ms 14564 KB Output is correct
8 Correct 27 ms 14568 KB Output is correct
9 Correct 32 ms 15400 KB Output is correct
10 Correct 32 ms 15384 KB Output is correct
11 Correct 34 ms 15396 KB Output is correct
12 Correct 33 ms 15420 KB Output is correct
13 Correct 33 ms 15368 KB Output is correct
14 Correct 32 ms 15436 KB Output is correct
15 Correct 33 ms 15444 KB Output is correct
16 Correct 31 ms 15384 KB Output is correct
17 Correct 35 ms 15192 KB Output is correct
18 Correct 31 ms 15152 KB Output is correct
19 Correct 30 ms 15092 KB Output is correct
20 Correct 30 ms 15100 KB Output is correct
21 Correct 30 ms 15140 KB Output is correct
22 Correct 30 ms 15224 KB Output is correct
23 Correct 24 ms 11252 KB Output is correct
24 Correct 24 ms 11188 KB Output is correct
25 Correct 26 ms 11900 KB Output is correct
26 Correct 32 ms 11984 KB Output is correct
27 Correct 27 ms 13408 KB Output is correct
28 Correct 27 ms 13432 KB Output is correct
29 Correct 28 ms 13436 KB Output is correct
30 Correct 28 ms 13280 KB Output is correct
31 Correct 25 ms 11344 KB Output is correct
32 Correct 24 ms 11236 KB Output is correct
33 Correct 28 ms 11940 KB Output is correct
34 Correct 26 ms 11884 KB Output is correct
35 Correct 27 ms 13112 KB Output is correct
36 Correct 27 ms 13032 KB Output is correct
37 Correct 30 ms 13076 KB Output is correct
38 Correct 27 ms 12988 KB Output is correct
39 Correct 28 ms 13140 KB Output is correct
40 Correct 27 ms 13036 KB Output is correct
41 Correct 28 ms 14132 KB Output is correct
42 Correct 30 ms 14184 KB Output is correct
43 Correct 30 ms 14100 KB Output is correct
44 Correct 37 ms 14164 KB Output is correct
45 Correct 32 ms 14100 KB Output is correct
46 Correct 28 ms 14184 KB Output is correct
47 Correct 27 ms 12836 KB Output is correct
48 Correct 27 ms 12856 KB Output is correct
49 Correct 27 ms 12800 KB Output is correct
50 Correct 27 ms 12960 KB Output is correct
51 Correct 30 ms 11360 KB Output is correct
52 Correct 26 ms 11324 KB Output is correct
53 Correct 24 ms 11344 KB Output is correct
54 Correct 24 ms 11360 KB Output is correct
55 Correct 24 ms 11444 KB Output is correct
56 Correct 24 ms 11392 KB Output is correct
57 Correct 24 ms 11424 KB Output is correct
58 Correct 28 ms 11364 KB Output is correct
59 Correct 25 ms 11488 KB Output is correct
60 Correct 32 ms 11424 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11240 KB Output is correct
2 Correct 26 ms 13108 KB Output is correct
3 Correct 0 ms 1024 KB Output is correct
4 Correct 20 ms 11188 KB Output is correct
5 Correct 32 ms 15480 KB Output is correct
6 Correct 43 ms 15452 KB Output is correct
7 Correct 32 ms 14692 KB Output is correct
8 Incorrect 25 ms 14564 KB Wrong Answer [6]
9 Halted 0 ms 0 KB -