oj.uz

Submission #24462

# Submission time Handle Problem Language Result Execution time Memory
24462 2017-06-09T07:29:26 Z noobprogrammer Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1069 ms 11256 KB 
#include<bits/stdc++.h>
#include "coprobber.h"
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define ii pair<int,int>
#define vii vector<pair<int,int> >
#define vi vector<int>
// const int MAX_N = 500 ;

struct node{
    int  co , ro , nw ;
} ;

bool wn[505][505][2] ;
int lft[505][505][2] , nmv[505][505][2] , visited[505][505][2] ; // [cop][rob] ; 1 = rob ; 0 =  cop
int pos = -1 ;

int start(int n, bool A[MAX_N][MAX_N])
{
    queue<node> q ;
    for(int i=0;i<n;i++){
        int cnt = 0 ;
        for(int j=0;j<n;j++) cnt+= (int)A[i][j] ;
        for(int j=0;j<n;j++){
            lft[i][j][0] = 1 ;
            lft[j][i][1] = cnt ;
        }
        for(int j=0;j<2;j++ ) wn[i][i][j] = 1 , q.push({i,i,j}) , lft[i][i][j] = 0 , nmv[i][i][j] = i ;
    }
    int r , c , tr , nxt ;
    while(!q.empty()){
        r = q.front().ro ; c = q.front().co ; tr = q.front().nw ; nxt = 1-tr ;
        q.pop() ;
        if(visited[c][r][tr]) continue ;
        visited[c][r][tr] = 1 ;
        if(!tr){
            for(int i = 0 ;i<n;i++){
                if(!A[r][i]) continue ;
                if(visited[c][i][nxt]) continue ;
                lft[c][i][nxt]-- ;
                if(lft[c][i][nxt]) continue ;
                wn[c][i][nxt] = 1  ;
                q.push({c,i,nxt}) ;
            }
        }
        else{
            for(int i = 0 ;i<n;i++){
                if(!A[c][i] && i!=c ) continue ;
                if(visited[i][r][nxt]) continue ;
                lft[i][r][nxt]-- ;
                if(lft[i][r][nxt]) continue ;
                wn[i][r][nxt] = 1 ;
                nmv[i][r][nxt] = c ;
                q.push({i,r,nxt}) ;
            }
        }
    }

    for(int i=0;i<n;i++) {
        bool chk = 1 ;
        for(int j=0;j<n;j++) chk = chk & wn[i][j][1] ;
        if(!chk) continue ;
        pos = i ;
        break ;
    }
    return pos ;
}

int nextMove(int R)
{
    return pos = nmv[pos][R][0] ;
}

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 512 KB Output is correct
4 Correct 295 ms 8312 KB Output is correct
5 Correct 49 ms 4088 KB Output is correct
6 Correct 380 ms 8536 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 300 ms 8100 KB Output is correct
4 Correct 276 ms 8184 KB Output is correct
5 Correct 300 ms 7960 KB Output is correct
6 Correct 299 ms 8056 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 512 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 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 4 ms 1708 KB Output is correct
11 Correct 5 ms 1792 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 3 ms 1280 KB Output is correct
14 Correct 5 ms 1664 KB Output is correct
15 Correct 4 ms 1152 KB Output is correct
16 Correct 3 ms 1152 KB Output is correct
17 Correct 11 ms 1920 KB Output is correct
18 Correct 3 ms 1664 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 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 285 ms 8284 KB Output is correct
5 Correct 45 ms 4216 KB Output is correct
6 Correct 363 ms 8468 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 297 ms 8184 KB Output is correct
10 Correct 275 ms 8288 KB Output is correct
11 Correct 303 ms 7960 KB Output is correct
12 Correct 305 ms 8024 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 7 ms 1664 KB Output is correct
18 Correct 5 ms 1792 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 3 ms 1280 KB Output is correct
21 Correct 6 ms 1664 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1152 KB Output is correct
24 Correct 12 ms 1920 KB Output is correct
25 Correct 4 ms 1664 KB Output is correct
26 Correct 7 ms 3048 KB Output is correct
27 Correct 20 ms 5760 KB Output is correct
28 Correct 32 ms 7040 KB Output is correct
29 Correct 441 ms 11256 KB Output is correct
30 Correct 172 ms 7416 KB Output is correct
31 Correct 150 ms 8056 KB Output is correct
32 Correct 646 ms 9968 KB Output is correct
33 Correct 134 ms 7672 KB Output is correct
34 Correct 965 ms 10832 KB Output is correct
35 Correct 403 ms 8568 KB Output is correct
36 Correct 1069 ms 9888 KB Output is correct
37 Correct 323 ms 7628 KB Output is correct
38 Correct 2 ms 512 KB Output is correct