oj.uz

Submission #824846

# Submission time Handle Problem Language Result Execution time Memory
824846 2023-08-14T11:07:40 Z QwertyPi Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1371 ms 9612 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
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 id(int u, int v, int t){
    return u * MAX_N * 2 + v * 2 + t;
}

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(int u, int 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++){
                if(u == v) continue;
                if(t == 0){
                    for(int i = 0; i < N; i++){
                        if(A[u][i] || i == u){
                            add_edge(id(u, v, t), id(i, v, !t));
                        }
                    }
                }else{
                    for(int i = 0; i < N; i++){
                        if(A[v][i]){
                            add_edge(id(u, v, t), id(u, i, !t));
                        }
                    }
                }
            }
        }
    }

    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;
        int st = id(u, v, t);
        if(t == 0){
            bool exist_win = false;
            for(int i = 0; i < N; i++){
                if(A[u][i] || i == u){
                    int st2 = id(i, v, !t);
                    exist_win |= w[st2];
                    if(w[st2]) nxt[st] = st2;
                    if(exist_win) break;
                }
            }
            w[st] = exist_win;
        }else{
            bool all_win = true;
            for(int i = 0; i < N; i++){
                if(A[v][i]){
                    int st2 = id(u, i, !t);
                    all_win &= w[st2];
                    if(!all_win) break;
                }
            }
            w[st] = all_win;
        }

        if(t == 0){
            for(int i = 0; i < N; i++){
                if(A[i][v]){
                    int st2 = id(u, i, 1);
                    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){
                    int st2 = id(i, v, 0);
                    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(int, int)':
coprobber.cpp:38:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   38 |     if(w[v] == true) deg[u]++; r_deg[u]++;
      |     ^~
coprobber.cpp:38:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   38 |     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 519 ms 8800 KB Output is correct
5 Correct 62 ms 4260 KB Output is correct
6 Correct 556 ms 8616 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 514 ms 8524 KB Output is correct
4 Correct 534 ms 8808 KB Output is correct
5 Correct 494 ms 8380 KB Output is correct
6 Correct 601 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 0 ms 336 KB Output is correct
3 Correct 1 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 0 ms 592 KB Output is correct
10 Correct 6 ms 1744 KB Output is correct
11 Correct 8 ms 1808 KB Output is correct
12 Correct 1 ms 720 KB Output is correct
13 Correct 3 ms 1360 KB Output is correct
14 Correct 6 ms 1744 KB Output is correct
15 Correct 2 ms 1104 KB Output is correct
16 Correct 3 ms 1104 KB Output is correct
17 Correct 14 ms 2032 KB Output is correct
18 Correct 3 ms 1744 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.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 519 ms 8800 KB Output is correct
5 Correct 62 ms 4260 KB Output is correct
6 Correct 556 ms 8616 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 514 ms 8524 KB Output is correct
10 Correct 534 ms 8808 KB Output is correct
11 Correct 494 ms 8380 KB Output is correct
12 Correct 601 ms 8600 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 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 0 ms 592 KB Output is correct
22 Correct 6 ms 1744 KB Output is correct
23 Correct 8 ms 1808 KB Output is correct
24 Correct 1 ms 720 KB Output is correct
25 Correct 3 ms 1360 KB Output is correct
26 Correct 6 ms 1744 KB Output is correct
27 Correct 2 ms 1104 KB Output is correct
28 Correct 3 ms 1104 KB Output is correct
29 Correct 14 ms 2032 KB Output is correct
30 Correct 3 ms 1744 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 601 ms 8732 KB Output is correct
36 Correct 74 ms 4260 KB Output is correct
37 Correct 596 ms 8588 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 1 ms 464 KB Output is correct
40 Correct 564 ms 8600 KB Output is correct
41 Correct 551 ms 8744 KB Output is correct
42 Correct 505 ms 8380 KB Output is correct
43 Correct 597 ms 8640 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 492 KB Output is correct
47 Correct 1 ms 592 KB Output is correct
48 Correct 4 ms 1744 KB Output is correct
49 Correct 8 ms 1760 KB Output is correct
50 Correct 1 ms 720 KB Output is correct
51 Correct 2 ms 1360 KB Output is correct
52 Correct 7 ms 1800 KB Output is correct
53 Correct 3 ms 1104 KB Output is correct
54 Correct 3 ms 1104 KB Output is correct
55 Correct 14 ms 2048 KB Output is correct
56 Correct 3 ms 1744 KB Output is correct
57 Correct 21 ms 3144 KB Output is correct
58 Correct 138 ms 6124 KB Output is correct
59 Correct 285 ms 7604 KB Output is correct
60 Correct 819 ms 9612 KB Output is correct
61 Correct 743 ms 7268 KB Output is correct
62 Correct 732 ms 7952 KB Output is correct
63 Correct 675 ms 9360 KB Output is correct
64 Correct 333 ms 7832 KB Output is correct
65 Correct 1371 ms 9272 KB Output is correct
66 Correct 494 ms 8280 KB Output is correct
67 Correct 1257 ms 8988 KB Output is correct
68 Correct 629 ms 7824 KB Output is correct
69 Correct 0 ms 336 KB Output is correct