oj.uz

답안 #476554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
476554 2021-09-27T15:19:09 Z SamAnd 경찰관과 강도 (BOI14_coprobber) C++17
60 / 100
 1500 ms 8016 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];

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)
        {
            //ave(m_p(m_p(i, j), 1), m_p(m_p(i, j), 0));
            ++cnt[i][j][1];
            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));
                    ++cnt[i][j][1];
                }
                if (a[j][k])
                {
                    //ave(m_p(m_p(i, j), 0), m_p(m_p(i, k), 1));
                    ++cnt[i][j][0];
                }
            }
        }
    }

    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][0];
                    if (!c[u][h][0] && cnt[u][h][0] == 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 549 ms 5060 KB Output is correct
5 Correct 93 ms 2592 KB Output is correct
6 Correct 604 ms 5372 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 545 ms 5064 KB Output is correct
4 Correct 594 ms 5076 KB Output is correct
5 Correct 519 ms 5024 KB Output is correct
6 Correct 566 ms 5056 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 5 ms 968 KB Output is correct
11 Correct 14 ms 968 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 2 ms 840 KB Output is correct
14 Correct 9 ms 1096 KB Output is correct
15 Correct 3 ms 712 KB Output is correct
16 Correct 3 ms 712 KB Output is correct
17 Correct 17 ms 1224 KB Output is correct
18 Correct 3 ms 968 KB Output is correct
19 Correct 1 ms 328 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 549 ms 5060 KB Output is correct
5 Correct 93 ms 2592 KB Output is correct
6 Correct 604 ms 5372 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 545 ms 5064 KB Output is correct
10 Correct 594 ms 5076 KB Output is correct
11 Correct 519 ms 5024 KB Output is correct
12 Correct 566 ms 5056 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 5 ms 968 KB Output is correct
23 Correct 14 ms 968 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 2 ms 840 KB Output is correct
26 Correct 9 ms 1096 KB Output is correct
27 Correct 3 ms 712 KB Output is correct
28 Correct 3 ms 712 KB Output is correct
29 Correct 17 ms 1224 KB Output is correct
30 Correct 3 ms 968 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 566 ms 5068 KB Output is correct
36 Correct 73 ms 2640 KB Output is correct
37 Correct 563 ms 5364 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 546 ms 5068 KB Output is correct
41 Correct 691 ms 5064 KB Output is correct
42 Correct 538 ms 5136 KB Output is correct
43 Correct 565 ms 4956 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 456 KB Output is correct
48 Correct 4 ms 968 KB Output is correct
49 Correct 18 ms 968 KB Output is correct
50 Correct 1 ms 456 KB Output is correct
51 Correct 2 ms 840 KB Output is correct
52 Correct 9 ms 1052 KB Output is correct
53 Correct 3 ms 712 KB Output is correct
54 Correct 3 ms 712 KB Output is correct
55 Correct 15 ms 1396 KB Output is correct
56 Correct 3 ms 968 KB Output is correct
57 Correct 25 ms 1728 KB Output is correct
58 Correct 126 ms 3172 KB Output is correct
59 Correct 236 ms 4004 KB Output is correct
60 Correct 735 ms 7944 KB Output is correct
61 Correct 1016 ms 4444 KB Output is correct
62 Correct 1044 ms 4840 KB Output is correct
63 Correct 803 ms 6880 KB Output is correct
64 Correct 492 ms 4500 KB Output is correct
65 Correct 1342 ms 8016 KB Output is correct
66 Correct 570 ms 5556 KB Output is correct
67 Execution timed out 1532 ms 6748 KB Time limit exceeded
68 Halted 0 ms 0 KB -