oj.uz

Submission #739117

# Submission time Handle Problem Language Result Execution time Memory
739117 2023-05-10T02:33:53 Z Charizard2021 Cop and Robber (BOI14_coprobber) C++17
100 / 100
 1102 ms 8032 KB 
#include "coprobber.h"
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
int indeg[500][500][2];
 
queue<int> qx, qy, qd;
bool vis[500][500][2];
int nxt[500][500];
int pos;
 
int start(int N, bool A[MAX_N][MAX_N])
{
    for (int i = 0; i < N; i++){
        for (int j = 0; j < N; j++){
            if (i == j) continue;
            indeg[i][j][1] = count(A[j], A[j] + N, 1);
            indeg[i][j][0] = 1;
        }
    }
    for (int i = 0; i < N; i++){
        for (int k = 0; k < 2; k++){
            qx.push(i);
            qy.push(i);
            qd.push(k);
            vis[i][i][k] = 1;
        }
    }
    while (!qx.empty()){
        int xf = qx.front();
        int yf = qy.front();
        int df = qd.front();
        qx.pop(), qy.pop(), qd.pop();
        if (df == 1){
            for (int i = 0; i < N; i++){
                if ((xf == i || A[xf][i]) && !vis[i][yf][0]){
                    indeg[i][yf][0]--;
                    if (indeg[i][yf][0] == 0){
                        qx.push(i);
                        qy.push(yf);
                        qd.push(0);
                        nxt[i][yf] = xf;
                        vis[i][yf][0] = 1;
                    }
                }
            }
        }
        else{
            for (int i = 0; i < N; i++){
                if (A[yf][i] &&!vis[xf][i][1]){
                    indeg[xf][i][1]--;
                    if (indeg[xf][i][1] == 0){
                        qx.push(xf);
                        qy.push(i);
                        qd.push(1);
                        vis[xf][i][1] = 1;
                    }
                }
            }
        }
    }
    for (int i = 0; i < N; i++){
        int fnd = 0;
        for (int j = 0; j < N; j++){
            if (!vis[i][j][0]){
                fnd = 1;
                break;
            }
        }
        if (!fnd) return pos = i;
    }
    return -1;
}
 
int nextMove(int R)
{
    return pos = nxt[pos][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 785 ms 5076 KB Output is correct
5 Correct 96 ms 2580 KB Output is correct
6 Correct 788 ms 5332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 767 ms 5148 KB Output is correct
4 Correct 792 ms 5060 KB Output is correct
5 Correct 701 ms 5128 KB Output is correct
6 Correct 772 ms 5052 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 5 ms 1072 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 5 ms 976 KB Output is correct
15 Correct 2 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 10 ms 1232 KB Output is correct
18 Correct 3 ms 976 KB Output is correct
19 Correct 0 ms 208 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 785 ms 5076 KB Output is correct
5 Correct 96 ms 2580 KB Output is correct
6 Correct 788 ms 5332 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 767 ms 5148 KB Output is correct
10 Correct 792 ms 5060 KB Output is correct
11 Correct 701 ms 5128 KB Output is correct
12 Correct 772 ms 5052 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 5 ms 1072 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 848 KB Output is correct
26 Correct 5 ms 976 KB Output is correct
27 Correct 2 ms 720 KB Output is correct
28 Correct 2 ms 720 KB Output is correct
29 Correct 10 ms 1232 KB Output is correct
30 Correct 3 ms 976 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 757 ms 5056 KB Output is correct
36 Correct 92 ms 2564 KB Output is correct
37 Correct 825 ms 5332 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 352 KB Output is correct
40 Correct 746 ms 5164 KB Output is correct
41 Correct 861 ms 5200 KB Output is correct
42 Correct 759 ms 5072 KB Output is correct
43 Correct 820 ms 4944 KB Output is correct
44 Correct 0 ms 208 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 3 ms 976 KB Output is correct
49 Correct 6 ms 976 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 2 ms 848 KB Output is correct
52 Correct 5 ms 976 KB Output is correct
53 Correct 3 ms 720 KB Output is correct
54 Correct 2 ms 720 KB Output is correct
55 Correct 11 ms 1292 KB Output is correct
56 Correct 2 ms 976 KB Output is correct
57 Correct 9 ms 1744 KB Output is correct
58 Correct 52 ms 3236 KB Output is correct
59 Correct 88 ms 3936 KB Output is correct
60 Correct 1068 ms 8032 KB Output is correct
61 Correct 205 ms 4580 KB Output is correct
62 Correct 228 ms 4732 KB Output is correct
63 Correct 1032 ms 6904 KB Output is correct
64 Correct 264 ms 4544 KB Output is correct
65 Correct 1028 ms 7840 KB Output is correct
66 Correct 753 ms 5588 KB Output is correct
67 Correct 1102 ms 6780 KB Output is correct
68 Correct 551 ms 4348 KB Output is correct
69 Correct 0 ms 336 KB Output is correct