oj.uz

Submission #235263

# Submission time Handle Problem Language Result Execution time Memory
235263 2020-05-27T14:30:56 Z Goolakh Cop and Robber (BOI14_coprobber) C++17
100 / 100
 662 ms 7416 KB 
/// Be Kind :)
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Os")

/*				Bitch, where you when I was walkin'?
				Now I run the game, got the whole world talkin'				*/

/*				You never likes us anyway, fuck your friendship, I meant it */

/*				The Chanel or Balenciaga, Louis and Vuitton
				She know I got Fendi, Prada when I hit Milan				*/

/*				Niggas been counting me out
				I'm counting my bullets, I'm loading my clips
				I'm writing down names, I'm making a list					*/

/*				I ran away, I don't think I'm coming back home				*/

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()

typedef int ll;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=5e2+10, maxm=51, lg=23, mod=1e9+7, inf=1e18;

ll n,cur;
bool g[maxn][maxn],win[maxn][maxn];
ll cnt[maxn][maxn],nxt[maxn][maxn];
ll tg[maxn];

int start(int N,bool A[MAX_N][MAX_N]){
	n=N;
	for(int i=0;i<n;i++){
		tg[i]=0;
		for(int j=0;j<n;j++){
			g[i][j]=A[i][j];
			tg[i]+=g[i][j];
			cnt[i][j]=0;
		}
	}
	deque<pair<ll,pll>> q;
	for(int i=0;i<n;i++){
		q.pb({0,{i,i}});
		q.pb({1,{i,i}});
		win[i][i]=1;
	}
	while(!q.empty()){
		auto v=q.front(); q.pop_front();
		if(v.F==1){
			for(int i=0;i<n;i++)if(g[i][v.S.F] || i==v.S.F)if(!win[i][v.S.S]){
				win[i][v.S.S]=1;
				nxt[i][v.S.S]=v.S.F;
				q.pb({0,{i,v.S.S}});
			}
		}
		if(v.F==0){
			for(int i=0;i<n;i++)if(g[i][v.S.S]){
				cnt[v.S.F][i]++;
				if(cnt[v.S.F][i]==tg[i]) q.pb({1,{v.S.F,i}});
			}
		}
	}
	for(int i=0;i<n;i++)if(!win[0][i]) return -1;
	return 0;

}

int nextMove(int R){
	return cur=nxt[cur][R];
}

/*
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	
	
	return 0;
}
*/

Compilation message

coprobber.cpp:35:54: warning: overflow in implicit constant conversion [-Woverflow]
 const ll maxn=5e2+10, maxm=51, lg=23, mod=1e9+7, inf=1e18;
                                                      ^~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 337 ms 4320 KB Output is correct
5 Correct 53 ms 2176 KB Output is correct
6 Correct 405 ms 4472 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 367 ms 4280 KB Output is correct
4 Correct 330 ms 4344 KB Output is correct
5 Correct 355 ms 4216 KB Output is correct
6 Correct 377 ms 4216 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 6 ms 768 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 6 ms 768 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 12 ms 1280 KB Output is correct
18 Correct 7 ms 896 KB Output is correct
19 Correct 4 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 337 ms 4320 KB Output is correct
5 Correct 53 ms 2176 KB Output is correct
6 Correct 405 ms 4472 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 367 ms 4280 KB Output is correct
10 Correct 330 ms 4344 KB Output is correct
11 Correct 355 ms 4216 KB Output is correct
12 Correct 377 ms 4216 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 896 KB Output is correct
23 Correct 7 ms 896 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 6 ms 768 KB Output is correct
26 Correct 8 ms 896 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 12 ms 1280 KB Output is correct
30 Correct 7 ms 896 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 350 ms 4344 KB Output is correct
36 Correct 50 ms 2220 KB Output is correct
37 Correct 411 ms 4476 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 343 ms 4360 KB Output is correct
41 Correct 351 ms 4472 KB Output is correct
42 Correct 334 ms 4216 KB Output is correct
43 Correct 400 ms 4348 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 6 ms 896 KB Output is correct
49 Correct 7 ms 896 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 6 ms 768 KB Output is correct
52 Correct 9 ms 896 KB Output is correct
53 Correct 6 ms 768 KB Output is correct
54 Correct 6 ms 768 KB Output is correct
55 Correct 13 ms 1152 KB Output is correct
56 Correct 6 ms 896 KB Output is correct
57 Correct 11 ms 1536 KB Output is correct
58 Correct 23 ms 2560 KB Output is correct
59 Correct 38 ms 3064 KB Output is correct
60 Correct 503 ms 7416 KB Output is correct
61 Correct 109 ms 3840 KB Output is correct
62 Correct 116 ms 3964 KB Output is correct
63 Correct 587 ms 6176 KB Output is correct
64 Correct 138 ms 3704 KB Output is correct
65 Correct 612 ms 6972 KB Output is correct
66 Correct 353 ms 4856 KB Output is correct
67 Correct 662 ms 5868 KB Output is correct
68 Correct 330 ms 3456 KB Output is correct
69 Correct 5 ms 384 KB Output is correct