oj.uz

답안 #713356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713356 2023-03-21T18:31:06 Z Stickfish 경찰관과 강도 (BOI14_coprobber) C++17
60 / 100
 1500 ms 5668 KB 
#include "coprobber.h"
#include <iostream>
#include <cassert>
#include <bitset>
#include <vector>
using namespace std;

bitset<MAX_N> edg[MAX_N];
bitset<MAX_N> redg[MAX_N];
int bad_edg_cnt[2][MAX_N][MAX_N];
int depth[2][MAX_N][MAX_N];
int n;
int C;
int pR = -1;

int start(int N, bool A[MAX_N][MAX_N]) {
    n = N;
    int deg[MAX_N];

    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
        edg[i][j] = redg[j][i] = A[i][j];
    }
    for (int i = 0; i < N; ++i)
        deg[i] = edg[i].count();
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
        bad_edg_cnt[0][i][j] = 1;
        bad_edg_cnt[1][i][j] = deg[j];
        depth[1][i][j] = depth[0][i][j] = 1234567890;
    }
    vector<vector<int>> q;
    for (int i = 0; i < N; ++i) {
        bad_edg_cnt[0][i][i] = bad_edg_cnt[1][i][i] = 0;
        q.push_back({0, i, i});
        q.push_back({1, i, i});
    }
    int timer = 0;
    while (q.size()) {
        int t = q.back()[0];
        int u = q.back()[1];
        int v = q.back()[2];
        depth[t][u][v] = timer++;
        //cout << t << ' ' << u << ' ' << v << endl;
        q.pop_back();
        bitset<MAX_N> cedg;
        if (t == 0)
            cedg = redg[v];
        else {
            cedg = redg[u];
            cedg[u] = 1;
        }
        for (int i = cedg._Find_first(); i < n; i = cedg._Find_next(i)) {
            int nu = u;
            int nv = v;
            if (t == 0) 
                nv = i;
            else
                nu = i;
            if (nu == nv)
                continue;
            if (--bad_edg_cnt[t ^ 1][nu][nv] == 0) {
                q.push_back({t ^ 1, nu, nv});
            }
        }
    }
    for (int u = 0; u < n; ++u) for (int v = 0; v < n; ++v) {
        if (u == v || bad_edg_cnt[1][u][v] > 0)
            continue;
        for (int nv = edg[v]._Find_first(); nv < MAX_N; nv = edg[v]._Find_next(nv)) {
            assert(bad_edg_cnt[0][u][nv] <= 0 && depth[0][u][nv] < depth[1][u][v]);
        }
    }
    for (int u = 0; u < n; ++u)
        edg[u][u] = 1;
    for (int u = 0; u < n; ++u) {
        bool isok = true;
        for (int v = 0; v < n; ++v) {
            isok &= bad_edg_cnt[0][u][v] <= 0;
        }
        if (isok)
            return C = u;
    }
    return -1; 
}

int nextMove(int R) {
    //if (pR != -1)
        //cout << "A " << C << ' ' << pR << ' ' << depth[1][C][pR] << endl;
    //cout << "B " << C << ' ' << R << ' ' << depth[0][C][R] << endl;
    if (pR != -1) {
        assert(edg[pR][R]);
        assert(bad_edg_cnt[1][C][pR] <= 0);
        assert(depth[1][C][pR] > depth[0][C][R]);
    }
    //assert(bad_edg_cnt[0][C][R] <= 0);
    pR = R;
    for (int nC = edg[C]._Find_first(); nC < n; nC = edg[C]._Find_next(nC)) { 
        if (bad_edg_cnt[1][nC][R] <= 0 && depth[1][nC][R] < depth[0][C][R]) {
            //cout << "C " << nC << ' ' << R << ' ' << depth[1][nC][R] << endl;
            return C = nC;
        }
    }
    //return -1;
    assert(0);
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 68 ms 5656 KB Output is correct
5 Correct 18 ms 2824 KB Output is correct
6 Correct 98 ms 5536 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 83 ms 5520 KB Output is correct
4 Correct 70 ms 5664 KB Output is correct
5 Correct 93 ms 5428 KB Output is correct
6 Correct 82 ms 5528 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 2 ms 1104 KB Output is correct
11 Correct 3 ms 1100 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 3 ms 1104 KB Output is correct
15 Correct 2 ms 848 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 13 ms 1396 KB Output is correct
18 Correct 2 ms 1104 KB Output is correct
19 Correct 1 ms 336 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 68 ms 5656 KB Output is correct
5 Correct 18 ms 2824 KB Output is correct
6 Correct 98 ms 5536 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 83 ms 5520 KB Output is correct
10 Correct 70 ms 5664 KB Output is correct
11 Correct 93 ms 5428 KB Output is correct
12 Correct 82 ms 5528 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 2 ms 1104 KB Output is correct
23 Correct 3 ms 1100 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 3 ms 1104 KB Output is correct
27 Correct 2 ms 848 KB Output is correct
28 Correct 2 ms 848 KB Output is correct
29 Correct 13 ms 1396 KB Output is correct
30 Correct 2 ms 1104 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 83 ms 5648 KB Output is correct
36 Correct 18 ms 2824 KB Output is correct
37 Correct 85 ms 5532 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 83 ms 5496 KB Output is correct
41 Correct 71 ms 5668 KB Output is correct
42 Correct 79 ms 5392 KB Output is correct
43 Correct 74 ms 5540 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 1 ms 336 KB Output is correct
47 Correct 0 ms 464 KB Output is correct
48 Correct 1 ms 1104 KB Output is correct
49 Correct 3 ms 1068 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 848 KB Output is correct
52 Correct 4 ms 1104 KB Output is correct
53 Correct 2 ms 856 KB Output is correct
54 Correct 2 ms 848 KB Output is correct
55 Correct 12 ms 1424 KB Output is correct
56 Correct 3 ms 1100 KB Output is correct
57 Correct 4 ms 2000 KB Output is correct
58 Correct 14 ms 3752 KB Output is correct
59 Correct 23 ms 4472 KB Output is correct
60 Execution timed out 2140 ms 5576 KB Time limit exceeded
61 Halted 0 ms 0 KB -