oj.uz

Submission #593022

# Submission time Handle Problem Language Result Execution time Memory
593022 2022-07-10T08:17:08 Z Jomnoi Cop and Robber (BOI14_coprobber) C++17
100 / 100
 832 ms 9004 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

queue <tuple <int, int, bool>> q;
int nxt[MAX_N][MAX_N][2];
vector <int> graph[MAX_N];
bool dp[MAX_N][MAX_N][2];
int adj[MAX_N][MAX_N];
int now;

void move(int nc, int nr, int nt, int c, int r, int t) {
    if(dp[nc][nr][nt] == true) {
        return;
    }

    dp[nc][nr][nt] = true;
    nxt[nc][nr][nt] = c;
    q.emplace(nc, nr, nt);
}

int start(int N, bool A[MAX_N][MAX_N]) {
    for(int i = 0; i < N; i++) {
        for(int j = i + 1; j < N; j++) {
            if(A[i][j] == true) {
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }

    for(int i = 0; i < N; i++) {
        dp[i][i][0] = dp[i][i][1] = true;
        q.emplace(i, i, 0);
        q.emplace(i, i, 1);
    }

    while(!q.empty()) {
        auto [c, r, t] = q.front();
        q.pop();

        if(t == 1) {
            for(auto nc : graph[c]) {
                move(nc, r, 0, c, r, 1);
            }
            move(c, r, 0, c, r, 1);
        }
        else { // t == 0
            for(auto nr : graph[r]) {
                if(++adj[c][nr] == graph[nr].size()) {
                    move(c, nr, 1, c, r, 1);
                }
            }
        }
    }

    for(int c = 0; c < N; c++) {
        bool ok = true;
        for(int r = 0; r < N; r++) {
            if(dp[c][r][0] == false) {
                ok = false;
                break;
            }
        }

        if(ok == true) {
            return now = c;
        }
    }
    return -1;
}

int nextMove(int R) {
    return now = nxt[now][R][0];
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:50:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |                 if(++adj[c][nr] == graph[nr].size()) {
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.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 0 ms 336 KB Output is correct
4 Correct 52 ms 5192 KB Output is correct
5 Correct 13 ms 2612 KB Output is correct
6 Correct 51 ms 5324 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 56 ms 5108 KB Output is correct
4 Correct 64 ms 5188 KB Output is correct
5 Correct 48 ms 5088 KB Output is correct
6 Correct 51 ms 4988 KB Output is correct

Subtask #3
30.0 / 30.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 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 2 ms 1160 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 2 ms 1104 KB Output is correct
15 Correct 1 ms 732 KB Output is correct
16 Correct 1 ms 720 KB Output is correct
17 Correct 6 ms 1388 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.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 0 ms 336 KB Output is correct
4 Correct 52 ms 5192 KB Output is correct
5 Correct 13 ms 2612 KB Output is correct
6 Correct 51 ms 5324 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 56 ms 5108 KB Output is correct
10 Correct 64 ms 5188 KB Output is correct
11 Correct 48 ms 5088 KB Output is correct
12 Correct 51 ms 4988 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 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 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 2 ms 1160 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 2 ms 1104 KB Output is correct
27 Correct 1 ms 732 KB Output is correct
28 Correct 1 ms 720 KB Output is correct
29 Correct 6 ms 1388 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 48 ms 5160 KB Output is correct
36 Correct 12 ms 2648 KB Output is correct
37 Correct 52 ms 5420 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 50 ms 5224 KB Output is correct
41 Correct 50 ms 5184 KB Output is correct
42 Correct 66 ms 5044 KB Output is correct
43 Correct 54 ms 5056 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 0 ms 464 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 2 ms 1104 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 848 KB Output is correct
52 Correct 2 ms 1104 KB Output is correct
53 Correct 1 ms 720 KB Output is correct
54 Correct 1 ms 720 KB Output is correct
55 Correct 6 ms 1360 KB Output is correct
56 Correct 1 ms 976 KB Output is correct
57 Correct 4 ms 1824 KB Output is correct
58 Correct 13 ms 3208 KB Output is correct
59 Correct 21 ms 3976 KB Output is correct
60 Correct 832 ms 9004 KB Output is correct
61 Correct 65 ms 5108 KB Output is correct
62 Correct 56 ms 5364 KB Output is correct
63 Correct 544 ms 7844 KB Output is correct
64 Correct 40 ms 4768 KB Output is correct
65 Correct 605 ms 8940 KB Output is correct
66 Correct 60 ms 5632 KB Output is correct
67 Correct 271 ms 7216 KB Output is correct
68 Correct 75 ms 4560 KB Output is correct
69 Correct 0 ms 336 KB Output is correct