oj.uz

답안 #233515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233515 2020-05-20T19:14:06 Z thecodingwizard 경찰관과 강도 (BOI14_coprobber) C++11
100 / 100
 579 ms 7184 KB 
#include <bits/stdc++.h>
using namespace std;

#include "coprobber.h"

#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b)
#define ii pair<int, int>
#define pA first
#define pB second

int n;
bool adj[500][500];
int ct[500][500];
int nextStep[500][500];
bool win[500][500];
int adjCt[500];
int curPos = 0;

int start(int N, bool A[MAX_N][MAX_N])
{
    n = N;
    F0R(i, n) {
        adjCt[i] = 0;
        F0R(j, n) {
            adj[i][j] = A[i][j];
            if (A[i][j]) adjCt[i]++;
            ct[i][j] = 0;
        }
    }

    queue<pair<int, ii>> q;
    F0R(i, n) {
        q.push({0,{i,i}});
        q.push({1,{i,i}});
        win[i][i] = true;
    }
    while (!q.empty()) {
        pair<int, ii> u = q.front(); q.pop();
        if (u.pA == 1) {
            // am robber
            F0R(i, n) {
                if (adj[i][u.pB.pA] || i==u.pB.pA) {
                    if (!win[i][u.pB.pB]) {
                        win[i][u.pB.pB] = true;
                        nextStep[i][u.pB.pB] = u.pB.pA;
                        q.push({0,{i,u.pB.pB}});
                    }
                }
            }
        } else {
            // am cop
            F0R(i, n) {
                if (adj[i][u.pB.pB]) {
                    ct[u.pB.pA][i]++;
                    if (ct[u.pB.pA][i] == adjCt[i]) {
                        q.push({1,{u.pB.pA,i}});
                    }
                }
            }
        }
    }
    F0R(i, n) {
        if (!win[0][i]) return -1;
    }

    return 0;
}

int nextMove(int R)
{
    return curPos = nextStep[curPos][R];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 346 ms 4216 KB Output is correct
5 Correct 50 ms 2296 KB Output is correct
6 Correct 365 ms 4472 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 345 ms 4312 KB Output is correct
4 Correct 355 ms 4356 KB Output is correct
5 Correct 326 ms 4248 KB Output is correct
6 Correct 367 ms 4088 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 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 1152 KB Output is correct
18 Correct 6 ms 896 KB Output is correct
19 Correct 4 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 346 ms 4216 KB Output is correct
5 Correct 50 ms 2296 KB Output is correct
6 Correct 365 ms 4472 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 345 ms 4312 KB Output is correct
10 Correct 355 ms 4356 KB Output is correct
11 Correct 326 ms 4248 KB Output is correct
12 Correct 367 ms 4088 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 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 1152 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 345 ms 4216 KB Output is correct
36 Correct 53 ms 2304 KB Output is correct
37 Correct 365 ms 4472 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 349 ms 4152 KB Output is correct
41 Correct 346 ms 4272 KB Output is correct
42 Correct 325 ms 4392 KB Output is correct
43 Correct 371 ms 4088 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 4 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 5 ms 768 KB Output is correct
52 Correct 7 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 11 ms 1152 KB Output is correct
56 Correct 6 ms 896 KB Output is correct
57 Correct 9 ms 1408 KB Output is correct
58 Correct 22 ms 2560 KB Output is correct
59 Correct 35 ms 3100 KB Output is correct
60 Correct 460 ms 7184 KB Output is correct
61 Correct 87 ms 3704 KB Output is correct
62 Correct 86 ms 3832 KB Output is correct
63 Correct 544 ms 5996 KB Output is correct
64 Correct 116 ms 3704 KB Output is correct
65 Correct 571 ms 6964 KB Output is correct
66 Correct 343 ms 4728 KB Output is correct
67 Correct 579 ms 5776 KB Output is correct
68 Correct 264 ms 3448 KB Output is correct
69 Correct 4 ms 384 KB Output is correct