oj.uz

Submission #476555

# Submission time Handle Problem Language Result Execution time Memory
476555 2021-09-27T15:20:34 Z SamAnd Cop and Robber (BOI14_coprobber) C++17
100 / 100
 1146 ms 7156 KB 
#include "coprobber.h"
#include <iostream>
#include <set>
#include <cstring>
#include <cassert>
#include <vector>
#include <queue>

using namespace std;

#define m_p make_pair
#define fi first
#define se second

int cnt[MAX_N][MAX_N];

bool c[MAX_N][MAX_N][2];
int p[MAX_N][MAX_N];

int start(int n, bool a[MAX_N][MAX_N]) {

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            for (int k = 0; k < n; ++k)
            {
                if (a[j][k])
                {
                    ++cnt[i][j];
                }
            }
        }
    }

    queue<pair<pair<int, int>, bool> > q;

    for (int i = 0; i < n; ++i)
    {
        c[i][i][0] = true;
        q.push(m_p(m_p(i, i), 0));
        c[i][i][1] = true;
        q.push(m_p(m_p(i, i), 1));
    }

    int qq = 0;
    while (!q.empty())
    {
        int u = q.front().fi.fi;
        int r = q.front().fi.se;
        bool z = q.front().se;
        q.pop();
        ++qq;

        if (!z)
        {
            for (int h = 0; h < n; ++h)
            {
                if (h == u || a[u][h])
                {
                    if (!c[h][r][1])
                    {
                        p[h][r] = u;
                        c[h][r][1] = true;
                        q.push(m_p(m_p(h, r), 1));
                    }
                }
            }
        }
        else
        {
            for (int h = 0; h < n; ++h)
            {
                if (a[r][h])
                {
                    --cnt[u][h];
                    if (!c[u][h][0] && cnt[u][h] == 0)
                    {
                        c[u][h][0] = true;
                        q.push(m_p(m_p(u, h), 0));
                    }
                }
            }
        }
    }

    if (qq == 2 * n * n)
        return 0;
    return -1;
}

int u;
int nextMove(int r) {
    u = p[u][r];
    return u;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 402 ms 4080 KB Output is correct
5 Correct 61 ms 2180 KB Output is correct
6 Correct 450 ms 4284 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 427 ms 4184 KB Output is correct
4 Correct 444 ms 4140 KB Output is correct
5 Correct 404 ms 4248 KB Output is correct
6 Correct 480 ms 4044 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 3 ms 840 KB Output is correct
11 Correct 7 ms 840 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 6 ms 840 KB Output is correct
15 Correct 2 ms 584 KB Output is correct
16 Correct 3 ms 584 KB Output is correct
17 Correct 11 ms 1096 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 0 ms 328 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 402 ms 4080 KB Output is correct
5 Correct 61 ms 2180 KB Output is correct
6 Correct 450 ms 4284 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 427 ms 4184 KB Output is correct
10 Correct 444 ms 4140 KB Output is correct
11 Correct 404 ms 4248 KB Output is correct
12 Correct 480 ms 4044 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 0 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 3 ms 840 KB Output is correct
23 Correct 7 ms 840 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 2 ms 712 KB Output is correct
26 Correct 6 ms 840 KB Output is correct
27 Correct 2 ms 584 KB Output is correct
28 Correct 3 ms 584 KB Output is correct
29 Correct 11 ms 1096 KB Output is correct
30 Correct 2 ms 840 KB Output is correct
31 Correct 0 ms 328 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 0 ms 328 KB Output is correct
35 Correct 412 ms 4080 KB Output is correct
36 Correct 62 ms 2068 KB Output is correct
37 Correct 470 ms 4316 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 438 ms 4096 KB Output is correct
41 Correct 433 ms 4148 KB Output is correct
42 Correct 391 ms 4088 KB Output is correct
43 Correct 454 ms 3972 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 328 KB Output is correct
46 Correct 0 ms 328 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 3 ms 840 KB Output is correct
49 Correct 9 ms 840 KB Output is correct
50 Correct 1 ms 456 KB Output is correct
51 Correct 2 ms 584 KB Output is correct
52 Correct 6 ms 840 KB Output is correct
53 Correct 2 ms 584 KB Output is correct
54 Correct 2 ms 584 KB Output is correct
55 Correct 11 ms 1096 KB Output is correct
56 Correct 3 ms 840 KB Output is correct
57 Correct 14 ms 1292 KB Output is correct
58 Correct 79 ms 2412 KB Output is correct
59 Correct 174 ms 3092 KB Output is correct
60 Correct 716 ms 7156 KB Output is correct
61 Correct 555 ms 3684 KB Output is correct
62 Correct 601 ms 3776 KB Output is correct
63 Correct 675 ms 5948 KB Output is correct
64 Correct 342 ms 3564 KB Output is correct
65 Correct 959 ms 6868 KB Output is correct
66 Correct 445 ms 4732 KB Output is correct
67 Correct 1146 ms 5764 KB Output is correct
68 Correct 556 ms 3312 KB Output is correct
69 Correct 1 ms 328 KB Output is correct