oj.uz

답안 #386779

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386779 2021-04-07T09:44:37 Z talant117408 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 673 ms 7660 KB 
#include "coprobber.h"
//~ #include "grader.cpp"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef tuple <int, int, int> Position;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

const int COP = 0, ROBBER = 1;
int leftToWin[2][MAX_N][MAX_N], nxtPos[MAX_N][MAX_N];

int start(int N, bool A[MAX_N][MAX_N]) {
	for (int i = 0; i < N; i++) {
		int degree = count(A[i], A[i]+N, true);
		for (int j = 0; j < N; j++) {
			if (j != i) {
				leftToWin[COP][j][i] = 1;
				leftToWin[ROBBER][j][i] = degree;
			}
		}
	}
	queue <Position> K;
	for (int i = 0; i < N; i++) {
		K.push(Position(COP, i, i));
		K.push(Position(ROBBER, i, i));
	}
	
	int cnt = 0;
	while (!K.empty()) {
		int t, c, r;
		tie(t, c, r) = K.front(); K.pop();
		cnt++;
		if (t == COP) {
			for (int j = 0; j < N; j++) {
				if (A[r][j] && leftToWin[ROBBER][c][j]) {
					leftToWin[ROBBER][c][j]--;
					if (leftToWin[ROBBER][c][j] == 0) {
						K.push(Position(ROBBER, c, j));
					}
				}
			}
		}
		else {
			for (int j = 0; j < N; j++) {
				if ((j == c || A[c][j]) && leftToWin[COP][j][r]) {
					leftToWin[COP][j][r] = 0;
					K.push(Position(COP, j, r));
					nxtPos[j][r] = c;
				}
			}
		}
	}
	
    return cnt == 2*N*N ? 0 : -1;
}

int cop;

int nextMove(int R) {
	cop = nxtPos[cop][R];
    return cop;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 344 ms 4676 KB Output is correct
5 Correct 50 ms 2412 KB Output is correct
6 Correct 350 ms 4972 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 325 ms 4844 KB Output is correct
4 Correct 332 ms 4716 KB Output is correct
5 Correct 315 ms 4716 KB Output is correct
6 Correct 343 ms 4588 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 2 ms 1004 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 4 ms 1004 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 8 ms 1260 KB Output is correct
18 Correct 2 ms 1004 KB Output is correct
19 Correct 1 ms 364 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 344 ms 4676 KB Output is correct
5 Correct 50 ms 2412 KB Output is correct
6 Correct 350 ms 4972 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 325 ms 4844 KB Output is correct
10 Correct 332 ms 4716 KB Output is correct
11 Correct 315 ms 4716 KB Output is correct
12 Correct 343 ms 4588 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 2 ms 1004 KB Output is correct
23 Correct 4 ms 1004 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 4 ms 1004 KB Output is correct
27 Correct 2 ms 748 KB Output is correct
28 Correct 2 ms 748 KB Output is correct
29 Correct 8 ms 1260 KB Output is correct
30 Correct 2 ms 1004 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 327 ms 4768 KB Output is correct
36 Correct 52 ms 2412 KB Output is correct
37 Correct 373 ms 5100 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 330 ms 4764 KB Output is correct
41 Correct 339 ms 4716 KB Output is correct
42 Correct 320 ms 4716 KB Output is correct
43 Correct 342 ms 4560 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 2 ms 492 KB Output is correct
48 Correct 3 ms 1020 KB Output is correct
49 Correct 4 ms 1004 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 2 ms 748 KB Output is correct
52 Correct 4 ms 1004 KB Output is correct
53 Correct 2 ms 748 KB Output is correct
54 Correct 3 ms 748 KB Output is correct
55 Correct 8 ms 1260 KB Output is correct
56 Correct 2 ms 1004 KB Output is correct
57 Correct 6 ms 1644 KB Output is correct
58 Correct 20 ms 2924 KB Output is correct
59 Correct 32 ms 3564 KB Output is correct
60 Correct 406 ms 7660 KB Output is correct
61 Correct 106 ms 4332 KB Output is correct
62 Correct 126 ms 4416 KB Output is correct
63 Correct 447 ms 6708 KB Output is correct
64 Correct 122 ms 4076 KB Output is correct
65 Correct 535 ms 7312 KB Output is correct
66 Correct 332 ms 5324 KB Output is correct
67 Correct 673 ms 6340 KB Output is correct
68 Correct 279 ms 3948 KB Output is correct
69 Correct 2 ms 364 KB Output is correct