oj.uz

Submission #17353

# Submission time Handle Problem Language Result Execution time Memory
17353 2015-11-25T12:09:50 Z eaststar Cop and Robber (BOI14_coprobber) C++14
100 / 100
 834 ms 7744 KB 
#include "coprobber.h"
#include <queue>
using namespace std;
struct data{
    int x,y,z;
}t;
queue<data> q;
int a[510][510][2],nx[510][510],p;
int start(int N, bool A[MAX_N][MAX_N]){
    int i,j,cnt;
    for(i=0;i<N;++i){
        cnt=0;
        for(j=0;j<N;++j)if(A[i][j])++cnt;
        for(j=0;j<N;++j)if(i!=j)a[j][i][0]=1,a[j][i][1]=cnt;
        q.push({i,i,0}),q.push({i,i,1});
    }
    while(!q.empty()){
        t=q.front();
        q.pop();
        if(t.z){
            for(i=0;i<N;++i)if((t.x==i||A[t.x][i])&&a[i][t.y][0]){
                --a[i][t.y][0];
                if(!a[i][t.y][0])q.push({i,t.y,0}),nx[i][t.y]=t.x;
            }
        }
        else{
            for(i=0;i<N;++i)if(A[t.y][i]&&a[t.x][i][1]){
                --a[t.x][i][1];
                if(!a[t.x][i][1])q.push({t.x,i,1});
            }
        }
    }
    for(i=0;i<N;++i){
        for(j=0;j<N;++j)if(a[i][j][0])break;
        if(j==N)return p=i;
    }
    return -1;
}
int nextMove(int R){
    return p=nx[p][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 338 ms 4708 KB Output is correct
5 Correct 51 ms 2424 KB Output is correct
6 Correct 378 ms 4980 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 333 ms 4820 KB Output is correct
4 Correct 332 ms 4728 KB Output is correct
5 Correct 338 ms 4720 KB Output is correct
6 Correct 348 ms 4596 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 353 ms 4712 KB Output is correct
5 Correct 49 ms 2460 KB Output is correct
6 Correct 404 ms 4984 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 371 ms 4728 KB Output is correct
10 Correct 336 ms 4844 KB Output is correct
11 Correct 362 ms 4820 KB Output is correct
12 Correct 357 ms 4708 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 5 ms 1024 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 4 ms 768 KB Output is correct
24 Correct 10 ms 1280 KB Output is correct
25 Correct 3 ms 1024 KB Output is correct
26 Correct 7 ms 1664 KB Output is correct
27 Correct 17 ms 2944 KB Output is correct
28 Correct 30 ms 3584 KB Output is correct
29 Correct 834 ms 7744 KB Output is correct
30 Correct 93 ms 4216 KB Output is correct
31 Correct 111 ms 4412 KB Output is correct
32 Correct 628 ms 6612 KB Output is correct
33 Correct 116 ms 4216 KB Output is correct
34 Correct 710 ms 7652 KB Output is correct
35 Correct 385 ms 5244 KB Output is correct
36 Correct 730 ms 6372 KB Output is correct
37 Correct 316 ms 3828 KB Output is correct
38 Correct 2 ms 384 KB Output is correct