oj.uz

Submission #309743

# Submission time Handle Problem Language Result Execution time Memory
309743 2020-10-04T12:54:47 Z nicolaalexandra Cop and Robber (BOI14_coprobber) C++14
100 / 100
 838 ms 10712 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
//#define MAX_N 510
using namespace std;

int C,R;
struct stare{
    int c,r,t;
};
stare d[MAX_N*MAX_N*3];
int dp[MAX_N][MAX_N][2],fth[MAX_N][MAX_N],g[MAX_N];


int start (int n, bool a[MAX_N][MAX_N]){
    /// stari de pierdere / de castig
    /// C,R,0/1 - unde se afla politistu si hotu si cine a facut ultima miscare
    /// C,C,0/1 - stare de castig

    int p = 1, u = 0;
    for (int i=0;i<n;++i){
        for (int j=0;j<n;j++)
            g[i] += a[i][j];
        d[++u] = {i,i,0};
        d[++u] = {i,i,1};
    }

    for (int i=0;i<n;i++)
        for (int j=0;j<n;j++)
            if (i != j){
                dp[i][j][0] = 1; /// de cate stari castigatoare am nevoie printe vecinii lui i
                dp[i][j][1] = g[j]; /// am nevoie ca toti vecinii sa fie castigatori ca asta sa fie castigator
            }

    while (p <= u){
        int c = d[p].c, r = d[p].r, t = d[p].t; /// stare castigatoare
        ++p;

        if (!t){ /// trb sa mute hotu

            for (int i=0;i<n;i++){
                if (!a[r][i] || !dp[c][i][1])
                    continue;
                dp[c][i][1]--;
                if (!dp[c][i][1]) /// inseamna ca toate starile vecinilor sunt castigatoare
                    d[++u] = {c,i,1};
            }

        } else { /// politistul se muta sau sta pe loc

            for (int i=0;i<n;i++){
                if ((!a[c][i] && i != c) || !dp[i][r][0])
                    continue;

                dp[i][r][0] = 0;
                d[++u] = {i,r,0};
                fth[i][r] = c; /// unde ma duc din starea asta
            }}}

    for (int i=0;i<n;i++){
        int ok = 1;
        for (int j=0;j<n;j++)
            if (dp[i][j][0]){
                ok = 0;
                break;
            }
        if (ok)
            return i;
    }
    return -1;

}

int nextMove (int R){

    C = fth[C][R];
    return C;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 329 ms 10584 KB Output is correct
5 Correct 47 ms 3704 KB Output is correct
6 Correct 338 ms 10360 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 322 ms 10384 KB Output is correct
4 Correct 332 ms 10616 KB Output is correct
5 Correct 313 ms 9988 KB Output is correct
6 Correct 326 ms 10388 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Correct 4 ms 1024 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 9 ms 1408 KB Output is correct
18 Correct 2 ms 1024 KB Output is correct
19 Correct 0 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 329 ms 10584 KB Output is correct
5 Correct 47 ms 3704 KB Output is correct
6 Correct 338 ms 10360 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 322 ms 10384 KB Output is correct
10 Correct 332 ms 10616 KB Output is correct
11 Correct 313 ms 9988 KB Output is correct
12 Correct 326 ms 10388 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 2 ms 1024 KB Output is correct
23 Correct 3 ms 1024 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 2 ms 896 KB Output is correct
26 Correct 4 ms 1024 KB Output is correct
27 Correct 2 ms 768 KB Output is correct
28 Correct 2 ms 768 KB Output is correct
29 Correct 9 ms 1408 KB Output is correct
30 Correct 2 ms 1024 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 318 ms 10576 KB Output is correct
36 Correct 48 ms 3708 KB Output is correct
37 Correct 353 ms 10488 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 321 ms 10232 KB Output is correct
41 Correct 320 ms 10632 KB Output is correct
42 Correct 309 ms 10232 KB Output is correct
43 Correct 329 ms 10492 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 1 ms 512 KB Output is correct
48 Correct 2 ms 1024 KB Output is correct
49 Correct 4 ms 1024 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 2 ms 896 KB Output is correct
52 Correct 4 ms 1024 KB Output is correct
53 Correct 2 ms 768 KB Output is correct
54 Correct 2 ms 768 KB Output is correct
55 Correct 9 ms 1408 KB Output is correct
56 Correct 2 ms 1024 KB Output is correct
57 Correct 6 ms 1664 KB Output is correct
58 Correct 18 ms 2936 KB Output is correct
59 Correct 31 ms 3712 KB Output is correct
60 Correct 562 ms 10488 KB Output is correct
61 Correct 118 ms 4096 KB Output is correct
62 Correct 135 ms 4352 KB Output is correct
63 Correct 756 ms 10712 KB Output is correct
64 Correct 126 ms 4728 KB Output is correct
65 Correct 838 ms 10360 KB Output is correct
66 Correct 336 ms 9592 KB Output is correct
67 Correct 805 ms 10544 KB Output is correct
68 Correct 297 ms 6136 KB Output is correct
69 Correct 0 ms 384 KB Output is correct