oj.uz

Submission #625094

# Submission time Handle Problem Language Result Execution time Memory
625094 2022-08-09T10:42:19 Z chonka Cop and Robber (BOI14_coprobber) C++17
100 / 100
 521 ms 8080 KB 
#include<bits/stdc++.h>
#include "coprobber.h"


int n ;
int a[ MAX_N ][ MAX_N ] , deg[ MAX_N ] ;
int cnt[ MAX_N ][ MAX_N ] ;
bool dp[ MAX_N ][ MAX_N ][ 2 ] ;
bool done[ MAX_N ][ MAX_N ][ 2 ] ;
int nxt[ MAX_N ][ MAX_N ] ;

struct el {
    int x , y , type ;
    el ( ) { x = y = type = 0 ; }
    el ( int _x , int _y , int _type ) {
        x = _x , y = _y , type = _type ;
    }
};

int wh ;

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 ] ;
            if ( a[ i ][ j ] == 1 ) {
                ++ deg[ i ] ;
            }
        }
    }
    std :: queue < el > q ;
    for ( int i = 0 ; i < n ; ++ i ) {
        q.push ( el ( i , i , 0 ) ) ;
        q.push ( el ( i , i , 1 ) ) ;
        dp[ i ][ i ][ 0 ] = dp[ i ][ i ][ 1 ] = true ;
    }
    while ( q.empty ( ) == false ) {
        auto [ x , y , id ] = q.front ( ) ;
        q.pop ( ) ;
        for ( int z = 0 ; z < n ; ++ z ) {
            if ( id == 0 ) {
                if ( a[ y ][ z ] == 1 ) { 
                    ++ cnt[ x ][ z ] ;
                    if ( cnt[ x ][ z ] == deg[ z ] ) {
                        dp[ x ][ z ][ 1 ] = true ;
                        q.push ( el ( x , z , 1 ) ) ;
                    }
                }
            }
            else {
                if ( a[ x ][ z ] == 1 ) { 
                    if ( dp[ z ][ y ][ 0 ] == false ) {
                        dp[ z ][ y ][ 0 ] = true ;
                        nxt[ z ][ y ] = x ;
                        q.push ( el ( z , y , 0 ) ) ;
                    }
                }
            }
        }
        if ( id == 1 && dp[ x ][ y ][ 0 ] == false ) {
            dp[ x ][ y ][ 0 ] = true ;
            nxt[ x ][ y ] = x ;
            q.push ( el ( x , y , 0 ) ) ;
        }
    }
    for ( int i = 0 ; i < n ; ++ i ) {
        int hh = 0 ;
        for ( int j = 0 ; j < n ; ++ j ) {
            if ( dp[ i ][ j ][ 0 ] == true ) { ++ hh ; }
        }
        if ( hh == n ) { wh = i ; return i ; }
    }
    return -1 ;
}

int nextMove ( int R ) {
    wh = nxt[ wh ][ R ] ;
    return wh ;
}

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 336 KB Output is correct
4 Correct 293 ms 5072 KB Output is correct
5 Correct 45 ms 2604 KB Output is correct
6 Correct 348 ms 5444 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 336 KB Output is correct
3 Correct 301 ms 5076 KB Output is correct
4 Correct 303 ms 5192 KB Output is correct
5 Correct 288 ms 5028 KB Output is correct
6 Correct 329 ms 4968 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 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 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 336 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 976 KB Output is correct
11 Correct 3 ms 1104 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 3 ms 976 KB Output is correct
15 Correct 2 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 6 ms 1360 KB Output is correct
18 Correct 1 ms 976 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 336 KB Output is correct
4 Correct 293 ms 5072 KB Output is correct
5 Correct 45 ms 2604 KB Output is correct
6 Correct 348 ms 5444 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 301 ms 5076 KB Output is correct
10 Correct 303 ms 5192 KB Output is correct
11 Correct 288 ms 5028 KB Output is correct
12 Correct 329 ms 4968 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 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 336 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 976 KB Output is correct
23 Correct 3 ms 1104 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 2 ms 848 KB Output is correct
26 Correct 3 ms 976 KB Output is correct
27 Correct 2 ms 720 KB Output is correct
28 Correct 2 ms 720 KB Output is correct
29 Correct 6 ms 1360 KB Output is correct
30 Correct 1 ms 976 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 313 ms 5072 KB Output is correct
36 Correct 46 ms 2632 KB Output is correct
37 Correct 313 ms 5368 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 296 ms 5296 KB Output is correct
41 Correct 305 ms 5088 KB Output is correct
42 Correct 284 ms 5052 KB Output is correct
43 Correct 306 ms 5208 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 1 ms 976 KB Output is correct
49 Correct 2 ms 1104 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 848 KB Output is correct
52 Correct 3 ms 976 KB Output is correct
53 Correct 1 ms 720 KB Output is correct
54 Correct 2 ms 720 KB Output is correct
55 Correct 8 ms 1360 KB Output is correct
56 Correct 2 ms 976 KB Output is correct
57 Correct 5 ms 1744 KB Output is correct
58 Correct 15 ms 3152 KB Output is correct
59 Correct 22 ms 4016 KB Output is correct
60 Correct 355 ms 8080 KB Output is correct
61 Correct 93 ms 4484 KB Output is correct
62 Correct 89 ms 4832 KB Output is correct
63 Correct 506 ms 6900 KB Output is correct
64 Correct 100 ms 4560 KB Output is correct
65 Correct 521 ms 7864 KB Output is correct
66 Correct 321 ms 5596 KB Output is correct
67 Correct 507 ms 6856 KB Output is correct
68 Correct 235 ms 4352 KB Output is correct
69 Correct 0 ms 336 KB Output is correct