oj.uz

답안 #710312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710312 2023-03-15T07:05:06 Z emptypringlescan 길고양이 (JOI20_stray) C++17
91 / 100
 63 ms 17216 KB 
#include <bits/stdc++.h>
using namespace std;


vector<pair<int,int> > adj[20005],tadj[20005];
int ans[20005];
bool start=false;
int turn=0;
string s="101001";
void dfs(int x, int p, int c){
	int child=0;
	for(auto i:tadj[x]){
		if(i.first==p) continue;
		child++;
	}
	if(child>1){
		start=false;
		turn=0;
		for(auto i:tadj[x]){
			if(i.first==p) continue;
			ans[i.second]=1-c;
			dfs(i.first,x,1-c);
		}
	}
	else if(child==1){
		if(!start){
			start=true;
			turn=0;
		}
		for(auto i:tadj[x]){
			if(i.first==p) continue;
			ans[i.second]=s[turn]-'0';
			turn++;
			turn%=6;
			dfs(i.first,x,ans[i.second]);
		}
	}
}
vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V){
	vector<int> ret(M);
	for(int i=0; i<M; i++) ret[i]=-1;
	for(int i=0; i<M; i++){
		adj[U[i]].push_back({V[i],i});
		adj[V[i]].push_back({U[i],i});
	}
	if(A>2){
		queue<pair<int,pair<int,int> > > q;
		q.push({0,{0,-1}});
		int v[N];
		memset(v,0,sizeof(v));
		while(!q.empty()){
			int a=q.front().first,b=q.front().second.first,c=q.front().second.second;
			q.pop();
			if(v[b]) continue;
			v[b]=1;
			for(auto i:adj[b]){
				if(ret[i.second]==-1) ret[i.second]=a%3;
				if(!v[i.first]) q.push({a+1,{i.first,0}});
			}
		}
		return ret;
	}
	else{
		for(int i=0; i<M; i++){
			tadj[U[i]].push_back({V[i],i});
			tadj[V[i]].push_back({U[i],i});
		}
	}
	dfs(0,-1,1);
	for(int i=0; i<M; i++) ret[i]=ans[i];
	return ret;
}
#include <bits/stdc++.h>
using namespace std;

bool start=true,confuse=false;
int mode=0;
void Init(int A, int B){
	start=true;
	confuse=false;
	if(A>2) mode=1;
}
int pre=-1;
string cur="";
int Move(vector<int> y){
	if(mode){
		if(y[0]&&y[1]) return 0;
		else if(y[1]&&y[2]) return 1;
		else if(y[0]&&y[2]) return 2;
		else if(y[0]) return 0;
		else if(y[1]) return 1;
		else if(y[2]) return 2;
		else{
			assert(false);
			return -1;
			
		}
	}
	if(!start&&!confuse){
		if(y[0]+y[1]==1){
			if(y[0]) return pre=0;
			else return pre=1;
		}
		else if(y[0]+y[1]==0) return -1;
		//assert(y[1-pre]==1);
		return pre=1-pre;
	}
	if(start){
		start=false;
		if(y[0]+y[1]==2){
			confuse=true;
			if(y[0]){
				cur+="0";
				return pre=0;
			}
			else{
				cur+="1";
				return pre=1;
			}
		}
		else{
			if(y[0]==1) return pre=0;
			else if(y[1]==1) return pre=1;
			else{
				assert(false);
				return -1;
			}
		}
	}
	if(confuse){
		if(y[0]+y[1]>1){
			if(y[0]==0||y[1]==0){
				confuse=false;
				return -1;
			}
			return pre=1-pre;
		}
		else if(y[0]+y[1]==0){
			confuse=false;
			return -1;
		}
		else{
			if(cur.length()==6){
				if(cur=="101001"||cur=="010011"||cur=="100110"||cur=="001101"||cur=="011010"||cur=="110100"){
					cur="";
					confuse=false;
					return -1;
				}
				else{
					cur="";
					confuse=false;
					if(y[0]) return pre=0;
					else return pre=1;
				}
			}
			if(y[0]){
				cur+="0";
				return pre=0;
			}
			else{
				cur+="1";
				return pre=1;
			}
		}
	}
	return 0;
}

Compilation message

Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:52:51: warning: unused variable 'c' [-Wunused-variable]
   52 |    int a=q.front().first,b=q.front().second.first,c=q.front().second.second;
      |                                                   ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15988 KB Output is correct
2 Correct 2 ms 1552 KB Output is correct
3 Correct 32 ms 15608 KB Output is correct
4 Correct 44 ms 17204 KB Output is correct
5 Correct 51 ms 17216 KB Output is correct
6 Correct 39 ms 15900 KB Output is correct
7 Correct 36 ms 15876 KB Output is correct
8 Correct 40 ms 16540 KB Output is correct
9 Correct 43 ms 16732 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 15988 KB Output is correct
2 Correct 2 ms 1552 KB Output is correct
3 Correct 32 ms 15608 KB Output is correct
4 Correct 44 ms 17204 KB Output is correct
5 Correct 51 ms 17216 KB Output is correct
6 Correct 39 ms 15900 KB Output is correct
7 Correct 36 ms 15876 KB Output is correct
8 Correct 40 ms 16540 KB Output is correct
9 Correct 43 ms 16732 KB Output is correct
10 Correct 32 ms 14044 KB Output is correct
11 Correct 32 ms 14156 KB Output is correct
12 Correct 34 ms 13980 KB Output is correct
13 Correct 35 ms 14044 KB Output is correct
14 Correct 33 ms 14272 KB Output is correct
15 Correct 37 ms 14748 KB Output is correct
16 Correct 39 ms 16776 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13472 KB Output is correct
2 Correct 1 ms 1532 KB Output is correct
3 Correct 28 ms 13072 KB Output is correct
4 Correct 41 ms 14856 KB Output is correct
5 Correct 51 ms 14740 KB Output is correct
6 Correct 35 ms 13720 KB Output is correct
7 Correct 33 ms 13800 KB Output is correct
8 Correct 39 ms 14296 KB Output is correct
9 Correct 39 ms 14300 KB Output is correct
10 Correct 39 ms 14032 KB Output is correct
11 Correct 43 ms 13976 KB Output is correct
12 Correct 40 ms 14036 KB Output is correct
13 Correct 40 ms 14076 KB Output is correct
14 Correct 40 ms 14352 KB Output is correct
15 Correct 41 ms 14356 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13472 KB Output is correct
2 Correct 1 ms 1532 KB Output is correct
3 Correct 28 ms 13072 KB Output is correct
4 Correct 41 ms 14856 KB Output is correct
5 Correct 51 ms 14740 KB Output is correct
6 Correct 35 ms 13720 KB Output is correct
7 Correct 33 ms 13800 KB Output is correct
8 Correct 39 ms 14296 KB Output is correct
9 Correct 39 ms 14300 KB Output is correct
10 Correct 39 ms 14032 KB Output is correct
11 Correct 43 ms 13976 KB Output is correct
12 Correct 40 ms 14036 KB Output is correct
13 Correct 40 ms 14076 KB Output is correct
14 Correct 40 ms 14352 KB Output is correct
15 Correct 41 ms 14356 KB Output is correct
16 Correct 31 ms 12324 KB Output is correct
17 Correct 35 ms 12456 KB Output is correct
18 Correct 32 ms 12340 KB Output is correct
19 Correct 32 ms 12304 KB Output is correct
20 Correct 45 ms 12900 KB Output is correct
21 Correct 36 ms 12708 KB Output is correct
22 Correct 40 ms 14748 KB Output is correct
23 Correct 33 ms 12396 KB Output is correct
24 Correct 34 ms 12456 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12348 KB Output is correct
2 Correct 44 ms 13336 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 30 ms 12376 KB Output is correct
5 Correct 47 ms 14644 KB Output is correct
6 Correct 41 ms 14660 KB Output is correct
7 Correct 34 ms 13780 KB Output is correct
8 Correct 38 ms 13748 KB Output is correct
9 Correct 50 ms 14640 KB Output is correct
10 Correct 42 ms 14700 KB Output is correct
11 Correct 41 ms 14732 KB Output is correct
12 Correct 41 ms 14708 KB Output is correct
13 Correct 45 ms 14540 KB Output is correct
14 Correct 40 ms 14728 KB Output is correct
15 Correct 48 ms 14608 KB Output is correct
16 Correct 40 ms 14620 KB Output is correct
17 Correct 40 ms 14456 KB Output is correct
18 Correct 38 ms 14256 KB Output is correct
19 Correct 39 ms 14320 KB Output is correct
20 Correct 51 ms 14200 KB Output is correct
21 Correct 41 ms 14384 KB Output is correct
22 Correct 37 ms 14356 KB Output is correct
23 Correct 35 ms 12344 KB Output is correct
24 Correct 33 ms 12360 KB Output is correct
25 Correct 33 ms 12692 KB Output is correct
26 Correct 36 ms 12800 KB Output is correct
27 Correct 41 ms 13524 KB Output is correct
28 Correct 40 ms 13484 KB Output is correct
29 Correct 38 ms 13460 KB Output is correct
30 Correct 42 ms 13596 KB Output is correct
31 Correct 39 ms 12432 KB Output is correct
32 Correct 41 ms 12388 KB Output is correct
33 Correct 36 ms 12708 KB Output is correct
34 Correct 37 ms 12732 KB Output is correct
35 Correct 38 ms 13360 KB Output is correct
36 Correct 42 ms 13380 KB Output is correct
37 Correct 36 ms 13532 KB Output is correct
38 Correct 37 ms 13420 KB Output is correct
39 Correct 34 ms 13480 KB Output is correct
40 Correct 39 ms 13400 KB Output is correct
41 Correct 38 ms 13992 KB Output is correct
42 Correct 38 ms 13976 KB Output is correct
43 Correct 44 ms 13972 KB Output is correct
44 Correct 40 ms 14044 KB Output is correct
45 Correct 45 ms 13988 KB Output is correct
46 Correct 39 ms 13944 KB Output is correct
47 Correct 36 ms 13156 KB Output is correct
48 Correct 36 ms 13196 KB Output is correct
49 Correct 41 ms 13072 KB Output is correct
50 Correct 39 ms 13268 KB Output is correct
51 Correct 33 ms 12404 KB Output is correct
52 Correct 34 ms 12348 KB Output is correct
53 Correct 35 ms 12376 KB Output is correct
54 Correct 34 ms 12396 KB Output is correct
55 Correct 39 ms 12260 KB Output is correct
56 Correct 37 ms 12340 KB Output is correct
57 Correct 35 ms 12416 KB Output is correct
58 Correct 34 ms 12540 KB Output is correct
59 Correct 33 ms 12324 KB Output is correct
60 Correct 32 ms 12460 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12440 KB Output is correct
2 Correct 37 ms 13320 KB Output is correct
3 Correct 2 ms 1540 KB Output is correct
4 Correct 32 ms 12288 KB Output is correct
5 Correct 44 ms 14632 KB Output is correct
6 Correct 42 ms 14652 KB Output is correct
7 Correct 34 ms 13676 KB Output is correct
8 Correct 35 ms 13640 KB Output is correct
9 Correct 49 ms 14612 KB Output is correct
10 Correct 51 ms 14608 KB Output is correct
11 Correct 44 ms 14708 KB Output is correct
12 Correct 63 ms 14632 KB Output is correct
13 Correct 44 ms 14708 KB Output is correct
14 Correct 40 ms 14696 KB Output is correct
15 Incorrect 43 ms 14596 KB Wrong Answer [6]
16 Halted 0 ms 0 KB -