oj.uz

Submission #248678

# Submission time Handle Problem Language Result Execution time Memory
248678 2020-07-13T05:28:03 Z kshitij_sodani Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1085 ms 30084 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#include "coprobber.h"

#define MAX_N 500

//#include "coprobber.h"
vector<int> adj[500*500*2];
vector<int> adj2[500*500*2];
int vis[500*500*2];
int back[500*500*2];

int co[500*500*2];
//i*j+n*n*k,k=0 if police,i police turn,j robber
int cur=0;
int n;
int start(int nn, bool aa[MAX_N][MAX_N]){
	n=nn;

	/*for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			adj[i*n+j].pb(n*n+i*n+j);
			adj2[n*n+i*n+j].pb(i*n+j);
			for(int k=0;k<n;k++){
				if(aa[i][k]){
					adj[i*n+j].pb(k*n+j+n*n);
					adj2[k*n+j+n*n].pb(i*n+j);
				}
			}
		}
	}*/
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){			
			for(int k=0;k<n;k++){
				if(aa[j][k]){
					co[i*n+j+n*n]+=1;
					/*adj[i*n+j+n*n].pb(i*n+k);
					adj2[i*n+k].pb(i*n+j+n*n);*/
				}
			}
		}
	}
	queue<int> ss;
	for(int i=0;i<n;i++){
		vis[i*n+i]=1;
		ss.push(i*n+i);
		vis[n*n+i*n+i]=1;
		ss.push(n*n+i*n+i);
	}
	while(ss.size()){
		int no=ss.front();
		ss.pop();
		if(no<n*n){
			int i=no/n;
			int j=no%n;
			for(int k=0;k<n;k++){
				if(aa[j][k]){
					if(vis[i*n+k+n*n]==0){
						co[i*n+k+n*n]-=1;
						if(co[i*n+k+n*n]==0){
							vis[i*n+k+n*n]=1;
							ss.push(i*n+k+n*n);
						}
					}
				}
			}
		}
		else{
			int i=no/n-n;
			int j=no%n;
			for(int k=0;k<n;k++){
				if(aa[i][k]){
					if(vis[k*n+j]==0){
						vis[k*n+j]=1;
						ss.push(k*n+j);
						back[k*n+j]=no;
					}
				}
			}
			int kk=no-n*n;
			if(vis[kk]==0){
				vis[kk]=1;
				back[kk]=no;
				ss.push(kk);
			}

		}
	}



	for(int i=0;i<n;i++){
		int st=1;
		for(int j=0;j<n;j++){
			if(vis[i*n+j]==0){
				st=0;
			}
		}
		if(st){
			cur=i;
		//	cout<<i<<endl;
			return i;
		}
	}
	return -1;
}

int nextMove(int rr){
//	cout<<back[cur*n+rr]<<endl;
	cur=back[cur*n+rr]/n-n;

    return cur;
}

/*
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);


	return 0;
}*/

/*
g++  -o aa -O2 aa.cpp grader.cpp -std=c++14
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 12 ms 23808 KB Output is correct
3 Correct 12 ms 23808 KB Output is correct
4 Correct 449 ms 29304 KB Output is correct
5 Correct 72 ms 25336 KB Output is correct
6 Correct 487 ms 29176 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 13 ms 23808 KB Output is correct
3 Correct 473 ms 29048 KB Output is correct
4 Correct 475 ms 29176 KB Output is correct
5 Correct 441 ms 28920 KB Output is correct
6 Correct 487 ms 29048 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 13 ms 23808 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 12 ms 23808 KB Output is correct
6 Correct 12 ms 23808 KB Output is correct
7 Correct 13 ms 23808 KB Output is correct
8 Correct 14 ms 23808 KB Output is correct
9 Correct 13 ms 23808 KB Output is correct
10 Correct 16 ms 24064 KB Output is correct
11 Correct 19 ms 24064 KB Output is correct
12 Correct 13 ms 23808 KB Output is correct
13 Correct 14 ms 23936 KB Output is correct
14 Correct 20 ms 24064 KB Output is correct
15 Correct 20 ms 23936 KB Output is correct
16 Correct 14 ms 23936 KB Output is correct
17 Correct 23 ms 24312 KB Output is correct
18 Correct 16 ms 24064 KB Output is correct
19 Correct 13 ms 23808 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 12 ms 23808 KB Output is correct
3 Correct 12 ms 23808 KB Output is correct
4 Correct 449 ms 29304 KB Output is correct
5 Correct 72 ms 25336 KB Output is correct
6 Correct 487 ms 29176 KB Output is correct
7 Correct 12 ms 23808 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 473 ms 29048 KB Output is correct
10 Correct 475 ms 29176 KB Output is correct
11 Correct 441 ms 28920 KB Output is correct
12 Correct 487 ms 29048 KB Output is correct
13 Correct 12 ms 23808 KB Output is correct
14 Correct 13 ms 23808 KB Output is correct
15 Correct 13 ms 23808 KB Output is correct
16 Correct 13 ms 23808 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 12 ms 23808 KB Output is correct
19 Correct 13 ms 23808 KB Output is correct
20 Correct 14 ms 23808 KB Output is correct
21 Correct 13 ms 23808 KB Output is correct
22 Correct 16 ms 24064 KB Output is correct
23 Correct 19 ms 24064 KB Output is correct
24 Correct 13 ms 23808 KB Output is correct
25 Correct 14 ms 23936 KB Output is correct
26 Correct 20 ms 24064 KB Output is correct
27 Correct 20 ms 23936 KB Output is correct
28 Correct 14 ms 23936 KB Output is correct
29 Correct 23 ms 24312 KB Output is correct
30 Correct 16 ms 24064 KB Output is correct
31 Correct 13 ms 23808 KB Output is correct
32 Correct 12 ms 23808 KB Output is correct
33 Correct 14 ms 23808 KB Output is correct
34 Correct 14 ms 23808 KB Output is correct
35 Correct 495 ms 29172 KB Output is correct
36 Correct 75 ms 25336 KB Output is correct
37 Correct 469 ms 29164 KB Output is correct
38 Correct 13 ms 23800 KB Output is correct
39 Correct 13 ms 23808 KB Output is correct
40 Correct 469 ms 29052 KB Output is correct
41 Correct 457 ms 29304 KB Output is correct
42 Correct 452 ms 28792 KB Output is correct
43 Correct 482 ms 28980 KB Output is correct
44 Correct 13 ms 23808 KB Output is correct
45 Correct 13 ms 23808 KB Output is correct
46 Correct 13 ms 23808 KB Output is correct
47 Correct 13 ms 23808 KB Output is correct
48 Correct 16 ms 24064 KB Output is correct
49 Correct 19 ms 24064 KB Output is correct
50 Correct 13 ms 23808 KB Output is correct
51 Correct 15 ms 23936 KB Output is correct
52 Correct 18 ms 24064 KB Output is correct
53 Correct 19 ms 23936 KB Output is correct
54 Correct 14 ms 23936 KB Output is correct
55 Correct 24 ms 24312 KB Output is correct
56 Correct 15 ms 24064 KB Output is correct
57 Correct 31 ms 24568 KB Output is correct
58 Correct 124 ms 26676 KB Output is correct
59 Correct 230 ms 28024 KB Output is correct
60 Correct 788 ms 30084 KB Output is correct
61 Correct 603 ms 27640 KB Output is correct
62 Correct 649 ms 28284 KB Output is correct
63 Correct 728 ms 29560 KB Output is correct
64 Correct 398 ms 28280 KB Output is correct
65 Correct 1033 ms 29860 KB Output is correct
66 Correct 471 ms 28920 KB Output is correct
67 Correct 1085 ms 29560 KB Output is correct
68 Correct 562 ms 28152 KB Output is correct
69 Correct 12 ms 23808 KB Output is correct