oj.uz

답안 #61732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61732 2018-07-26T13:11:01 Z tmwilliamlin168 경찰관과 강도 (BOI14_coprobber) C++11
100 / 100
 1196 ms 10276 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=500;
int as[mxN][mxN], qh, qt, p, f[mxN][mxN];
bool w[mxN][mxN][2];
array<int, 3> qu[mxN*mxN*2];

int start(int n, bool a[mxN][mxN]) {
	for(int i=0; i<n; ++i)
		for(int j=0; j<n; ++j)
			for(int k=0; k<n; ++k)
				as[k][i]+=a[i][j];
	qh=qt=0;
	for(int i=0; i<n; ++i) {
		for(int j=0; j<2; ++j) {
			w[i][i][j]=1;
			qu[qt++]={i, i, j};
		}
	}
	while(qh<qt) {
		array<int, 3> u=qu[qh++];
		for(int i=0; i<n; ++i) {
			if(u[2]&&(a[u[0]][i]||i==u[0])&&!w[i][u[1]][0]) {
				w[i][u[1]][0]=1;
				qu[qt++]={i, u[1], 0};
				f[i][u[1]]=u[0];
			} else if(!u[2]&&a[u[1]][i]&&!w[u[0]][i][1]&&--as[u[0]][i]<=0) {
				w[u[0]][i][1]=1;
				qu[qt++]={u[0], i, 1};
			}
		}
	}
	p=0;
	bool ok=1;
	for(int i=0; i<n&&ok; ++i)
		ok=w[0][i][0];
	return ok?0:-1;
}

int nextMove(int r) {
	return p=f[p][r];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 372 ms 10260 KB Output is correct
5 Correct 51 ms 3448 KB Output is correct
6 Correct 405 ms 10068 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 369 ms 9976 KB Output is correct
4 Correct 373 ms 10184 KB Output is correct
5 Correct 365 ms 9444 KB Output is correct
6 Correct 470 ms 9976 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 5 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 6 ms 1024 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 4 ms 768 KB Output is correct
17 Correct 12 ms 1408 KB Output is correct
18 Correct 4 ms 896 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 354 ms 10132 KB Output is correct
5 Correct 50 ms 3448 KB Output is correct
6 Correct 389 ms 9960 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 360 ms 9860 KB Output is correct
10 Correct 359 ms 10276 KB Output is correct
11 Correct 349 ms 9592 KB Output is correct
12 Correct 361 ms 10000 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 4 ms 896 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 11 ms 1408 KB Output is correct
25 Correct 4 ms 896 KB Output is correct
26 Correct 12 ms 1536 KB Output is correct
27 Correct 61 ms 2552 KB Output is correct
28 Correct 113 ms 3064 KB Output is correct
29 Correct 507 ms 9872 KB Output is correct
30 Correct 246 ms 3704 KB Output is correct
31 Correct 241 ms 4088 KB Output is correct
32 Correct 794 ms 10104 KB Output is correct
33 Correct 247 ms 4216 KB Output is correct
34 Correct 1196 ms 9996 KB Output is correct
35 Correct 385 ms 9308 KB Output is correct
36 Correct 1120 ms 10068 KB Output is correct
37 Correct 371 ms 5752 KB Output is correct
38 Correct 2 ms 384 KB Output is correct