oj.uz

답안 #302392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302392 2020-09-18T16:17:02 Z dantoh000 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 1378 ms 8104 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
typedef tuple<int,int,int> iii;
bool state[505][505][2];
int num[505][505];
int ct[505];
int G[505][505];
int pa[505][505];
int st = -1;
queue<iii> Q;
int start(int N, bool A[MAX_N][MAX_N])
{
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            G[i][j] = A[i][j];
            ct[i] += G[i][j];
        }
        state[i][i][0] = state[i][i][1] = 1;
        pa[i][i] = -1;
        Q.emplace(i,i,0);
        Q.emplace(i,i,1);
    }
    while (Q.size()){
        int x, y, flag;
        tie(x,y,flag) = Q.front(); Q.pop();
        if (flag){
            for (int i = 0; i < N; i++){
                if (G[x][i] || i==x){
                    if (state[i][y][0]) continue;
                    pa[i][y] = x;
                    state[i][y][0] = true;
                    Q.emplace(i,y,0);
                }
            }
        }
        else{
            for (int i = 0; i < N; i++){
                if (G[i][y]){
                    num[x][i]++;
                    if (num[x][i] == ct[i]){
                        state[x][i][1] = true;
                        Q.emplace(x,i,1);
                    }
                }
            }
        }
    }
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            if (state[i][j][0] == false) break;
            if (j == N-1) st = i;
        }
    }
    return st;
}
int nextMove(int R)
{
    return st = pa[st][R];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 876 ms 5208 KB Output is correct
5 Correct 108 ms 2808 KB Output is correct
6 Correct 933 ms 5528 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 859 ms 5368 KB Output is correct
4 Correct 885 ms 5340 KB Output is correct
5 Correct 815 ms 5240 KB Output is correct
6 Correct 897 ms 5112 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 876 ms 5208 KB Output is correct
5 Correct 108 ms 2808 KB Output is correct
6 Correct 933 ms 5528 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 859 ms 5368 KB Output is correct
10 Correct 885 ms 5340 KB Output is correct
11 Correct 815 ms 5240 KB Output is correct
12 Correct 897 ms 5112 KB Output is correct
13 Correct 0 ms 416 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 2 ms 1024 KB Output is correct
23 Correct 5 ms 1152 KB Output is correct
24 Correct 1 ms 544 KB Output is correct
25 Correct 2 ms 928 KB Output is correct
26 Correct 6 ms 1152 KB Output is correct
27 Correct 3 ms 896 KB Output is correct
28 Correct 3 ms 896 KB Output is correct
29 Correct 13 ms 1408 KB Output is correct
30 Correct 2 ms 1024 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 404 KB Output is correct
35 Correct 893 ms 5204 KB Output is correct
36 Correct 107 ms 2680 KB Output is correct
37 Correct 923 ms 5504 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 853 ms 5304 KB Output is correct
41 Correct 874 ms 5240 KB Output is correct
42 Correct 818 ms 5252 KB Output is correct
43 Correct 890 ms 5204 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 1 ms 512 KB Output is correct
48 Correct 2 ms 1024 KB Output is correct
49 Correct 5 ms 1152 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 3 ms 896 KB Output is correct
52 Correct 7 ms 1056 KB Output is correct
53 Correct 3 ms 896 KB Output is correct
54 Correct 3 ms 896 KB Output is correct
55 Correct 13 ms 1408 KB Output is correct
56 Correct 2 ms 1024 KB Output is correct
57 Correct 7 ms 1792 KB Output is correct
58 Correct 23 ms 3328 KB Output is correct
59 Correct 40 ms 4096 KB Output is correct
60 Correct 1320 ms 8104 KB Output is correct
61 Correct 192 ms 4728 KB Output is correct
62 Correct 208 ms 4864 KB Output is correct
63 Correct 1343 ms 7256 KB Output is correct
64 Correct 250 ms 4764 KB Output is correct
65 Correct 1378 ms 7980 KB Output is correct
66 Correct 803 ms 5708 KB Output is correct
67 Correct 1330 ms 7036 KB Output is correct
68 Correct 593 ms 4684 KB Output is correct
69 Correct 1 ms 384 KB Output is correct