Submission #944412

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
944412	2024-03-12T17:17:20 Z	Darren0724	Stray Cat (JOI20_stray)	C++17	0 / 100	33 ms	16148 KB

Anthony

#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
string str="001011";
const int N=20005;
vector<int> v,adj[N+1],deg(N),e(N);
const int INF=1e9;
void dfs(int k,int pa,int dis,int up){
	for(int i:adj[k]){
		int j=e[i]^k;
		if(j==pa)continue;
		if(deg[k]<=2){
			v[i]=str[dis%6]-'0';
		}
		else{
			v[i]=up^1;
		}
		dfs(j,k,dis+1,v[i]);
	}
}
vector<int> Mark(int N, int M, int A, int B,vector<int> U, vector<int> V) {
	v.resize(M,-1);
	queue<int> q;
  	vector<int> dis(N+1,INF);
	for(int i=0;i<M;i++){
		adj[U[i]].push_back(i);
		adj[V[i]].push_back(i);
		deg[U[i]]++;
		deg[V[i]]++;
		e[i]=U[i]^V[i];
	}
	dfs(0,0,0,0);
  	return v;
}

Catherine

#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
int last=-1,sure=0;
vector<int> tmp={0,0,1,0,1,1};
vector<int> rec;
void Init(int A, int B) {

}

int Move(vector<int> y) {
	if(sure){
		int tot=y[0]+y[1];
		if(min(y[0],y[1])==0){
			return last=(y[0]?0:1);
		}
		else{
			return last=last^1;
		}
	}

  	if(last==-1){
		int tot=y[0]+y[1];
		if(tot==1){
			sure=1;
			last=(y[0]?0:1);
			return last;
		}
		else if(tot==2){
			if(y[0]&&y[1]){
				rec.push_back(0);
				rec.push_back(1);
				return last=1;
			}
			else if(y[0]==2){
				rec.push_back(0);
				rec.push_back(0);
				return last=0;
			}
			else{
				rec.push_back(1);
				rec.push_back(1);
				return last=1;
			}
		}
		else{
			sure=1;
			last=(y[0]>y[1]?1:0);
			return last;
		}
	}
	else{
		int tot=y[0]+y[1];
		if(tot==0){
			sure=1;
			return -1;
		}
		else if(tot==1){
			rec.push_back((y[0]?0:1));
			if(rec.size()==5){
				int flag=0;
				for(int i=0;i<6;i++){
					vector<int> a(tmp.begin(),tmp.begin()+5);
					if(a==rec){
						flag=1;
						break;
					}
					rotate(tmp.begin(),tmp.begin()+1,tmp.end());
				}
				if(flag==0){
					sure=1;
					return last=(y[0]?0:1);
				}
				else{
					sure=1;
					return -1;				
				}
			}
			else{
				last=(y[0]?0:1);
				return last;
			}
		}
		else{
			y[last]++;
			if(y[0]==1){
				last=0;
				sure=1;
				return (last==0?-1:0);
			}
			else{
				last=1;
				sure=1;
				return (last==1?-1:1);
			}
		}
	}
	assert(false);
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:13:7: warning: unused variable 'tot' [-Wunused-variable]
   13 |   int tot=y[0]+y[1];
      |       ^~~

Subtask #1

0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	27 ms	16148 KB	Wrong Answer [6]
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	27 ms	16148 KB	Wrong Answer [6]
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	13948 KB	Output is correct
2	Correct	1 ms	1308 KB	Output is correct
3	Correct	22 ms	12932 KB	Output is correct
4	Correct	32 ms	15732 KB	Output is correct
5	Correct	33 ms	15688 KB	Output is correct
6	Incorrect	24 ms	13528 KB	Wrong Answer [6]
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	27 ms	13948 KB	Output is correct
2	Correct	1 ms	1308 KB	Output is correct
3	Correct	22 ms	12932 KB	Output is correct
4	Correct	32 ms	15732 KB	Output is correct
5	Correct	33 ms	15688 KB	Output is correct
6	Incorrect	24 ms	13528 KB	Wrong Answer [6]
7	Halted	0 ms	0 KB	-

Subtask #5

0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1560 KB	Output is correct
2	Correct	1 ms	1296 KB	Output is correct
3	Correct	1 ms	1572 KB	Output is correct
4	Correct	2 ms	1816 KB	Output is correct
5	Correct	2 ms	1816 KB	Output is correct
6	Correct	2 ms	1816 KB	Output is correct
7	Correct	2 ms	1816 KB	Output is correct
8	Correct	2 ms	1824 KB	Output is correct
9	Correct	2 ms	1824 KB	Output is correct
10	Correct	2 ms	1824 KB	Output is correct
11	Correct	2 ms	1816 KB	Output is correct
12	Correct	2 ms	1824 KB	Output is correct
13	Correct	2 ms	1820 KB	Output is correct
14	Correct	2 ms	1824 KB	Output is correct
15	Correct	2 ms	1824 KB	Output is correct
16	Correct	1 ms	1568 KB	Output is correct
17	Correct	2 ms	1756 KB	Output is correct
18	Correct	2 ms	1560 KB	Output is correct
19	Correct	1 ms	1568 KB	Output is correct
20	Correct	2 ms	1560 KB	Output is correct
21	Incorrect	2 ms	1560 KB	Wrong Answer [5]
22	Halted	0 ms	0 KB	-

Subtask #6

0 / 71.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	11388 KB	Output is correct
2	Incorrect	24 ms	12152 KB	Wrong Answer [5]
3	Halted	0 ms	0 KB	-

Subtask #7

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	11372 KB	Output is correct
2	Correct	28 ms	12328 KB	Output is correct
3	Correct	1 ms	1312 KB	Output is correct
4	Correct	20 ms	11388 KB	Output is correct
5	Correct	31 ms	14076 KB	Output is correct
6	Correct	30 ms	14048 KB	Output is correct
7	Correct	26 ms	13180 KB	Output is correct
8	Correct	26 ms	13180 KB	Output is correct
9	Correct	31 ms	14128 KB	Output is correct
10	Correct	31 ms	14200 KB	Output is correct
11	Correct	30 ms	14208 KB	Output is correct
12	Correct	32 ms	14396 KB	Output is correct
13	Correct	30 ms	14212 KB	Output is correct
14	Correct	30 ms	14192 KB	Output is correct
15	Correct	30 ms	14204 KB	Output is correct
16	Correct	30 ms	14216 KB	Output is correct
17	Correct	28 ms	13956 KB	Output is correct
18	Correct	30 ms	13940 KB	Output is correct
19	Correct	28 ms	13940 KB	Output is correct
20	Correct	28 ms	13876 KB	Output is correct
21	Correct	28 ms	13904 KB	Output is correct
22	Correct	30 ms	13932 KB	Output is correct
23	Correct	24 ms	11392 KB	Output is correct
24	Correct	24 ms	11220 KB	Output is correct
25	Correct	26 ms	12144 KB	Output is correct
26	Correct	25 ms	11900 KB	Output is correct
27	Correct	27 ms	12668 KB	Output is correct
28	Correct	27 ms	12660 KB	Output is correct
29	Correct	28 ms	12848 KB	Output is correct
30	Correct	27 ms	12660 KB	Output is correct
31	Correct	24 ms	11328 KB	Output is correct
32	Correct	24 ms	11376 KB	Output is correct
33	Correct	25 ms	11900 KB	Output is correct
34	Correct	25 ms	11904 KB	Output is correct
35	Correct	27 ms	12680 KB	Output is correct
36	Correct	27 ms	12664 KB	Output is correct
37	Correct	27 ms	12676 KB	Output is correct
38	Correct	27 ms	12592 KB	Output is correct
39	Correct	30 ms	12668 KB	Output is correct
40	Correct	27 ms	12668 KB	Output is correct
41	Correct	28 ms	13428 KB	Output is correct
42	Correct	27 ms	13432 KB	Output is correct
43	Correct	28 ms	13444 KB	Output is correct
44	Correct	28 ms	13428 KB	Output is correct
45	Correct	33 ms	13304 KB	Output is correct
46	Correct	27 ms	13428 KB	Output is correct
47	Correct	27 ms	12412 KB	Output is correct
48	Correct	27 ms	12408 KB	Output is correct
49	Incorrect	25 ms	12216 KB	Wrong Answer [5]
50	Halted	0 ms	0 KB	-