oj.uz

Submission #710439

# Submission time Handle Problem Language Result Execution time Memory
710439 2023-03-15T08:43:42 Z emptypringlescan Stray Cat (JOI20_stray) C++17
91 / 100
 57 ms 16952 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=1;
			if(c==-1||c==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]);
		}
	}
}
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+="01";
				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()==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

# Verdict Execution time Memory Grader output
1 Correct 38 ms 15980 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 31 ms 15416 KB Output is correct
4 Correct 45 ms 16948 KB Output is correct
5 Correct 51 ms 16952 KB Output is correct
6 Correct 37 ms 15756 KB Output is correct
7 Correct 38 ms 15704 KB Output is correct
8 Correct 43 ms 16316 KB Output is correct
9 Correct 45 ms 16572 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 15980 KB Output is correct
2 Correct 1 ms 1536 KB Output is correct
3 Correct 31 ms 15416 KB Output is correct
4 Correct 45 ms 16948 KB Output is correct
5 Correct 51 ms 16952 KB Output is correct
6 Correct 37 ms 15756 KB Output is correct
7 Correct 38 ms 15704 KB Output is correct
8 Correct 43 ms 16316 KB Output is correct
9 Correct 45 ms 16572 KB Output is correct
10 Correct 34 ms 13928 KB Output is correct
11 Correct 33 ms 13904 KB Output is correct
12 Correct 34 ms 13724 KB Output is correct
13 Correct 31 ms 13724 KB Output is correct
14 Correct 34 ms 13980 KB Output is correct
15 Correct 41 ms 14468 KB Output is correct
16 Correct 41 ms 16556 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13580 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 30 ms 13184 KB Output is correct
4 Correct 44 ms 14696 KB Output is correct
5 Correct 47 ms 14764 KB Output is correct
6 Correct 32 ms 13440 KB Output is correct
7 Correct 33 ms 13600 KB Output is correct
8 Correct 40 ms 14200 KB Output is correct
9 Correct 39 ms 14004 KB Output is correct
10 Correct 38 ms 13888 KB Output is correct
11 Correct 38 ms 13920 KB Output is correct
12 Correct 43 ms 13780 KB Output is correct
13 Correct 36 ms 13800 KB Output is correct
14 Correct 40 ms 14088 KB Output is correct
15 Correct 41 ms 14188 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 13580 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 30 ms 13184 KB Output is correct
4 Correct 44 ms 14696 KB Output is correct
5 Correct 47 ms 14764 KB Output is correct
6 Correct 32 ms 13440 KB Output is correct
7 Correct 33 ms 13600 KB Output is correct
8 Correct 40 ms 14200 KB Output is correct
9 Correct 39 ms 14004 KB Output is correct
10 Correct 38 ms 13888 KB Output is correct
11 Correct 38 ms 13920 KB Output is correct
12 Correct 43 ms 13780 KB Output is correct
13 Correct 36 ms 13800 KB Output is correct
14 Correct 40 ms 14088 KB Output is correct
15 Correct 41 ms 14188 KB Output is correct
16 Correct 30 ms 11996 KB Output is correct
17 Correct 30 ms 12040 KB Output is correct
18 Correct 34 ms 12028 KB Output is correct
19 Correct 31 ms 11872 KB Output is correct
20 Correct 37 ms 12464 KB Output is correct
21 Correct 35 ms 12252 KB Output is correct
22 Correct 40 ms 14288 KB Output is correct
23 Correct 33 ms 12008 KB Output is correct
24 Correct 33 ms 12020 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1804 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 2 ms 1796 KB Output is correct
4 Correct 2 ms 1808 KB Output is correct
5 Correct 3 ms 1784 KB Output is correct
6 Correct 2 ms 1856 KB Output is correct
7 Correct 2 ms 1796 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1800 KB Output is correct
10 Correct 2 ms 1800 KB Output is correct
11 Correct 2 ms 1796 KB Output is correct
12 Correct 2 ms 1796 KB Output is correct
13 Correct 2 ms 1880 KB Output is correct
14 Correct 2 ms 1796 KB Output is correct
15 Correct 2 ms 1796 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 1796 KB Output is correct
19 Correct 2 ms 1796 KB Output is correct
20 Correct 2 ms 1800 KB Output is correct
21 Correct 3 ms 1808 KB Output is correct
22 Correct 2 ms 1804 KB Output is correct
23 Correct 2 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 1804 KB Output is correct
27 Correct 2 ms 1796 KB Output is correct
28 Correct 2 ms 1796 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 12432 KB Output is correct
2 Correct 48 ms 13340 KB Output is correct
3 Correct 1 ms 1544 KB Output is correct
4 Correct 31 ms 12244 KB Output is correct
5 Correct 41 ms 14668 KB Output is correct
6 Correct 43 ms 14632 KB Output is correct
7 Correct 35 ms 13644 KB Output is correct
8 Correct 35 ms 13780 KB Output is correct
9 Correct 44 ms 14608 KB Output is correct
10 Correct 47 ms 14584 KB Output is correct
11 Correct 47 ms 14676 KB Output is correct
12 Correct 44 ms 14604 KB Output is correct
13 Correct 47 ms 14608 KB Output is correct
14 Correct 48 ms 14624 KB Output is correct
15 Correct 45 ms 14604 KB Output is correct
16 Correct 41 ms 14672 KB Output is correct
17 Correct 39 ms 14196 KB Output is correct
18 Correct 45 ms 14224 KB Output is correct
19 Correct 45 ms 14180 KB Output is correct
20 Correct 40 ms 14336 KB Output is correct
21 Correct 40 ms 14276 KB Output is correct
22 Correct 46 ms 14296 KB Output is correct
23 Correct 33 ms 12404 KB Output is correct
24 Correct 33 ms 12400 KB Output is correct
25 Correct 39 ms 12696 KB Output is correct
26 Correct 34 ms 12596 KB Output is correct
27 Correct 39 ms 13556 KB Output is correct
28 Correct 40 ms 13456 KB Output is correct
29 Correct 40 ms 13496 KB Output is correct
30 Correct 38 ms 13520 KB Output is correct
31 Correct 35 ms 12388 KB Output is correct
32 Correct 34 ms 12392 KB Output is correct
33 Correct 35 ms 12756 KB Output is correct
34 Correct 37 ms 12780 KB Output is correct
35 Correct 37 ms 13372 KB Output is correct
36 Correct 38 ms 13332 KB Output is correct
37 Correct 40 ms 13328 KB Output is correct
38 Correct 39 ms 13336 KB Output is correct
39 Correct 37 ms 13360 KB Output is correct
40 Correct 40 ms 13420 KB Output is correct
41 Correct 45 ms 14068 KB Output is correct
42 Correct 44 ms 13908 KB Output is correct
43 Correct 45 ms 13992 KB Output is correct
44 Correct 44 ms 13940 KB Output is correct
45 Correct 42 ms 13908 KB Output is correct
46 Correct 43 ms 14048 KB Output is correct
47 Correct 46 ms 13120 KB Output is correct
48 Correct 40 ms 13240 KB Output is correct
49 Correct 37 ms 13016 KB Output is correct
50 Correct 41 ms 13372 KB Output is correct
51 Correct 35 ms 12380 KB Output is correct
52 Correct 34 ms 12396 KB Output is correct
53 Correct 36 ms 12432 KB Output is correct
54 Correct 34 ms 12380 KB Output is correct
55 Correct 34 ms 12384 KB Output is correct
56 Correct 36 ms 12392 KB Output is correct
57 Correct 35 ms 12384 KB Output is correct
58 Correct 34 ms 12336 KB Output is correct
59 Correct 35 ms 12376 KB Output is correct
60 Correct 35 ms 12372 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 12344 KB Output is correct
2 Correct 37 ms 13348 KB Output is correct
3 Correct 1 ms 1552 KB Output is correct
4 Correct 29 ms 12096 KB Output is correct
5 Correct 57 ms 14660 KB Output is correct
6 Correct 48 ms 14520 KB Output is correct
7 Correct 39 ms 13808 KB Output is correct
8 Correct 37 ms 13760 KB Output is correct
9 Correct 43 ms 14572 KB Output is correct
10 Correct 43 ms 14664 KB Output is correct
11 Correct 47 ms 14712 KB Output is correct
12 Correct 51 ms 14580 KB Output is correct
13 Correct 48 ms 14532 KB Output is correct
14 Correct 41 ms 14520 KB Output is correct
15 Correct 48 ms 14580 KB Output is correct
16 Correct 41 ms 14672 KB Output is correct
17 Correct 48 ms 14324 KB Output is correct
18 Correct 50 ms 14356 KB Output is correct
19 Correct 41 ms 14492 KB Output is correct
20 Correct 45 ms 14384 KB Output is correct
21 Correct 50 ms 14284 KB Output is correct
22 Correct 49 ms 14320 KB Output is correct
23 Correct 38 ms 12368 KB Output is correct
24 Correct 38 ms 12348 KB Output is correct
25 Correct 37 ms 12672 KB Output is correct
26 Correct 47 ms 12636 KB Output is correct
27 Correct 46 ms 13484 KB Output is correct
28 Correct 41 ms 13476 KB Output is correct
29 Correct 39 ms 13548 KB Output is correct
30 Correct 45 ms 13456 KB Output is correct
31 Correct 40 ms 12412 KB Output is correct
32 Correct 33 ms 12384 KB Output is correct
33 Correct 37 ms 12784 KB Output is correct
34 Correct 36 ms 12744 KB Output is correct
35 Correct 39 ms 13352 KB Output is correct
36 Correct 43 ms 13364 KB Output is correct
37 Correct 43 ms 13416 KB Output is correct
38 Correct 40 ms 13360 KB Output is correct
39 Correct 56 ms 13332 KB Output is correct
40 Correct 40 ms 13416 KB Output is correct
41 Correct 52 ms 13876 KB Output is correct
42 Correct 40 ms 14072 KB Output is correct
43 Correct 40 ms 13916 KB Output is correct
44 Correct 44 ms 13912 KB Output is correct
45 Correct 45 ms 13892 KB Output is correct
46 Correct 44 ms 14036 KB Output is correct
47 Correct 49 ms 13232 KB Output is correct
48 Correct 40 ms 13180 KB Output is correct
49 Incorrect 43 ms 13084 KB Wrong Answer [6]
50 Halted 0 ms 0 KB -