oj.uz

Submission #928678

# Submission time Handle Problem Language Result Execution time Memory
928678 2024-02-17T01:45:17 Z MilosMilutinovic Stray Cat (JOI20_stray) C++14
100 / 100
 49 ms 15924 KB 
#include "Anthony.h"
#include<bits/stdc++.h>
 
using namespace std;
 
namespace {
const int seq[]={1,0,1,1,0,0};
int n,tot;
int v[40005],nxt[40005],h[20005],d[20005],q[20005],idx[20005];
vector<int> ret;
 
void addedge(int x,int y){
	v[++tot]=y; nxt[tot]=h[x]; h[x]=tot;
	v[++tot]=x; nxt[tot]=h[y]; h[y]=tot;
}
 
void bfs(){
	for(int i=0;i<n;i++) d[i]=-1;
	int front=0,rear=0;
	q[rear++]=0; d[0]=0;
	while(front<rear){
		int x=q[front];
		for(int p=h[x];p;p=nxt[p]){
			if(d[v[p]]==-1){
				d[v[p]]=d[x]+1;
				q[rear++]=v[p];
			}
		}
		++front;
	}
}

void dfs(int x,int fa,int lst,int i){
	int ch=0;
	for(int p=h[x];p;p=nxt[p]) if(v[p]!=fa) ch++;
	if(ch==0) return;
	if(ch==1){
		for(int p=h[x];p;p=nxt[p]){
			if(v[p]==fa) continue;
			ret[idx[v[p]]]=seq[i];
			dfs(v[p],x,seq[i],(i+1)%6);
		}
	}else{
		for(int p=h[x];p;p=nxt[p]){
			if(v[p]==fa) continue;
			ret[idx[v[p]]]=lst^1;
			dfs(v[p],x,lst^1,lst^1);
		}
	}
}
}
 
vector<int> Mark(int n,int m,int a,int b,vector<int> u,vector<int> v){
	::n=n;
	tot=0;
	for(int i=0;i<n;i++) h[i]=0;
	for(int i=0;i<m;i++) addedge(u[i],v[i]);
	if(a>=3){
		bfs();
		vector<int> col(m);
		for(int i=0;i<m;i++) col[i]=min(d[u[i]],d[v[i]])%3;
		return col;
	}else{
		bfs();
		for(int i=0;i<m;i++){
			if(d[u[i]]>d[v[i]]) swap(u[i],v[i]);
			idx[v[i]]=i;
		}
		ret.resize(m);
		dfs(0,0,0,0);
		return ret;
	}
	return vector<int>(m,0);
}
#include "Catherine.h"
#include<bits/stdc++.h>

#define pb push_back
 
using namespace std;
 
namespace {
 
const int seq[]={1,0,1,1,0,0};
int a,b;
bool up;
vector<int> edg,pth;

bool Down(){
	for(int i=0;i<6;i++){
		bool ok=true;
		for(int j=0;j<(int)pth.size();j++){
			if(seq[(i+j)%6]!=pth[j]) ok=false;
		}
		if(ok) return true;
	}
	return false;
}
}  // namespace
 
void Init(int A,int B){
	a=A; b=B;
	up=false;
	edg.clear();
	pth.clear();
}
 
int Move(vector<int> y){
	if(a>=3){
		int cnt=0;
		for(int i=0;i<a;i++) cnt+=(y[i]>0?1:0);
		if(cnt==1){
			for(int i=0;i<a;i++) if(y[i]>0) return i;
		}
		for(int i=0;i<a;i++){
			if(y[i]>0&&y[(i+1)%3]>0) return i;
		}
	}
	if(up){
		if(y[0]==0&&y[1]==0){
			edg.pb(edg.back());
			return -1;
		}
		if(y[0]==0){
			assert(y[1]>0);
			edg.pb(1);
			return 1;
		}
		if(y[1]==0){
			assert(y[0]>0);
			edg.pb(0);
			return 0;
		}
		int t=edg.back();
		edg.pb(t^1);
		return t^1;
	}
	if(y[0]+y[1]+(!edg.empty()?1:0)==1){
		up=true;
		if(!edg.empty()) y[edg.back()]++;
		for(int i=0;i<2;i++){
			if(y[i]==1){
				int v;
				if(!edg.empty()&&edg.back()==i) v=-1;
				else v=i;
				edg.pb(i);
				return v;
			}
		}
		assert(false);
	}
	if(y[0]+y[1]+(!edg.empty()?1:0)>2){
		up=true;
		if(!edg.empty()) y[edg.back()]++;
		for(int i=0;i<2;i++){
			if(y[i]==1){
				int v;
				if(!edg.empty()&&edg.back()==i) v=-1;
				else v=i;
				edg.pb(i);
				return v;
			}
		}
		assert(false);
	}
	if((int)edg.size()<3){
		if(y[0]==0){
			edg.pb(1);
			pth.pb(1);
			if(y[1]==2) pth.pb(1);
			return 1;
		}
		if(y[1]!=0) pth.pb(1);
		else if(y[0]==2) pth.pb(0);
		edg.pb(0);
		pth.pb(0);
		return 0;
	}
	assert(y[0]+y[1]==1);
	if(y[0]==1) pth.pb(0);
	else assert(y[1]>0),pth.pb(1);
	if(Down()){
		up=true;
		edg.pb(edg.back());
		return -1;
	}else{
		up=true;
		if(y[0]==1){
			edg.pb(0);
			return 0;
		}else{
			assert(y[1]>0);
			edg.pb(1);
			return 1;
		}
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 14968 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 24 ms 14156 KB Output is correct
4 Correct 33 ms 15924 KB Output is correct
5 Correct 49 ms 15896 KB Output is correct
6 Correct 31 ms 14708 KB Output is correct
7 Correct 30 ms 14708 KB Output is correct
8 Correct 33 ms 15476 KB Output is correct
9 Correct 45 ms 15240 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 14968 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 24 ms 14156 KB Output is correct
4 Correct 33 ms 15924 KB Output is correct
5 Correct 49 ms 15896 KB Output is correct
6 Correct 31 ms 14708 KB Output is correct
7 Correct 30 ms 14708 KB Output is correct
8 Correct 33 ms 15476 KB Output is correct
9 Correct 45 ms 15240 KB Output is correct
10 Correct 24 ms 12832 KB Output is correct
11 Correct 24 ms 12908 KB Output is correct
12 Correct 28 ms 12920 KB Output is correct
13 Correct 24 ms 12884 KB Output is correct
14 Correct 30 ms 13112 KB Output is correct
15 Correct 28 ms 13388 KB Output is correct
16 Correct 39 ms 15632 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12444 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 25 ms 11876 KB Output is correct
4 Correct 38 ms 13848 KB Output is correct
5 Correct 38 ms 13868 KB Output is correct
6 Correct 28 ms 12328 KB Output is correct
7 Correct 31 ms 12364 KB Output is correct
8 Correct 31 ms 13180 KB Output is correct
9 Correct 29 ms 13088 KB Output is correct
10 Correct 28 ms 12932 KB Output is correct
11 Correct 28 ms 12908 KB Output is correct
12 Correct 28 ms 12916 KB Output is correct
13 Correct 26 ms 12924 KB Output is correct
14 Correct 27 ms 13172 KB Output is correct
15 Correct 29 ms 13184 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12444 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 25 ms 11876 KB Output is correct
4 Correct 38 ms 13848 KB Output is correct
5 Correct 38 ms 13868 KB Output is correct
6 Correct 28 ms 12328 KB Output is correct
7 Correct 31 ms 12364 KB Output is correct
8 Correct 31 ms 13180 KB Output is correct
9 Correct 29 ms 13088 KB Output is correct
10 Correct 28 ms 12932 KB Output is correct
11 Correct 28 ms 12908 KB Output is correct
12 Correct 28 ms 12916 KB Output is correct
13 Correct 26 ms 12924 KB Output is correct
14 Correct 27 ms 13172 KB Output is correct
15 Correct 29 ms 13184 KB Output is correct
16 Correct 23 ms 11012 KB Output is correct
17 Correct 26 ms 10860 KB Output is correct
18 Correct 25 ms 10696 KB Output is correct
19 Correct 23 ms 10896 KB Output is correct
20 Correct 28 ms 11648 KB Output is correct
21 Correct 24 ms 11868 KB Output is correct
22 Correct 26 ms 13432 KB Output is correct
23 Correct 24 ms 11124 KB Output is correct
24 Correct 23 ms 11100 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1052 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 0 ms 1056 KB Output is correct
4 Correct 2 ms 1056 KB Output is correct
5 Correct 2 ms 1048 KB Output is correct
6 Correct 1 ms 1048 KB Output is correct
7 Correct 2 ms 1036 KB Output is correct
8 Correct 1 ms 1048 KB Output is correct
9 Correct 2 ms 1048 KB Output is correct
10 Correct 2 ms 1048 KB Output is correct
11 Correct 1 ms 1040 KB Output is correct
12 Correct 2 ms 1056 KB Output is correct
13 Correct 2 ms 1048 KB Output is correct
14 Correct 1 ms 1056 KB Output is correct
15 Correct 2 ms 1056 KB Output is correct
16 Correct 1 ms 1048 KB Output is correct
17 Correct 1 ms 1056 KB Output is correct
18 Correct 1 ms 1048 KB Output is correct
19 Correct 2 ms 1056 KB Output is correct
20 Correct 2 ms 1056 KB Output is correct
21 Correct 2 ms 1056 KB Output is correct
22 Correct 1 ms 1040 KB Output is correct
23 Correct 1 ms 1056 KB Output is correct
24 Correct 1 ms 1052 KB Output is correct
25 Correct 2 ms 1052 KB Output is correct
26 Correct 1 ms 1056 KB Output is correct
27 Correct 1 ms 1056 KB Output is correct
28 Correct 2 ms 1056 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 10688 KB Output is correct
2 Correct 26 ms 12152 KB Output is correct
3 Correct 0 ms 776 KB Output is correct
4 Correct 20 ms 10872 KB Output is correct
5 Correct 30 ms 13656 KB Output is correct
6 Correct 29 ms 13748 KB Output is correct
7 Correct 24 ms 12668 KB Output is correct
8 Correct 24 ms 12584 KB Output is correct
9 Correct 29 ms 13688 KB Output is correct
10 Correct 30 ms 13872 KB Output is correct
11 Correct 33 ms 13620 KB Output is correct
12 Correct 28 ms 13688 KB Output is correct
13 Correct 30 ms 13808 KB Output is correct
14 Correct 32 ms 13940 KB Output is correct
15 Correct 28 ms 13600 KB Output is correct
16 Correct 32 ms 13848 KB Output is correct
17 Correct 27 ms 13424 KB Output is correct
18 Correct 28 ms 13396 KB Output is correct
19 Correct 28 ms 13424 KB Output is correct
20 Correct 28 ms 13352 KB Output is correct
21 Correct 27 ms 13432 KB Output is correct
22 Correct 28 ms 13436 KB Output is correct
23 Correct 24 ms 10852 KB Output is correct
24 Correct 23 ms 10692 KB Output is correct
25 Correct 27 ms 11376 KB Output is correct
26 Correct 28 ms 12084 KB Output is correct
27 Correct 26 ms 12624 KB Output is correct
28 Correct 27 ms 12612 KB Output is correct
29 Correct 28 ms 12716 KB Output is correct
30 Correct 26 ms 12636 KB Output is correct
31 Correct 24 ms 11048 KB Output is correct
32 Correct 22 ms 11152 KB Output is correct
33 Correct 24 ms 11828 KB Output is correct
34 Correct 24 ms 11840 KB Output is correct
35 Correct 26 ms 12624 KB Output is correct
36 Correct 27 ms 12452 KB Output is correct
37 Correct 30 ms 12584 KB Output is correct
38 Correct 26 ms 12364 KB Output is correct
39 Correct 26 ms 12624 KB Output is correct
40 Correct 29 ms 12792 KB Output is correct
41 Correct 27 ms 13300 KB Output is correct
42 Correct 30 ms 13244 KB Output is correct
43 Correct 27 ms 13388 KB Output is correct
44 Correct 28 ms 13396 KB Output is correct
45 Correct 27 ms 13348 KB Output is correct
46 Correct 29 ms 13376 KB Output is correct
47 Correct 26 ms 12220 KB Output is correct
48 Correct 25 ms 12380 KB Output is correct
49 Correct 25 ms 12372 KB Output is correct
50 Correct 28 ms 12620 KB Output is correct
51 Correct 28 ms 11344 KB Output is correct
52 Correct 22 ms 11332 KB Output is correct
53 Correct 23 ms 11336 KB Output is correct
54 Correct 23 ms 11344 KB Output is correct
55 Correct 23 ms 11420 KB Output is correct
56 Correct 24 ms 11272 KB Output is correct
57 Correct 23 ms 11588 KB Output is correct
58 Correct 23 ms 11696 KB Output is correct
59 Correct 22 ms 11336 KB Output is correct
60 Correct 23 ms 11416 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 10696 KB Output is correct
2 Correct 25 ms 12112 KB Output is correct
3 Correct 1 ms 796 KB Output is correct
4 Correct 22 ms 10412 KB Output is correct
5 Correct 28 ms 13684 KB Output is correct
6 Correct 32 ms 13696 KB Output is correct
7 Correct 25 ms 12584 KB Output is correct
8 Correct 25 ms 12668 KB Output is correct
9 Correct 29 ms 13696 KB Output is correct
10 Correct 32 ms 13768 KB Output is correct
11 Correct 30 ms 13704 KB Output is correct
12 Correct 36 ms 13692 KB Output is correct
13 Correct 28 ms 13700 KB Output is correct
14 Correct 36 ms 13660 KB Output is correct
15 Correct 29 ms 13680 KB Output is correct
16 Correct 28 ms 13700 KB Output is correct
17 Correct 31 ms 13468 KB Output is correct
18 Correct 27 ms 13440 KB Output is correct
19 Correct 27 ms 13440 KB Output is correct
20 Correct 27 ms 13520 KB Output is correct
21 Correct 29 ms 13400 KB Output is correct
22 Correct 27 ms 13432 KB Output is correct
23 Correct 22 ms 10864 KB Output is correct
24 Correct 22 ms 11336 KB Output is correct
25 Correct 30 ms 11720 KB Output is correct
26 Correct 25 ms 11796 KB Output is correct
27 Correct 26 ms 12632 KB Output is correct
28 Correct 27 ms 12660 KB Output is correct
29 Correct 27 ms 12624 KB Output is correct
30 Correct 27 ms 12620 KB Output is correct
31 Correct 27 ms 11104 KB Output is correct
32 Correct 23 ms 11144 KB Output is correct
33 Correct 24 ms 11828 KB Output is correct
34 Correct 24 ms 11916 KB Output is correct
35 Correct 26 ms 12620 KB Output is correct
36 Correct 28 ms 12524 KB Output is correct
37 Correct 27 ms 12332 KB Output is correct
38 Correct 27 ms 12752 KB Output is correct
39 Correct 26 ms 12608 KB Output is correct
40 Correct 27 ms 12736 KB Output is correct
41 Correct 27 ms 13256 KB Output is correct
42 Correct 26 ms 13372 KB Output is correct
43 Correct 28 ms 13164 KB Output is correct
44 Correct 27 ms 13260 KB Output is correct
45 Correct 27 ms 13400 KB Output is correct
46 Correct 32 ms 13396 KB Output is correct
47 Correct 27 ms 12360 KB Output is correct
48 Correct 25 ms 12464 KB Output is correct
49 Correct 25 ms 12364 KB Output is correct
50 Correct 26 ms 12360 KB Output is correct
51 Correct 31 ms 11344 KB Output is correct
52 Correct 24 ms 11320 KB Output is correct
53 Correct 24 ms 11448 KB Output is correct
54 Correct 23 ms 11344 KB Output is correct
55 Correct 24 ms 11336 KB Output is correct
56 Correct 24 ms 11332 KB Output is correct
57 Correct 25 ms 11568 KB Output is correct
58 Correct 25 ms 11600 KB Output is correct
59 Correct 23 ms 11352 KB Output is correct
60 Correct 23 ms 11344 KB Output is correct