oj.uz

Submission #944364

# Submission time Handle Problem Language Result Execution time Memory
944364 2024-03-12T15:53:38 Z Darren0724 Stray Cat (JOI20_stray) C++17
0 / 100
 43 ms 16244 KB 
#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;
}

#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(tot==1){
			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){
					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);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13784 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 22 ms 12852 KB Output is correct
4 Correct 43 ms 15712 KB Output is correct
5 Incorrect 30 ms 14632 KB Wrong Answer [5]
6 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13784 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 22 ms 12852 KB Output is correct
4 Correct 43 ms 15712 KB Output is correct
5 Incorrect 30 ms 14632 KB Wrong Answer [5]
6 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1564 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 2 ms 1572 KB Output is correct
4 Correct 2 ms 1808 KB Output is correct
5 Correct 2 ms 1816 KB Output is correct
6 Incorrect 2 ms 2012 KB Wrong Answer [5]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11372 KB Output is correct
2 Incorrect 24 ms 12148 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 11380 KB Output is correct
2 Correct 26 ms 12420 KB Output is correct
3 Correct 1 ms 1312 KB Output is correct
4 Correct 22 ms 11564 KB Output is correct
5 Correct 36 ms 14644 KB Output is correct
6 Correct 30 ms 14760 KB Output is correct
7 Incorrect 28 ms 13816 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -