oj.uz

Submission #444866

# Submission time Handle Problem Language Result Execution time Memory
444866 2021-07-15T16:24:51 Z kig9981 Stray Cat (JOI20_stray) C++17
20 / 100
 73 ms 16372 KB 
#include "Anthony.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;
 
vector<pair<int,int>> adj[20000];
int dist[20000];
 
std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) {
	vector<int> X(M,-1);
	queue<pair<int,int>> Q;
	memset(dist,-1,sizeof(dist));
	for(int i=0;i<M;i++) {
		adj[U[i]].emplace_back(V[i],i);
		adj[V[i]].emplace_back(U[i],i);
	}
	dist[0]=0;
	for(auto[n,t]: adj[0]) {
		dist[n]=1; X[t]=0;
		Q.emplace(n,t);
	}
	while(!Q.empty()) {
		auto[c,p]=Q.front();
		Q.pop();
		for(auto[n,t]: adj[c]) {
			if(dist[n]==-1) {
				dist[n]=dist[c]+1;
				if(A==2) {
					if(X[p]>1) {
						if(adj[c].size()==2) X[t]=(X[p]-1)%6+2;
						else X[t]=!(X[p]==3 || X[p]==6 || X[p]==7);
					}
					else {
						if(adj[c].size()==2) X[t]=X[p]+3;
						else X[t]=X[p]^1;
					}
				}
				else X[t]=min(dist[c],dist[n])%3;
				Q.emplace(n,t);
			}
			else if(X[t]==-1) X[t]=min(dist[c],dist[n])%3;
		}
	}
	if(A==2) for(auto &p: X) p=p==1 || p==3 || p==6 || p==7;
	return X;
}
#include "Catherine.h"
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;
 
int A, r;
bool d;
string s;
 
void Init(int A, int B) {
	::A=A;
	r=-1; d=false; s="";
}
 
int Move(std::vector<int> y) {
	if(r!=-1) y[r]++;
	if(A==2) {
		if(d) {
			for(int i=0;i<2;i++) if(y[i]==0) return r=i^1;
			for(int i=0;i<2;i++) if(y[i]==1 && y[i]-(i==r)==1) return r=i;
		}
		else {
			if(y[0]+y[1]>2) {
				d=true;
				if(r!=-1 && --y[r]==0) return -1;
				else {
					for(int i=0;i<2;i++) if(y[i]==1 && y[i]+(i==r)==1) return r=i;
				}
			}
			if(y[0]+y[1]==1) {
				d=true;
				for(int i=0;i<2;i++) if(y[i]) {
					if(i==r) return -1;
					return r=i;
				}
			}
			if(s.size()==6) {
				d=true;
				for(int i=0;i<6;i++) {
					bool valid=true;
					for(int j=0;j<4;j++) valid&=s[(i+j)%6]=='1'-j/2;
					if(valid) {
						for(int i=0;i<2;i++) if(y[i]==1 && y[i]-(i==r)==1) return r=i;
					}
				}
				return -1;
			}
			if(r!=-1) y[r]--;
			for(int i=0;i<2;i++) if(y[i]) {
				s.push_back('0'+i);
				return r=i;
			}
		}
	}
	else {
		for(int i=0;i<3;i++) if(y[i]==0 && y[(i+1)%3]==0) return r=(i+2)%3;
		for(int i=0;i<3;i++) if(y[i]==0) return r=(i+1)%3;
	}
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15280 KB Output is correct
2 Correct 1 ms 1000 KB Output is correct
3 Correct 38 ms 14772 KB Output is correct
4 Correct 57 ms 16332 KB Output is correct
5 Correct 64 ms 16372 KB Output is correct
6 Correct 49 ms 15276 KB Output is correct
7 Correct 42 ms 15144 KB Output is correct
8 Correct 53 ms 15936 KB Output is correct
9 Correct 49 ms 15860 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15280 KB Output is correct
2 Correct 1 ms 1000 KB Output is correct
3 Correct 38 ms 14772 KB Output is correct
4 Correct 57 ms 16332 KB Output is correct
5 Correct 64 ms 16372 KB Output is correct
6 Correct 49 ms 15276 KB Output is correct
7 Correct 42 ms 15144 KB Output is correct
8 Correct 53 ms 15936 KB Output is correct
9 Correct 49 ms 15860 KB Output is correct
10 Correct 40 ms 13380 KB Output is correct
11 Correct 44 ms 13220 KB Output is correct
12 Correct 47 ms 13420 KB Output is correct
13 Correct 53 ms 13300 KB Output is correct
14 Correct 42 ms 13576 KB Output is correct
15 Correct 46 ms 13976 KB Output is correct
16 Correct 54 ms 16044 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 12960 KB Output is correct
2 Correct 1 ms 1128 KB Output is correct
3 Correct 45 ms 12620 KB Output is correct
4 Correct 73 ms 14272 KB Output is correct
5 Correct 53 ms 14164 KB Output is correct
6 Correct 41 ms 12972 KB Output is correct
7 Correct 41 ms 13012 KB Output is correct
8 Correct 62 ms 13652 KB Output is correct
9 Correct 51 ms 13584 KB Output is correct
10 Correct 57 ms 13340 KB Output is correct
11 Correct 48 ms 13388 KB Output is correct
12 Correct 45 ms 13288 KB Output is correct
13 Correct 46 ms 13408 KB Output is correct
14 Correct 63 ms 13720 KB Output is correct
15 Correct 54 ms 13592 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 12960 KB Output is correct
2 Correct 1 ms 1128 KB Output is correct
3 Correct 45 ms 12620 KB Output is correct
4 Correct 73 ms 14272 KB Output is correct
5 Correct 53 ms 14164 KB Output is correct
6 Correct 41 ms 12972 KB Output is correct
7 Correct 41 ms 13012 KB Output is correct
8 Correct 62 ms 13652 KB Output is correct
9 Correct 51 ms 13584 KB Output is correct
10 Correct 57 ms 13340 KB Output is correct
11 Correct 48 ms 13388 KB Output is correct
12 Correct 45 ms 13288 KB Output is correct
13 Correct 46 ms 13408 KB Output is correct
14 Correct 63 ms 13720 KB Output is correct
15 Correct 54 ms 13592 KB Output is correct
16 Correct 39 ms 11380 KB Output is correct
17 Correct 36 ms 11548 KB Output is correct
18 Correct 54 ms 11404 KB Output is correct
19 Correct 43 ms 11396 KB Output is correct
20 Correct 47 ms 12032 KB Output is correct
21 Correct 56 ms 11860 KB Output is correct
22 Correct 47 ms 13756 KB Output is correct
23 Correct 39 ms 11588 KB Output is correct
24 Correct 40 ms 11480 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1388 KB Output is correct
2 Correct 2 ms 1128 KB Output is correct
3 Correct 2 ms 1388 KB Output is correct
4 Correct 2 ms 1388 KB Output is correct
5 Correct 2 ms 1388 KB Output is correct
6 Correct 2 ms 1396 KB Output is correct
7 Correct 2 ms 1388 KB Output is correct
8 Correct 2 ms 1388 KB Output is correct
9 Correct 3 ms 1392 KB Output is correct
10 Correct 4 ms 1472 KB Output is correct
11 Correct 2 ms 1392 KB Output is correct
12 Correct 2 ms 1400 KB Output is correct
13 Correct 2 ms 1320 KB Output is correct
14 Correct 2 ms 1324 KB Output is correct
15 Correct 2 ms 1396 KB Output is correct
16 Correct 2 ms 1400 KB Output is correct
17 Correct 2 ms 1324 KB Output is correct
18 Correct 2 ms 1392 KB Output is correct
19 Correct 2 ms 1392 KB Output is correct
20 Correct 2 ms 1392 KB Output is correct
21 Correct 2 ms 1392 KB Output is correct
22 Correct 2 ms 1392 KB Output is correct
23 Correct 2 ms 1400 KB Output is correct
24 Correct 2 ms 1404 KB Output is correct
25 Correct 2 ms 1392 KB Output is correct
26 Correct 2 ms 1400 KB Output is correct
27 Correct 2 ms 1392 KB Output is correct
28 Correct 2 ms 1400 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 11048 KB Output is correct
2 Correct 46 ms 11584 KB Output is correct
3 Correct 1 ms 1000 KB Output is correct
4 Correct 33 ms 11124 KB Output is correct
5 Correct 49 ms 12156 KB Output is correct
6 Correct 49 ms 12160 KB Output is correct
7 Correct 40 ms 11868 KB Output is correct
8 Correct 41 ms 11892 KB Output is correct
9 Correct 52 ms 12728 KB Output is correct
10 Incorrect 37 ms 11764 KB Wrong Answer [5]
11 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 11080 KB Output is correct
2 Correct 41 ms 11336 KB Output is correct
3 Correct 1 ms 1136 KB Output is correct
4 Correct 33 ms 11068 KB Output is correct
5 Correct 56 ms 12148 KB Output is correct
6 Correct 48 ms 12184 KB Output is correct
7 Incorrect 37 ms 11832 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -