oj.uz

Submission #446399

# Submission time Handle Problem Language Result Execution time Memory
446399 2021-07-21T20:46:33 Z cheetose Stray Cat (JOI20_stray) C++17
15 / 100
 57 ms 16132 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };


#include "Anthony.h"
Vi Mark(int N, int M, int A, int B, Vi U, Vi V){
	vector<Vi> v(N);
	fup(i,0,M-1,1){
		v[U[i]].pb(V[i]);
		v[V[i]].pb(U[i]);
	}
	Vi res(M),c(N);
	Vi d(N,-1);
	queue<int> q;
	q.push(0);
	d[0]=0;
	while(!q.empty()){
		int x=q.front();
		q.pop();
		for(int y:v[x]){
			if(d[y]==-1){
				d[y]=d[x]+1;
				q.push(y);
				if(A==2){
					if(x==0)c[y]=0;
					else if(v[x].size()>2)c[y]="010011"[c[x]]=='0'?1:0;
					else c[y]=(c[x]+1)%6;
				}
			}
		}
	}
	if(A==2){
		fup(i,0,M-1,1){
			int t=d[U[i]]>d[V[i]]?U[i]:V[i];
			res[i]="010011"[c[t]]-'0';
		}
	}else{
		fup(i,0,M-1,1){
			int t=min(d[U[i]],d[V[i]]);
			res[i]=t%3;
		}
	}
	
	return res;
}
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

#include "Catherine.h"

int a,b;
int pr=-1;
bool ok;
string s;
void Init(int A,int B){
	a=A,b=B;
}

int Move(Vi y){
	if(a==2){
		if(ok){
			if(y[0]==1)return 0;
			return 1;
		}
		Vi yy=y;
		if(pr!=-1)yy[pr]++;
		int deg=yy[0]+yy[1];
		if(deg!=2){
			ok=1;
			int r;
			if(yy[0]==1)r=0;
			else r=1;
			if(r==pr)r=-1;
			return r;
		}
		fup(i,0,1,1){
			fup(k,0,y[i]-1,1)s+=(char)(i+'0');
		}
		if(s.length()==5){
			ok=1;
			fup(i,0,5,1){
				if(s==string("010011010011").substr(i,5)){
					return -1;
				}
			}
			if(y[0]==1)return 0;
			return 1;
		}
		int r=(int)(s.back()-'0');
		pr=r;
		return r;
	}else{
		if(y[0]==0 && y[1]==0)return 2;
		if(y[0]==0 && y[2]==0)return 1;
		if(y[1]==0 && y[2]==0)return 0;
		fup(j,0,2,1)if(y[j]==0)return (j+1)%3;
		return -1;
	}
}

Compilation message

Anthony.cpp: In function 'Vi Mark(int, int, int, int, Vi, Vi)':
Anthony.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Anthony.cpp:47:2: note: in expansion of macro 'fup'
   47 |  fup(i,0,M-1,1){
      |  ^~~
Anthony.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Anthony.cpp:72:3: note: in expansion of macro 'fup'
   72 |   fup(i,0,M-1,1){
      |   ^~~
Anthony.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Anthony.cpp:77:3: note: in expansion of macro 'fup'
   77 |   fup(i,0,M-1,1){
      |   ^~~

Catherine.cpp: In function 'int Move(Vi)':
Catherine.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Catherine.cpp:70:3: note: in expansion of macro 'fup'
   70 |   fup(i,0,1,1){
      |   ^~~
Catherine.cpp:10:30: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Catherine.cpp:71:4: note: in expansion of macro 'fup'
   71 |    fup(k,0,y[i]-1,1)s+=(char)(i+'0');
      |    ^~~
Catherine.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Catherine.cpp:75:4: note: in expansion of macro 'fup'
   75 |    fup(i,0,5,1){
      |    ^~~
Catherine.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
Catherine.cpp:90:3: note: in expansion of macro 'fup'
   90 |   fup(j,0,2,1)if(y[j]==0)return (j+1)%3;
      |   ^~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 14892 KB Output is correct
2 Correct 0 ms 492 KB Output is correct
3 Correct 44 ms 14408 KB Output is correct
4 Correct 56 ms 16128 KB Output is correct
5 Correct 56 ms 16132 KB Output is correct
6 Correct 52 ms 14896 KB Output is correct
7 Correct 57 ms 14736 KB Output is correct
8 Correct 53 ms 15516 KB Output is correct
9 Correct 53 ms 15592 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 14892 KB Output is correct
2 Correct 0 ms 492 KB Output is correct
3 Correct 44 ms 14408 KB Output is correct
4 Correct 56 ms 16128 KB Output is correct
5 Correct 56 ms 16132 KB Output is correct
6 Correct 52 ms 14896 KB Output is correct
7 Correct 57 ms 14736 KB Output is correct
8 Correct 53 ms 15516 KB Output is correct
9 Correct 53 ms 15592 KB Output is correct
10 Correct 44 ms 12800 KB Output is correct
11 Correct 41 ms 12828 KB Output is correct
12 Correct 43 ms 12760 KB Output is correct
13 Correct 39 ms 12792 KB Output is correct
14 Correct 42 ms 13100 KB Output is correct
15 Correct 54 ms 13448 KB Output is correct
16 Correct 51 ms 15600 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 12664 KB Output is correct
2 Correct 0 ms 492 KB Output is correct
3 Correct 36 ms 12164 KB Output is correct
4 Correct 53 ms 13868 KB Output is correct
5 Correct 54 ms 13932 KB Output is correct
6 Correct 47 ms 12548 KB Output is correct
7 Correct 42 ms 12516 KB Output is correct
8 Correct 51 ms 13244 KB Output is correct
9 Correct 48 ms 13244 KB Output is correct
10 Correct 47 ms 12956 KB Output is correct
11 Correct 50 ms 13008 KB Output is correct
12 Correct 47 ms 13124 KB Output is correct
13 Correct 45 ms 13000 KB Output is correct
14 Correct 49 ms 13200 KB Output is correct
15 Correct 49 ms 13220 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 12664 KB Output is correct
2 Correct 0 ms 492 KB Output is correct
3 Correct 36 ms 12164 KB Output is correct
4 Correct 53 ms 13868 KB Output is correct
5 Correct 54 ms 13932 KB Output is correct
6 Correct 47 ms 12548 KB Output is correct
7 Correct 42 ms 12516 KB Output is correct
8 Correct 51 ms 13244 KB Output is correct
9 Correct 48 ms 13244 KB Output is correct
10 Correct 47 ms 12956 KB Output is correct
11 Correct 50 ms 13008 KB Output is correct
12 Correct 47 ms 13124 KB Output is correct
13 Correct 45 ms 13000 KB Output is correct
14 Correct 49 ms 13200 KB Output is correct
15 Correct 49 ms 13220 KB Output is correct
16 Correct 37 ms 10936 KB Output is correct
17 Correct 38 ms 11044 KB Output is correct
18 Correct 42 ms 10896 KB Output is correct
19 Correct 41 ms 10956 KB Output is correct
20 Correct 43 ms 11408 KB Output is correct
21 Correct 43 ms 11316 KB Output is correct
22 Correct 50 ms 13388 KB Output is correct
23 Correct 38 ms 11076 KB Output is correct
24 Correct 39 ms 11088 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 872 KB Output is correct
2 Correct 0 ms 484 KB Output is correct
3 Correct 2 ms 872 KB Output is correct
4 Correct 2 ms 872 KB Output is correct
5 Correct 2 ms 876 KB Output is correct
6 Correct 2 ms 872 KB Output is correct
7 Correct 2 ms 872 KB Output is correct
8 Correct 2 ms 872 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 2 ms 872 KB Output is correct
11 Correct 2 ms 928 KB Output is correct
12 Incorrect 2 ms 872 KB Wrong Answer [5]
13 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 10856 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 10684 KB Output is correct
2 Incorrect 36 ms 10888 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -