oj.uz

Submission #476541

# Submission time Handle Problem Language Result Execution time Memory
476541 2021-09-27T14:47:46 Z SamAnd Cop and Robber (BOI14_coprobber) C++17
60 / 100
 1301 ms 262148 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

const int N = 503;

int n;
bool a[N][N];

int cnt[N][N][2];
vector<pair<pair<int, int>, bool> > rg[N][N][2];

void ave(pair<pair<int, int>, bool> x, pair<pair<int, int>, bool> y)
{
    rg[y.fi.fi][y.fi.se][y.se].push_back(x);
    ++cnt[x.fi.fi][x.fi.se][x.se];
}

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

int u;
int start(int NN, bool A[MAX_N][MAX_N]) {
    n = NN;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            a[i][j] = A[i][j];
        }
    }

    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            ave(m_p(m_p(i, j), 1), m_p(m_p(i, j), 0));
            for (int k = 0; k < n; ++k)
            {
                if (a[i][k])
                {
                    ave(m_p(m_p(i, j), 1), m_p(m_p(k, j), 0));
                }
                if (a[j][k])
                {
                    ave(m_p(m_p(i, j), 0), m_p(m_p(i, k), 1));
                }
            }
        }
    }

    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));
    }

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

        for (int i = 0; i < rg[u][r][z].size(); ++i)
        {
            pair<pair<int, int>, bool> h = rg[u][r][z][i];
            if (h.se)
            {
                if (!c[h.fi.fi][h.fi.se][h.se])
                {
                    p[h.fi.fi][h.fi.se] = u;
                    c[h.fi.fi][h.fi.se][h.se] = true;
                    q.push(h);
                }
            }
            else
            {
                --cnt[h.fi.fi][h.fi.se][h.se];
                if (cnt[h.fi.fi][h.fi.se][h.se] == 0 && !c[h.fi.fi][h.fi.se][h.se])
                {
                    c[h.fi.fi][h.fi.se][h.se] = true;
                    q.push(h);
                }
            }
        }
    }

    for (u = 0; u < n; ++u)
    {
        bool z = true;
        for (int r = 0; r < n; ++r)
        {
            if (!c[u][r][1])
            {
                z = false;
                break;
            }
        }
        if (z)
        {
            return u;
        }
    }
    return -1;
}

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

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:79:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         for (int i = 0; i < rg[u][r][z].size(); ++i)
      |                         ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12104 KB Output is correct
2 Correct 7 ms 12232 KB Output is correct
3 Correct 7 ms 12232 KB Output is correct
4 Correct 300 ms 40676 KB Output is correct
5 Correct 70 ms 19988 KB Output is correct
6 Correct 410 ms 41648 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12232 KB Output is correct
2 Correct 8 ms 12232 KB Output is correct
3 Correct 426 ms 57332 KB Output is correct
4 Correct 367 ms 48532 KB Output is correct
5 Correct 417 ms 55968 KB Output is correct
6 Correct 393 ms 52844 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12112 KB Output is correct
2 Correct 8 ms 12232 KB Output is correct
3 Correct 7 ms 12232 KB Output is correct
4 Correct 8 ms 12232 KB Output is correct
5 Correct 8 ms 12232 KB Output is correct
6 Correct 7 ms 12104 KB Output is correct
7 Correct 7 ms 12232 KB Output is correct
8 Correct 9 ms 12232 KB Output is correct
9 Correct 7 ms 12360 KB Output is correct
10 Correct 21 ms 15560 KB Output is correct
11 Correct 87 ms 29184 KB Output is correct
12 Correct 8 ms 12488 KB Output is correct
13 Correct 13 ms 13548 KB Output is correct
14 Correct 46 ms 20036 KB Output is correct
15 Correct 13 ms 13512 KB Output is correct
16 Correct 15 ms 14324 KB Output is correct
17 Correct 104 ms 33060 KB Output is correct
18 Correct 15 ms 13896 KB Output is correct
19 Correct 8 ms 12104 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12104 KB Output is correct
2 Correct 7 ms 12232 KB Output is correct
3 Correct 7 ms 12232 KB Output is correct
4 Correct 300 ms 40676 KB Output is correct
5 Correct 70 ms 19988 KB Output is correct
6 Correct 410 ms 41648 KB Output is correct
7 Correct 8 ms 12232 KB Output is correct
8 Correct 8 ms 12232 KB Output is correct
9 Correct 426 ms 57332 KB Output is correct
10 Correct 367 ms 48532 KB Output is correct
11 Correct 417 ms 55968 KB Output is correct
12 Correct 393 ms 52844 KB Output is correct
13 Correct 8 ms 12112 KB Output is correct
14 Correct 8 ms 12232 KB Output is correct
15 Correct 7 ms 12232 KB Output is correct
16 Correct 8 ms 12232 KB Output is correct
17 Correct 8 ms 12232 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12232 KB Output is correct
20 Correct 9 ms 12232 KB Output is correct
21 Correct 7 ms 12360 KB Output is correct
22 Correct 21 ms 15560 KB Output is correct
23 Correct 87 ms 29184 KB Output is correct
24 Correct 8 ms 12488 KB Output is correct
25 Correct 13 ms 13548 KB Output is correct
26 Correct 46 ms 20036 KB Output is correct
27 Correct 13 ms 13512 KB Output is correct
28 Correct 15 ms 14324 KB Output is correct
29 Correct 104 ms 33060 KB Output is correct
30 Correct 15 ms 13896 KB Output is correct
31 Correct 8 ms 12104 KB Output is correct
32 Correct 8 ms 12104 KB Output is correct
33 Correct 8 ms 12232 KB Output is correct
34 Correct 7 ms 12232 KB Output is correct
35 Correct 303 ms 40712 KB Output is correct
36 Correct 74 ms 19968 KB Output is correct
37 Correct 412 ms 41516 KB Output is correct
38 Correct 8 ms 12232 KB Output is correct
39 Correct 8 ms 12324 KB Output is correct
40 Correct 429 ms 57200 KB Output is correct
41 Correct 360 ms 48520 KB Output is correct
42 Correct 404 ms 55848 KB Output is correct
43 Correct 420 ms 52820 KB Output is correct
44 Correct 7 ms 12104 KB Output is correct
45 Correct 7 ms 12232 KB Output is correct
46 Correct 7 ms 12232 KB Output is correct
47 Correct 8 ms 12360 KB Output is correct
48 Correct 24 ms 15552 KB Output is correct
49 Correct 102 ms 29324 KB Output is correct
50 Correct 9 ms 12488 KB Output is correct
51 Correct 12 ms 13512 KB Output is correct
52 Correct 42 ms 20012 KB Output is correct
53 Correct 13 ms 13616 KB Output is correct
54 Correct 16 ms 14280 KB Output is correct
55 Correct 95 ms 33008 KB Output is correct
56 Correct 14 ms 13968 KB Output is correct
57 Correct 87 ms 25408 KB Output is correct
58 Correct 303 ms 46144 KB Output is correct
59 Correct 882 ms 116252 KB Output is correct
60 Runtime error 1301 ms 262148 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -