oj.uz

Submission #710453

# Submission time Handle Problem Language Result Execution time Memory
710453 2023-03-15T08:52:53 Z emptypringlescan Stray Cat (JOI20_stray) C++17
91 / 100
 64 ms 17044 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="";
bool past=false;
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){
			assert(past);
			return -1;
		}
		//assert(y[1-pre]==1);
		return pre=1-pre;
	}
	if(start){
		start=false;
		if(y[0]+y[1]==2){
			confuse=true;
			past=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 15976 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 30 ms 15348 KB Output is correct
4 Correct 46 ms 16924 KB Output is correct
5 Correct 56 ms 17044 KB Output is correct
6 Correct 39 ms 15600 KB Output is correct
7 Correct 40 ms 15708 KB Output is correct
8 Correct 41 ms 16340 KB Output is correct
9 Correct 45 ms 16420 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 15976 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 30 ms 15348 KB Output is correct
4 Correct 46 ms 16924 KB Output is correct
5 Correct 56 ms 17044 KB Output is correct
6 Correct 39 ms 15600 KB Output is correct
7 Correct 40 ms 15708 KB Output is correct
8 Correct 41 ms 16340 KB Output is correct
9 Correct 45 ms 16420 KB Output is correct
10 Correct 38 ms 13764 KB Output is correct
11 Correct 39 ms 13888 KB Output is correct
12 Correct 34 ms 13804 KB Output is correct
13 Correct 34 ms 13748 KB Output is correct
14 Correct 35 ms 14092 KB Output is correct
15 Correct 43 ms 14284 KB Output is correct
16 Correct 53 ms 16488 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13476 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 29 ms 13216 KB Output is correct
4 Correct 41 ms 14796 KB Output is correct
5 Correct 43 ms 14756 KB Output is correct
6 Correct 36 ms 13488 KB Output is correct
7 Correct 32 ms 13444 KB Output is correct
8 Correct 41 ms 13996 KB Output is correct
9 Correct 40 ms 14000 KB Output is correct
10 Correct 35 ms 13864 KB Output is correct
11 Correct 47 ms 13956 KB Output is correct
12 Correct 40 ms 13864 KB Output is correct
13 Correct 37 ms 13788 KB Output is correct
14 Correct 40 ms 14152 KB Output is correct
15 Correct 40 ms 14160 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13476 KB Output is correct
2 Correct 1 ms 1544 KB Output is correct
3 Correct 29 ms 13216 KB Output is correct
4 Correct 41 ms 14796 KB Output is correct
5 Correct 43 ms 14756 KB Output is correct
6 Correct 36 ms 13488 KB Output is correct
7 Correct 32 ms 13444 KB Output is correct
8 Correct 41 ms 13996 KB Output is correct
9 Correct 40 ms 14000 KB Output is correct
10 Correct 35 ms 13864 KB Output is correct
11 Correct 47 ms 13956 KB Output is correct
12 Correct 40 ms 13864 KB Output is correct
13 Correct 37 ms 13788 KB Output is correct
14 Correct 40 ms 14152 KB Output is correct
15 Correct 40 ms 14160 KB Output is correct
16 Correct 33 ms 12020 KB Output is correct
17 Correct 32 ms 12116 KB Output is correct
18 Correct 30 ms 11856 KB Output is correct
19 Correct 30 ms 11924 KB Output is correct
20 Correct 37 ms 12524 KB Output is correct
21 Correct 35 ms 12380 KB Output is correct
22 Correct 44 ms 14244 KB Output is correct
23 Correct 40 ms 11932 KB Output is correct
24 Correct 34 ms 11996 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1796 KB Output is correct
2 Correct 1 ms 1536 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 1808 KB Output is correct
6 Correct 2 ms 1804 KB Output is correct
7 Correct 2 ms 1796 KB Output is correct
8 Correct 3 ms 1808 KB Output is correct
9 Correct 2 ms 1804 KB Output is correct
10 Correct 2 ms 1796 KB Output is correct
11 Correct 2 ms 1796 KB Output is correct
12 Correct 2 ms 1804 KB Output is correct
13 Correct 2 ms 1796 KB Output is correct
14 Correct 2 ms 1808 KB Output is correct
15 Correct 2 ms 1804 KB Output is correct
16 Correct 2 ms 1800 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 1804 KB Output is correct
20 Correct 2 ms 1808 KB Output is correct
21 Correct 2 ms 1800 KB Output is correct
22 Correct 2 ms 1796 KB Output is correct
23 Correct 3 ms 1796 KB Output is correct
24 Correct 2 ms 1804 KB Output is correct
25 Correct 2 ms 1796 KB Output is correct
26 Correct 2 ms 1796 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

# Verdict Execution time Memory Grader output
1 Correct 33 ms 12344 KB Output is correct
2 Correct 40 ms 13340 KB Output is correct
3 Correct 1 ms 1544 KB Output is correct
4 Correct 36 ms 12340 KB Output is correct
5 Correct 42 ms 14664 KB Output is correct
6 Correct 41 ms 14704 KB Output is correct
7 Correct 34 ms 13728 KB Output is correct
8 Correct 34 ms 13864 KB Output is correct
9 Correct 53 ms 14520 KB Output is correct
10 Correct 53 ms 14640 KB Output is correct
11 Correct 44 ms 14648 KB Output is correct
12 Correct 47 ms 14604 KB Output is correct
13 Correct 48 ms 14604 KB Output is correct
14 Correct 42 ms 14572 KB Output is correct
15 Correct 40 ms 14608 KB Output is correct
16 Correct 47 ms 14620 KB Output is correct
17 Correct 47 ms 14408 KB Output is correct
18 Correct 43 ms 14244 KB Output is correct
19 Correct 42 ms 14444 KB Output is correct
20 Correct 39 ms 14312 KB Output is correct
21 Correct 55 ms 14240 KB Output is correct
22 Correct 43 ms 14208 KB Output is correct
23 Correct 38 ms 12432 KB Output is correct
24 Correct 33 ms 12408 KB Output is correct
25 Correct 34 ms 12684 KB Output is correct
26 Correct 34 ms 12736 KB Output is correct
27 Correct 40 ms 13412 KB Output is correct
28 Correct 40 ms 13556 KB Output is correct
29 Correct 41 ms 13452 KB Output is correct
30 Correct 36 ms 13560 KB Output is correct
31 Correct 32 ms 12504 KB Output is correct
32 Correct 32 ms 12348 KB Output is correct
33 Correct 32 ms 12784 KB Output is correct
34 Correct 40 ms 12748 KB Output is correct
35 Correct 41 ms 13404 KB Output is correct
36 Correct 36 ms 13320 KB Output is correct
37 Correct 37 ms 13332 KB Output is correct
38 Correct 38 ms 13396 KB Output is correct
39 Correct 46 ms 13328 KB Output is correct
40 Correct 49 ms 13352 KB Output is correct
41 Correct 38 ms 14024 KB Output is correct
42 Correct 41 ms 13924 KB Output is correct
43 Correct 43 ms 13800 KB Output is correct
44 Correct 39 ms 13904 KB Output is correct
45 Correct 58 ms 14016 KB Output is correct
46 Correct 39 ms 13800 KB Output is correct
47 Correct 37 ms 13220 KB Output is correct
48 Correct 38 ms 13268 KB Output is correct
49 Correct 38 ms 13168 KB Output is correct
50 Correct 38 ms 13288 KB Output is correct
51 Correct 48 ms 12392 KB Output is correct
52 Correct 34 ms 12324 KB Output is correct
53 Correct 35 ms 12384 KB Output is correct
54 Correct 34 ms 12356 KB Output is correct
55 Correct 33 ms 12364 KB Output is correct
56 Correct 45 ms 12380 KB Output is correct
57 Correct 39 ms 12308 KB Output is correct
58 Correct 40 ms 12364 KB Output is correct
59 Correct 35 ms 12324 KB Output is correct
60 Correct 34 ms 12368 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 12464 KB Output is correct
2 Correct 40 ms 13336 KB Output is correct
3 Correct 1 ms 1544 KB Output is correct
4 Correct 28 ms 12384 KB Output is correct
5 Correct 40 ms 14564 KB Output is correct
6 Correct 45 ms 14640 KB Output is correct
7 Correct 39 ms 13632 KB Output is correct
8 Correct 46 ms 13768 KB Output is correct
9 Correct 48 ms 14584 KB Output is correct
10 Correct 54 ms 14500 KB Output is correct
11 Correct 43 ms 14556 KB Output is correct
12 Correct 40 ms 14636 KB Output is correct
13 Correct 40 ms 14648 KB Output is correct
14 Correct 42 ms 14676 KB Output is correct
15 Correct 64 ms 14680 KB Output is correct
16 Correct 45 ms 14648 KB Output is correct
17 Correct 43 ms 14388 KB Output is correct
18 Correct 48 ms 14428 KB Output is correct
19 Correct 53 ms 14296 KB Output is correct
20 Correct 46 ms 14396 KB Output is correct
21 Correct 43 ms 14300 KB Output is correct
22 Correct 46 ms 14444 KB Output is correct
23 Correct 40 ms 12308 KB Output is correct
24 Correct 36 ms 12336 KB Output is correct
25 Correct 53 ms 12752 KB Output is correct
26 Correct 39 ms 12716 KB Output is correct
27 Correct 58 ms 13484 KB Output is correct
28 Correct 45 ms 13484 KB Output is correct
29 Correct 44 ms 13564 KB Output is correct
30 Correct 43 ms 13560 KB Output is correct
31 Correct 32 ms 12404 KB Output is correct
32 Correct 31 ms 12340 KB Output is correct
33 Correct 34 ms 12716 KB Output is correct
34 Correct 33 ms 12600 KB Output is correct
35 Correct 52 ms 13304 KB Output is correct
36 Correct 44 ms 13324 KB Output is correct
37 Correct 44 ms 13412 KB Output is correct
38 Correct 37 ms 13408 KB Output is correct
39 Correct 37 ms 13400 KB Output is correct
40 Correct 45 ms 13452 KB Output is correct
41 Correct 57 ms 13896 KB Output is correct
42 Correct 41 ms 13904 KB Output is correct
43 Correct 41 ms 14056 KB Output is correct
44 Correct 47 ms 13960 KB Output is correct
45 Correct 45 ms 13972 KB Output is correct
46 Correct 61 ms 13968 KB Output is correct
47 Correct 36 ms 13240 KB Output is correct
48 Correct 38 ms 13308 KB Output is correct
49 Incorrect 36 ms 13120 KB Wrong Answer [6]
50 Halted 0 ms 0 KB -