oj.uz

Submission #24319

# Submission time Handle Problem Language Result Execution time Memory
24319 2017-06-04T21:10:03 Z Bruteforceman Cop and Robber (BOI14_coprobber) C++11
100 / 100
 815 ms 7768 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 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 327 ms 4712 KB Output is correct
5 Correct 49 ms 2552 KB Output is correct
6 Correct 381 ms 5112 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 512 KB Output is correct
3 Correct 331 ms 5056 KB Output is correct
4 Correct 342 ms 4832 KB Output is correct
5 Correct 340 ms 4736 KB Output is correct
6 Correct 348 ms 4856 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 5 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 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 896 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 9 ms 1280 KB Output is correct
18 Correct 3 ms 896 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 326 ms 4792 KB Output is correct
5 Correct 52 ms 2432 KB Output is correct
6 Correct 381 ms 4984 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 348 ms 4828 KB Output is correct
10 Correct 339 ms 4856 KB Output is correct
11 Correct 344 ms 4788 KB Output is correct
12 Correct 455 ms 4728 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 4 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 3 ms 740 KB Output is correct
24 Correct 9 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 19 ms 3072 KB Output is correct
28 Correct 33 ms 3628 KB Output is correct
29 Correct 703 ms 7768 KB Output is correct
30 Correct 94 ms 4212 KB Output is correct
31 Correct 95 ms 4344 KB Output is correct
32 Correct 627 ms 6852 KB Output is correct
33 Correct 118 ms 4092 KB Output is correct
34 Correct 725 ms 7548 KB Output is correct
35 Correct 399 ms 5348 KB Output is correct
36 Correct 815 ms 6508 KB Output is correct
37 Correct 345 ms 3988 KB Output is correct
38 Correct 2 ms 384 KB Output is correct