oj.uz

답안 #444863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444863 2021-07-15T16:12:33 Z kig9981 길고양이 (JOI20_stray) C++17
15 / 100
 56 ms 19756 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;
 
vector<pair<int,int>> adj[20000];
int dist[20000];
 
std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
	vector<int> X(M,-1);
	queue<pair<int,int>> Q;
	memset(dist,-1,sizeof(dist));
	for(int i=0;i<M;i++) {
		adj[U[i]].emplace_back(V[i],i);
		adj[V[i]].emplace_back(U[i],i);
	}
	dist[0]=0;
	for(auto[n,t]: adj[0]) {
		dist[n]=1; X[t]=0;
		Q.emplace(n,t);
	}
	while(!Q.empty()) {
		auto[c,p]=Q.front();
		Q.pop();
		for(auto[n,t]: adj[c]) {
			if(dist[n]==-1) {
				dist[n]=dist[c]+1;
				if(A==2) {
					if(X[p]>1) {
						if(adj[c].size()==2) X[t]=(X[p]-1)%6+2;
						else X[t]=!(X[p]==3 || X[p]==6 || X[p]==7);
					}
					else {
						if(adj[c].size()==2) X[t]=X[p]+3;
						else X[t]=X[p]^1;
					}
				}
				else X[t]=min(dist[c],dist[n])%3;
				Q.emplace(n,t);
			}
			else if(X[t]==-1) X[t]=min(dist[c],dist[n])%3;
		}
	}
	if(A==2) for(auto &p: X) p=p==1 || p==3 || p==6 || p==7;
	return X;
}
#include "Catherine.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;
 
int A, r;
bool d;
string s;
 
void Init(int A, int B) {
	::A=A;
	r=-1; d=false; s="";
}
 
int Move(std::vector<int> y) {
	if(r!=-1) y[r]++;
	if(A==2) {
		if(d) {
			for(int i=0;i<2;i++) if(y[i]==1 && y[i]-(i==r)==1) return r=i;
		}
		else {
			if(y[0]+y[1]>2) {
				d=true;
				if(r!=-1 && --y[r]==0) return -1;
				else {
					for(int i=0;i<2;i++) if(y[i]==1 && y[i]+(i==r)==1) return r=i;
				}
			}
			if(y[0]+y[1]==1) {
				d=true;
				for(int i=0;i<2;i++) if(y[i]) {
					if(i==r) return -1;
					return r=i;
				}
			}
			if(s.size()==6) {
				d=true;
				for(int i=0;i<6;i++) {
					bool valid=true;
					for(int j=0;j<4;j++) valid&=s[(i+j)%6]=='0'+j/2;
					if(valid) {
						for(int i=0;i<2;i++) if(y[i]==1 && y[i]-(i==r)==1) return r=i;
					}
				}
				return -1;
			}
			y[r]--;
			for(int i=0;i<2;i++) if(y[i]) {
				s.push_back('0'+i);
				return r=i;
			}
		}
	}
	else {
		for(int i=0;i<3;i++) if(y[i]==0 && y[(i+1)%3]==0) return r=(i+2)%3;
		for(int i=0;i<3;i++) if(y[i]==0) return r=(i+1)%3;
	}
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 15440 KB Output is correct
2 Correct 1 ms 1000 KB Output is correct
3 Correct 35 ms 14844 KB Output is correct
4 Correct 54 ms 16408 KB Output is correct
5 Correct 56 ms 16352 KB Output is correct
6 Correct 44 ms 15124 KB Output is correct
7 Correct 43 ms 15176 KB Output is correct
8 Correct 53 ms 15828 KB Output is correct
9 Correct 49 ms 15912 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 15440 KB Output is correct
2 Correct 1 ms 1000 KB Output is correct
3 Correct 35 ms 14844 KB Output is correct
4 Correct 54 ms 16408 KB Output is correct
5 Correct 56 ms 16352 KB Output is correct
6 Correct 44 ms 15124 KB Output is correct
7 Correct 43 ms 15176 KB Output is correct
8 Correct 53 ms 15828 KB Output is correct
9 Correct 49 ms 15912 KB Output is correct
10 Correct 41 ms 13184 KB Output is correct
11 Correct 41 ms 13392 KB Output is correct
12 Correct 40 ms 13340 KB Output is correct
13 Correct 39 ms 13328 KB Output is correct
14 Correct 42 ms 13552 KB Output is correct
15 Correct 46 ms 13932 KB Output is correct
16 Correct 52 ms 15872 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 13012 KB Output is correct
2 Correct 1 ms 1124 KB Output is correct
3 Correct 33 ms 12640 KB Output is correct
4 Correct 53 ms 14140 KB Output is correct
5 Correct 52 ms 14232 KB Output is correct
6 Correct 41 ms 12900 KB Output is correct
7 Correct 43 ms 12924 KB Output is correct
8 Correct 49 ms 13640 KB Output is correct
9 Correct 47 ms 13656 KB Output is correct
10 Correct 46 ms 13336 KB Output is correct
11 Correct 44 ms 13320 KB Output is correct
12 Correct 45 ms 13336 KB Output is correct
13 Correct 44 ms 13444 KB Output is correct
14 Correct 55 ms 13652 KB Output is correct
15 Correct 49 ms 13616 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 13012 KB Output is correct
2 Correct 1 ms 1124 KB Output is correct
3 Correct 33 ms 12640 KB Output is correct
4 Correct 53 ms 14140 KB Output is correct
5 Correct 52 ms 14232 KB Output is correct
6 Correct 41 ms 12900 KB Output is correct
7 Correct 43 ms 12924 KB Output is correct
8 Correct 49 ms 13640 KB Output is correct
9 Correct 47 ms 13656 KB Output is correct
10 Correct 46 ms 13336 KB Output is correct
11 Correct 44 ms 13320 KB Output is correct
12 Correct 45 ms 13336 KB Output is correct
13 Correct 44 ms 13444 KB Output is correct
14 Correct 55 ms 13652 KB Output is correct
15 Correct 49 ms 13616 KB Output is correct
16 Correct 34 ms 11588 KB Output is correct
17 Correct 36 ms 11432 KB Output is correct
18 Correct 38 ms 11464 KB Output is correct
19 Correct 38 ms 11472 KB Output is correct
20 Correct 45 ms 12104 KB Output is correct
21 Correct 41 ms 11948 KB Output is correct
22 Correct 49 ms 13688 KB Output is correct
23 Correct 38 ms 11576 KB Output is correct
24 Correct 38 ms 11600 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1772 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 11220 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 44 ms 19756 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -