oj.uz

답안 #710413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710413 2023-03-15T08:29:01 Z emptypringlescan 길고양이 (JOI20_stray) C++17
91 / 100
 49 ms 16924 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 e){
	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,i.second);
		}
	}
	else if(child==1){
		if(!start){
			start=true;
			turn=1;
			if(e!=-1&&ans[e]==1) turn=0;
			else turn=2;
		}
		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],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,-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]==2){
				cur+="0";
				return pre=0;
			}
			else if(y[1]==2){
				cur+="1";
				return pre=1;
			}
			else{
				cur+="0";
				return pre=0;
			}
		}
		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()==4){
				if(y[0]) cur+="0";
				else cur+="1";
				if(cur=="10100"||cur=="01001"||cur=="10011"||cur=="00110"||cur=="01101"||cur=="11010"){
					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:54:51: warning: unused variable 'c' [-Wunused-variable]
   54 |    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 39 ms 15916 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 28 ms 15308 KB Output is correct
4 Correct 46 ms 16924 KB Output is correct
5 Correct 44 ms 16788 KB Output is correct
6 Correct 36 ms 15780 KB Output is correct
7 Correct 36 ms 15704 KB Output is correct
8 Correct 39 ms 16348 KB Output is correct
9 Correct 47 ms 16444 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 15916 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 28 ms 15308 KB Output is correct
4 Correct 46 ms 16924 KB Output is correct
5 Correct 44 ms 16788 KB Output is correct
6 Correct 36 ms 15780 KB Output is correct
7 Correct 36 ms 15704 KB Output is correct
8 Correct 39 ms 16348 KB Output is correct
9 Correct 47 ms 16444 KB Output is correct
10 Correct 31 ms 13844 KB Output is correct
11 Correct 31 ms 13820 KB Output is correct
12 Correct 32 ms 13692 KB Output is correct
13 Correct 31 ms 13848 KB Output is correct
14 Correct 33 ms 14056 KB Output is correct
15 Correct 37 ms 14460 KB Output is correct
16 Correct 40 ms 16552 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 13532 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 31 ms 13224 KB Output is correct
4 Correct 45 ms 14768 KB Output is correct
5 Correct 49 ms 14704 KB Output is correct
6 Correct 33 ms 13588 KB Output is correct
7 Correct 36 ms 13556 KB Output is correct
8 Correct 40 ms 14036 KB Output is correct
9 Correct 41 ms 14128 KB Output is correct
10 Correct 41 ms 13804 KB Output is correct
11 Correct 40 ms 13916 KB Output is correct
12 Correct 38 ms 13808 KB Output is correct
13 Correct 35 ms 13904 KB Output is correct
14 Correct 39 ms 14140 KB Output is correct
15 Correct 41 ms 14120 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 13532 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 31 ms 13224 KB Output is correct
4 Correct 45 ms 14768 KB Output is correct
5 Correct 49 ms 14704 KB Output is correct
6 Correct 33 ms 13588 KB Output is correct
7 Correct 36 ms 13556 KB Output is correct
8 Correct 40 ms 14036 KB Output is correct
9 Correct 41 ms 14128 KB Output is correct
10 Correct 41 ms 13804 KB Output is correct
11 Correct 40 ms 13916 KB Output is correct
12 Correct 38 ms 13808 KB Output is correct
13 Correct 35 ms 13904 KB Output is correct
14 Correct 39 ms 14140 KB Output is correct
15 Correct 41 ms 14120 KB Output is correct
16 Correct 31 ms 11916 KB Output is correct
17 Correct 28 ms 11972 KB Output is correct
18 Correct 31 ms 11884 KB Output is correct
19 Correct 32 ms 11948 KB Output is correct
20 Correct 38 ms 12564 KB Output is correct
21 Correct 36 ms 12472 KB Output is correct
22 Correct 43 ms 14304 KB Output is correct
23 Correct 34 ms 12216 KB Output is correct
24 Correct 32 ms 11952 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1796 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 2 ms 1808 KB Output is correct
4 Correct 3 ms 1796 KB Output is correct
5 Correct 2 ms 1800 KB Output is correct
6 Correct 2 ms 1820 KB Output is correct
7 Correct 2 ms 1812 KB Output is correct
8 Correct 2 ms 1820 KB Output is correct
9 Correct 2 ms 1804 KB Output is correct
10 Correct 2 ms 1804 KB Output is correct
11 Correct 2 ms 1808 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 1804 KB Output is correct
14 Correct 2 ms 1804 KB Output is correct
15 Correct 2 ms 1804 KB Output is correct
16 Correct 2 ms 1804 KB Output is correct
17 Correct 2 ms 1748 KB Output is correct
18 Correct 2 ms 1804 KB Output is correct
19 Correct 2 ms 1796 KB Output is correct
20 Correct 2 ms 1820 KB Output is correct
21 Correct 2 ms 1804 KB Output is correct
22 Correct 2 ms 1796 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 1804 KB Output is correct
26 Correct 2 ms 1804 KB Output is correct
27 Correct 2 ms 1804 KB Output is correct
28 Correct 3 ms 1804 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 12268 KB Output is correct
2 Correct 39 ms 13384 KB Output is correct
3 Correct 1 ms 1544 KB Output is correct
4 Correct 28 ms 12228 KB Output is correct
5 Correct 47 ms 14756 KB Output is correct
6 Correct 41 ms 14676 KB Output is correct
7 Correct 37 ms 13792 KB Output is correct
8 Correct 36 ms 13708 KB Output is correct
9 Correct 43 ms 14648 KB Output is correct
10 Correct 43 ms 14608 KB Output is correct
11 Correct 39 ms 14528 KB Output is correct
12 Correct 43 ms 14648 KB Output is correct
13 Correct 41 ms 14592 KB Output is correct
14 Correct 42 ms 14592 KB Output is correct
15 Correct 45 ms 14648 KB Output is correct
16 Correct 44 ms 14564 KB Output is correct
17 Correct 46 ms 14292 KB Output is correct
18 Correct 44 ms 14252 KB Output is correct
19 Correct 41 ms 14376 KB Output is correct
20 Correct 43 ms 14424 KB Output is correct
21 Correct 44 ms 14208 KB Output is correct
22 Correct 38 ms 14452 KB Output is correct
23 Correct 37 ms 12380 KB Output is correct
24 Correct 40 ms 12332 KB Output is correct
25 Correct 36 ms 12644 KB Output is correct
26 Correct 35 ms 12824 KB Output is correct
27 Correct 39 ms 13552 KB Output is correct
28 Correct 44 ms 13496 KB Output is correct
29 Correct 40 ms 13632 KB Output is correct
30 Correct 40 ms 13608 KB Output is correct
31 Correct 39 ms 12340 KB Output is correct
32 Correct 39 ms 12436 KB Output is correct
33 Correct 32 ms 12780 KB Output is correct
34 Correct 35 ms 12744 KB Output is correct
35 Correct 44 ms 13428 KB Output is correct
36 Correct 41 ms 13276 KB Output is correct
37 Correct 40 ms 13348 KB Output is correct
38 Correct 39 ms 13340 KB Output is correct
39 Correct 40 ms 13328 KB Output is correct
40 Correct 39 ms 13252 KB Output is correct
41 Correct 44 ms 14064 KB Output is correct
42 Correct 41 ms 14016 KB Output is correct
43 Correct 43 ms 14036 KB Output is correct
44 Correct 42 ms 14000 KB Output is correct
45 Correct 43 ms 13920 KB Output is correct
46 Correct 40 ms 13956 KB Output is correct
47 Correct 37 ms 13128 KB Output is correct
48 Correct 34 ms 13148 KB Output is correct
49 Correct 36 ms 13152 KB Output is correct
50 Correct 38 ms 13236 KB Output is correct
51 Correct 39 ms 12368 KB Output is correct
52 Correct 40 ms 12288 KB Output is correct
53 Correct 37 ms 12352 KB Output is correct
54 Correct 36 ms 12216 KB Output is correct
55 Correct 36 ms 12416 KB Output is correct
56 Correct 38 ms 12404 KB Output is correct
57 Correct 41 ms 12340 KB Output is correct
58 Correct 37 ms 12352 KB Output is correct
59 Correct 39 ms 12352 KB Output is correct
60 Correct 38 ms 12340 KB Output is correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 12272 KB Output is correct
2 Correct 40 ms 13312 KB Output is correct
3 Correct 1 ms 1544 KB Output is correct
4 Correct 32 ms 12312 KB Output is correct
5 Correct 41 ms 14576 KB Output is correct
6 Correct 44 ms 14584 KB Output is correct
7 Incorrect 35 ms 13788 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -