oj.uz

Submission #476549

# Submission time Handle Problem Language Result Execution time Memory
476549 2021-09-27T15:01:12 Z SamAnd Cop and Robber (BOI14_coprobber) C++17
60 / 100
 1392 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

int cnt[MAX_N][MAX_N][2];
vector<pair<pair<int, int>, bool> > rg[MAX_N][MAX_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[MAX_N][MAX_N][2];
int p[MAX_N][MAX_N];

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

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

    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;

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

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

set<pair<int, int> > s;
int nextMove(int r) {
    if (!c[u][r][1])
        return -1234;
    if (s.find(m_p(u, r)) != s.end())
        return -1234;
    s.insert(m_p(u, r));
    return (u = p[u][r]);
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:68: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]
   68 |         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 11976 KB Output is correct
2 Correct 8 ms 11976 KB Output is correct
3 Correct 7 ms 12104 KB Output is correct
4 Correct 304 ms 40272 KB Output is correct
5 Correct 72 ms 19648 KB Output is correct
6 Correct 432 ms 41216 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 11976 KB Output is correct
2 Correct 7 ms 12104 KB Output is correct
3 Correct 440 ms 56884 KB Output is correct
4 Correct 389 ms 48152 KB Output is correct
5 Correct 446 ms 55500 KB Output is correct
6 Correct 395 ms 52388 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11976 KB Output is correct
2 Correct 8 ms 12016 KB Output is correct
3 Correct 10 ms 12044 KB Output is correct
4 Correct 10 ms 12036 KB Output is correct
5 Correct 7 ms 12188 KB Output is correct
6 Correct 9 ms 11976 KB Output is correct
7 Correct 6 ms 12104 KB Output is correct
8 Correct 6 ms 12104 KB Output is correct
9 Correct 8 ms 12232 KB Output is correct
10 Correct 22 ms 15380 KB Output is correct
11 Correct 96 ms 28992 KB Output is correct
12 Correct 9 ms 12336 KB Output is correct
13 Correct 12 ms 13328 KB Output is correct
14 Correct 48 ms 19776 KB Output is correct
15 Correct 13 ms 13460 KB Output is correct
16 Correct 18 ms 14152 KB Output is correct
17 Correct 93 ms 32720 KB Output is correct
18 Correct 14 ms 13712 KB Output is correct
19 Correct 9 ms 11976 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11976 KB Output is correct
2 Correct 8 ms 11976 KB Output is correct
3 Correct 7 ms 12104 KB Output is correct
4 Correct 304 ms 40272 KB Output is correct
5 Correct 72 ms 19648 KB Output is correct
6 Correct 432 ms 41216 KB Output is correct
7 Correct 8 ms 11976 KB Output is correct
8 Correct 7 ms 12104 KB Output is correct
9 Correct 440 ms 56884 KB Output is correct
10 Correct 389 ms 48152 KB Output is correct
11 Correct 446 ms 55500 KB Output is correct
12 Correct 395 ms 52388 KB Output is correct
13 Correct 7 ms 11976 KB Output is correct
14 Correct 8 ms 12016 KB Output is correct
15 Correct 10 ms 12044 KB Output is correct
16 Correct 10 ms 12036 KB Output is correct
17 Correct 7 ms 12188 KB Output is correct
18 Correct 9 ms 11976 KB Output is correct
19 Correct 6 ms 12104 KB Output is correct
20 Correct 6 ms 12104 KB Output is correct
21 Correct 8 ms 12232 KB Output is correct
22 Correct 22 ms 15380 KB Output is correct
23 Correct 96 ms 28992 KB Output is correct
24 Correct 9 ms 12336 KB Output is correct
25 Correct 12 ms 13328 KB Output is correct
26 Correct 48 ms 19776 KB Output is correct
27 Correct 13 ms 13460 KB Output is correct
28 Correct 18 ms 14152 KB Output is correct
29 Correct 93 ms 32720 KB Output is correct
30 Correct 14 ms 13712 KB Output is correct
31 Correct 9 ms 11976 KB Output is correct
32 Correct 10 ms 11976 KB Output is correct
33 Correct 9 ms 12004 KB Output is correct
34 Correct 8 ms 12104 KB Output is correct
35 Correct 329 ms 40292 KB Output is correct
36 Correct 80 ms 19712 KB Output is correct
37 Correct 469 ms 41016 KB Output is correct
38 Correct 7 ms 11976 KB Output is correct
39 Correct 7 ms 12104 KB Output is correct
40 Correct 570 ms 56828 KB Output is correct
41 Correct 418 ms 48172 KB Output is correct
42 Correct 467 ms 55460 KB Output is correct
43 Correct 414 ms 52372 KB Output is correct
44 Correct 8 ms 11976 KB Output is correct
45 Correct 8 ms 12104 KB Output is correct
46 Correct 7 ms 12104 KB Output is correct
47 Correct 9 ms 12232 KB Output is correct
48 Correct 23 ms 15360 KB Output is correct
49 Correct 92 ms 29120 KB Output is correct
50 Correct 8 ms 12436 KB Output is correct
51 Correct 13 ms 13356 KB Output is correct
52 Correct 42 ms 19836 KB Output is correct
53 Correct 13 ms 13384 KB Output is correct
54 Correct 16 ms 14152 KB Output is correct
55 Correct 103 ms 32744 KB Output is correct
56 Correct 15 ms 13620 KB Output is correct
57 Correct 101 ms 25052 KB Output is correct
58 Correct 338 ms 45840 KB Output is correct
59 Correct 934 ms 115840 KB Output is correct
60 Runtime error 1392 ms 262148 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -