oj.uz

Submission #824831

# Submission time Handle Problem Language Result Execution time Memory
824831 2023-08-14T10:59:45 Z QwertyPi Cop and Robber (BOI14_coprobber) C++14
60 / 100
 1500 ms 9612 KB 
#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

struct state{
    int u, v, t;
    int operator()() const {
        return u * MAX_N * 2 + v * 2 + t;
    }
    string print() const {
        string r;
        r += "(";
        r += to_string(u);
        r += ", ";
        r += to_string(v);
        r += ", ";
        r += to_string(t);
        r += ")";
        return r;
    }
};

int N;
bool w[MAX_N * MAX_N * 2];
int nxt[MAX_N * MAX_N * 2];
int deg[MAX_N * MAX_N * 2], r_deg[MAX_N * MAX_N * 2];
bool added[MAX_N * MAX_N * 2];
bool A[MAX_N][MAX_N];

void add_edge(const state& u, const state& v){
    // cout << "Edge: " << u.print() << " -> " << v.print() << endl;
    if(w[v()] == true) deg[u()]++; r_deg[u()]++;
}

int pos = -1;
int start(int N, bool A[MAX_N][MAX_N])
{
    ::N = N;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            ::A[i][j] = A[i][j];
        }
    }

    for(int u = 0; u < N; u++){
        for(int v = 0; v < N; v++){
            for(int t = 0; t < 2; t++){
                state st {u, v, t};
                if(u == v) w[st()] = true;
            }
        }
    }
    for(int u = 0; u < N; u++){
        for(int v = 0; v < N; v++){
            for(int t = 0; t < 2; t++){
                state st {u, v, t};
                if(u == v) continue;
                if(t == 0){
                    for(int i = 0; i < N; i++){
                        if(A[u][i] || i == u){
                            state st2 {i, v, !t};
                            add_edge(st, st2);
                        }
                    }
                }else{
                    for(int i = 0; i < N; i++){
                        if(A[v][i]){
                            state st2 {u, i, !t};
                            add_edge(st, st2);
                        }
                    }
                }
            }
        }
    }

    vector<int> det;
    
    for(int u = 0; u < N; u++){
        for(int v = 0; v < N; v++){
            for(int t = 0; t < 2; t++){
                state st {u, v, t};
                bool alr_win = false;
                if(t == 0){
                    for(int i = 0; i < N; i++){
                        if(A[u][i] && i == v) alr_win = true;
                    }
                }
                if(u != v && (r_deg[st()] == deg[st()] || alr_win)){
                    det.push_back(st()); added[st()] = true;
                }
            }
        }
    }

    while(det.size()){
        int k = det.back(); det.pop_back();
        int u = k / 2 / MAX_N;
        int v = k / 2 % MAX_N;
        int t = k % 2;
        state st {u, v, t};
        if(t == 0){
            bool exist_win = false;
            for(int i = 0; i < N; i++){
                if(A[u][i] || i == u){
                    state st2 {i, v, !t};
                    exist_win |= w[st2()];
                    if(w[st2()]) nxt[st()] = st2();
                }
            }
            w[st()] = exist_win;
        }else{
            bool all_win = true;
            for(int i = 0; i < N; i++){
                if(A[v][i]){
                    state st2 {u, i, !t};
                    all_win &= w[st2()];
                }
            }
            w[st()] = all_win;
        }

        if(t == 0){
            for(int i = 0; i < N; i++){
                if(A[i][v]){
                    state _st2 {u, i, 1};
                    int st2 = _st2();
                    if(added[st2]) continue;
                    deg[st2]++; 
                    if(deg[st2] == r_deg[st2]) added[st2] = true, det.push_back(st2);
                    else if((!t) == 0 && w[st()] == 1) added[st2] = true, det.push_back(st2);
                    else if((!t) == 1 && w[st()] == 0) added[st2] = true, det.push_back(st2);
                }
            }
        }else{
            for(int i = 0; i < N; i++){
                if(A[i][u] || i == u){
                    state _st2 {i, v, 0};
                    int st2 = _st2();
                    if(added[st2]) continue;
                    deg[st2]++; 
                    if(deg[st2] == r_deg[st2]) added[st2] = true, det.push_back(st2);
                    else if((!t) == 0 && w[st()] == 1) added[st2] = true, det.push_back(st2);
                    else if((!t) == 1 && w[st()] == 0) added[st2] = true, det.push_back(st2);
                }
            }
        }
    }

    for(int i = 0; i < N; i++){
        bool all_win = true;
        for(int j = 0; j < N; j++){
            state st {i, j, 0};
            all_win &= w[st()];
        }
        if(all_win){
            pos = i;
            return i;
        }
    }
    return -1;
}

int nextMove(int R)
{
    state st {pos, R, 0};
    int st2 = nxt[st()];
    pos = st2 / 2 / MAX_N;
    return pos;
}

Compilation message

coprobber.cpp: In function 'void add_edge(const state&, const state&)':
coprobber.cpp:33:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   33 |     if(w[v()] == true) deg[u()]++; r_deg[u()]++;
      |     ^~
coprobber.cpp:33:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   33 |     if(w[v()] == true) deg[u()]++; r_deg[u()]++;
      |                                    ^~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 673 ms 8904 KB Output is correct
5 Correct 94 ms 4264 KB Output is correct
6 Correct 814 ms 8612 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 699 ms 8628 KB Output is correct
4 Correct 828 ms 8764 KB Output is correct
5 Correct 756 ms 8376 KB Output is correct
6 Correct 823 ms 8600 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 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 0 ms 464 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 8 ms 1744 KB Output is correct
11 Correct 13 ms 1744 KB Output is correct
12 Correct 1 ms 720 KB Output is correct
13 Correct 3 ms 1348 KB Output is correct
14 Correct 11 ms 1744 KB Output is correct
15 Correct 3 ms 1104 KB Output is correct
16 Correct 4 ms 1100 KB Output is correct
17 Correct 20 ms 2048 KB Output is correct
18 Correct 4 ms 1744 KB Output is correct
19 Correct 1 ms 336 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 673 ms 8904 KB Output is correct
5 Correct 94 ms 4264 KB Output is correct
6 Correct 814 ms 8612 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 699 ms 8628 KB Output is correct
10 Correct 828 ms 8764 KB Output is correct
11 Correct 756 ms 8376 KB Output is correct
12 Correct 823 ms 8600 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 464 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 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 0 ms 464 KB Output is correct
21 Correct 1 ms 592 KB Output is correct
22 Correct 8 ms 1744 KB Output is correct
23 Correct 13 ms 1744 KB Output is correct
24 Correct 1 ms 720 KB Output is correct
25 Correct 3 ms 1348 KB Output is correct
26 Correct 11 ms 1744 KB Output is correct
27 Correct 3 ms 1104 KB Output is correct
28 Correct 4 ms 1100 KB Output is correct
29 Correct 20 ms 2048 KB Output is correct
30 Correct 4 ms 1744 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 464 KB Output is correct
35 Correct 745 ms 8732 KB Output is correct
36 Correct 98 ms 4260 KB Output is correct
37 Correct 790 ms 8612 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 746 ms 8524 KB Output is correct
41 Correct 745 ms 8744 KB Output is correct
42 Correct 684 ms 8408 KB Output is correct
43 Correct 770 ms 8608 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 464 KB Output is correct
47 Correct 1 ms 624 KB Output is correct
48 Correct 7 ms 1744 KB Output is correct
49 Correct 17 ms 1784 KB Output is correct
50 Correct 1 ms 720 KB Output is correct
51 Correct 3 ms 1360 KB Output is correct
52 Correct 8 ms 1804 KB Output is correct
53 Correct 3 ms 1104 KB Output is correct
54 Correct 3 ms 1104 KB Output is correct
55 Correct 18 ms 2000 KB Output is correct
56 Correct 4 ms 1744 KB Output is correct
57 Correct 27 ms 3160 KB Output is correct
58 Correct 176 ms 6088 KB Output is correct
59 Correct 359 ms 7644 KB Output is correct
60 Correct 1395 ms 9612 KB Output is correct
61 Correct 933 ms 7356 KB Output is correct
62 Correct 972 ms 8004 KB Output is correct
63 Correct 1327 ms 9320 KB Output is correct
64 Correct 514 ms 7744 KB Output is correct
65 Execution timed out 2208 ms 9284 KB Time limit exceeded
66 Halted 0 ms 0 KB -