oj.uz

답안 #710399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710399 2023-03-15T08:12:35 Z emptypringlescan 길고양이 (JOI20_stray) C++17
20 / 100
 63 ms 16940 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]==2){
				cur+="00";
				return pre=0;
			}
			else if(y[1]==2){
				cur+="11";
				return pre=1;
			}
			else{
				cur+="10";
				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: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 41 ms 15796 KB Output is correct
2 Correct 2 ms 1544 KB Output is correct
3 Correct 34 ms 15284 KB Output is correct
4 Correct 47 ms 16940 KB Output is correct
5 Correct 62 ms 16864 KB Output is correct
6 Correct 34 ms 15720 KB Output is correct
7 Correct 35 ms 15748 KB Output is correct
8 Correct 43 ms 16332 KB Output is correct
9 Correct 47 ms 16248 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 15796 KB Output is correct
2 Correct 2 ms 1544 KB Output is correct
3 Correct 34 ms 15284 KB Output is correct
4 Correct 47 ms 16940 KB Output is correct
5 Correct 62 ms 16864 KB Output is correct
6 Correct 34 ms 15720 KB Output is correct
7 Correct 35 ms 15748 KB Output is correct
8 Correct 43 ms 16332 KB Output is correct
9 Correct 47 ms 16248 KB Output is correct
10 Correct 36 ms 13764 KB Output is correct
11 Correct 36 ms 13848 KB Output is correct
12 Correct 34 ms 13800 KB Output is correct
13 Correct 34 ms 13752 KB Output is correct
14 Correct 34 ms 14032 KB Output is correct
15 Correct 48 ms 14412 KB Output is correct
16 Correct 43 ms 16444 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13504 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 34 ms 13092 KB Output is correct
4 Correct 47 ms 14660 KB Output is correct
5 Correct 49 ms 14672 KB Output is correct
6 Correct 36 ms 13512 KB Output is correct
7 Correct 38 ms 13420 KB Output is correct
8 Correct 47 ms 14032 KB Output is correct
9 Correct 45 ms 14016 KB Output is correct
10 Correct 39 ms 13824 KB Output is correct
11 Correct 46 ms 13792 KB Output is correct
12 Correct 45 ms 13844 KB Output is correct
13 Correct 37 ms 13764 KB Output is correct
14 Correct 37 ms 14060 KB Output is correct
15 Correct 43 ms 14056 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 13504 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 34 ms 13092 KB Output is correct
4 Correct 47 ms 14660 KB Output is correct
5 Correct 49 ms 14672 KB Output is correct
6 Correct 36 ms 13512 KB Output is correct
7 Correct 38 ms 13420 KB Output is correct
8 Correct 47 ms 14032 KB Output is correct
9 Correct 45 ms 14016 KB Output is correct
10 Correct 39 ms 13824 KB Output is correct
11 Correct 46 ms 13792 KB Output is correct
12 Correct 45 ms 13844 KB Output is correct
13 Correct 37 ms 13764 KB Output is correct
14 Correct 37 ms 14060 KB Output is correct
15 Correct 43 ms 14056 KB Output is correct
16 Correct 31 ms 11900 KB Output is correct
17 Correct 36 ms 11912 KB Output is correct
18 Correct 30 ms 11824 KB Output is correct
19 Correct 30 ms 11896 KB Output is correct
20 Correct 36 ms 12516 KB Output is correct
21 Correct 33 ms 12256 KB Output is correct
22 Correct 37 ms 14316 KB Output is correct
23 Correct 32 ms 12032 KB Output is correct
24 Correct 39 ms 12072 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 12384 KB Output is correct
2 Correct 39 ms 13332 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 32 ms 12324 KB Output is correct
5 Correct 44 ms 14612 KB Output is correct
6 Correct 44 ms 14644 KB Output is correct
7 Correct 39 ms 13724 KB Output is correct
8 Correct 41 ms 13704 KB Output is correct
9 Correct 41 ms 14548 KB Output is correct
10 Correct 47 ms 14608 KB Output is correct
11 Correct 44 ms 14628 KB Output is correct
12 Correct 43 ms 14636 KB Output is correct
13 Correct 46 ms 14652 KB Output is correct
14 Correct 42 ms 14680 KB Output is correct
15 Correct 44 ms 14572 KB Output is correct
16 Correct 47 ms 14764 KB Output is correct
17 Correct 44 ms 14232 KB Output is correct
18 Correct 39 ms 14436 KB Output is correct
19 Correct 38 ms 14340 KB Output is correct
20 Correct 39 ms 14232 KB Output is correct
21 Correct 40 ms 14388 KB Output is correct
22 Correct 47 ms 14304 KB Output is correct
23 Correct 35 ms 12384 KB Output is correct
24 Correct 34 ms 12484 KB Output is correct
25 Correct 38 ms 12716 KB Output is correct
26 Correct 35 ms 12800 KB Output is correct
27 Correct 58 ms 13520 KB Output is correct
28 Correct 63 ms 13456 KB Output is correct
29 Correct 38 ms 13528 KB Output is correct
30 Correct 39 ms 13492 KB Output is correct
31 Correct 33 ms 12392 KB Output is correct
32 Correct 34 ms 12472 KB Output is correct
33 Correct 48 ms 12744 KB Output is correct
34 Correct 37 ms 12580 KB Output is correct
35 Correct 37 ms 13392 KB Output is correct
36 Correct 47 ms 13372 KB Output is correct
37 Correct 44 ms 13332 KB Output is correct
38 Correct 40 ms 13416 KB Output is correct
39 Correct 46 ms 13296 KB Output is correct
40 Correct 41 ms 13524 KB Output is correct
41 Correct 44 ms 13956 KB Output is correct
42 Correct 38 ms 13988 KB Output is correct
43 Correct 40 ms 13884 KB Output is correct
44 Correct 40 ms 14000 KB Output is correct
45 Correct 50 ms 13876 KB Output is correct
46 Correct 44 ms 14012 KB Output is correct
47 Correct 38 ms 13256 KB Output is correct
48 Correct 36 ms 13220 KB Output is correct
49 Correct 36 ms 13156 KB Output is correct
50 Correct 43 ms 13264 KB Output is correct
51 Correct 47 ms 12264 KB Output is correct
52 Correct 40 ms 12340 KB Output is correct
53 Correct 34 ms 12348 KB Output is correct
54 Incorrect 33 ms 12348 KB Wrong Answer [6]
55 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 12296 KB Output is correct
2 Correct 39 ms 13244 KB Output is correct
3 Correct 1 ms 1536 KB Output is correct
4 Correct 30 ms 12172 KB Output is correct
5 Correct 42 ms 14660 KB Output is correct
6 Correct 44 ms 14472 KB Output is correct
7 Correct 43 ms 13780 KB Output is correct
8 Correct 42 ms 13804 KB Output is correct
9 Correct 43 ms 14644 KB Output is correct
10 Correct 43 ms 14540 KB Output is correct
11 Correct 41 ms 14664 KB Output is correct
12 Correct 41 ms 14692 KB Output is correct
13 Correct 41 ms 14728 KB Output is correct
14 Correct 46 ms 14540 KB Output is correct
15 Correct 51 ms 14752 KB Output is correct
16 Correct 52 ms 15044 KB Output is correct
17 Correct 39 ms 14732 KB Output is correct
18 Correct 45 ms 14720 KB Output is correct
19 Correct 40 ms 14776 KB Output is correct
20 Correct 48 ms 14700 KB Output is correct
21 Correct 40 ms 14700 KB Output is correct
22 Correct 42 ms 14812 KB Output is correct
23 Correct 36 ms 12840 KB Output is correct
24 Correct 40 ms 12744 KB Output is correct
25 Correct 39 ms 13192 KB Output is correct
26 Correct 41 ms 13248 KB Output is correct
27 Correct 55 ms 13892 KB Output is correct
28 Correct 44 ms 13940 KB Output is correct
29 Correct 41 ms 13976 KB Output is correct
30 Correct 40 ms 13952 KB Output is correct
31 Correct 40 ms 12788 KB Output is correct
32 Correct 44 ms 12860 KB Output is correct
33 Correct 43 ms 13188 KB Output is correct
34 Correct 39 ms 13196 KB Output is correct
35 Correct 56 ms 13796 KB Output is correct
36 Correct 46 ms 13668 KB Output is correct
37 Correct 47 ms 13840 KB Output is correct
38 Correct 50 ms 13680 KB Output is correct
39 Correct 55 ms 13796 KB Output is correct
40 Correct 45 ms 13700 KB Output is correct
41 Correct 51 ms 14348 KB Output is correct
42 Correct 43 ms 14392 KB Output is correct
43 Correct 47 ms 14276 KB Output is correct
44 Correct 55 ms 14272 KB Output is correct
45 Correct 45 ms 14240 KB Output is correct
46 Correct 61 ms 14424 KB Output is correct
47 Correct 52 ms 13612 KB Output is correct
48 Correct 50 ms 13584 KB Output is correct
49 Correct 55 ms 13500 KB Output is correct
50 Correct 55 ms 13612 KB Output is correct
51 Correct 43 ms 12812 KB Output is correct
52 Correct 48 ms 12676 KB Output is correct
53 Correct 41 ms 12800 KB Output is correct
54 Correct 38 ms 12804 KB Output is correct
55 Incorrect 38 ms 12680 KB Wrong Answer [6]
56 Halted 0 ms 0 KB -