oj.uz

답안 #671271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671271 2022-12-12T15:28:49 Z mdn2002 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 648 ms 9004 KB 
#include<bits/stdc++.h>
using namespace std;
int n , iswin [502][502][3] , nxt [502][502][3] , cnt [502][502] , cur;
bool a [500][500];
int start(int N, bool A [500][500])
{
    memset ( nxt , -1 , sizeof nxt );
    n = N;
    vector < pair < pair < int , int > , int > > v;
    for ( int i = 0 ; i < n ; i ++ )
    {
        int cntt = 0;
        for ( int j = 0 ; j < n ; j ++ )
        {
            cntt += A [i][j];
            a [i][j] = A [i][j];
        }
        for ( int j = 0 ; j < n ; j ++ ) cnt [j][i] = cntt;
        iswin [i][i][0] = 1;
        iswin [i][i][1] = 1;
        v . push_back ( { { i , i } , 0 } );
        v . push_back ( { { i , i } , 1 } );
    }

    while ( v . size () )
    {
        int did = 0;
        pair < pair < int , int > , int > p = * -- v . end ();
        v . pop_back ();
        int i = p . first . first , j = p . first . second , z = p . second;
        for ( int k = 0 ; k < n ; k ++ )
        {
            int nx = i , ny = j , can = 0 , zz = z ^ 1;
            if ( zz == 1 )
            {
                ny = k;
                if ( a [j][k] ) can = 1;
            }
            else
            {
                nx = k;
                if ( a [i][k] ) can = 1;
            }
            if ( zz == 0 && i == k ) can = 1;
            if ( can == 0 || iswin [nx][ny][zz] ) continue;
            if ( zz == 0 )
            {
                iswin [nx][ny][zz] = 1;
                nxt [nx][ny][zz] = i;
                v . push_back ( { { nx , ny } , zz } );
            }
            else
            {
                cnt [nx][ny] --;
                if ( cnt [nx][ny] == 0 )
                {
                    nxt [nx][ny][zz] = j;
                    iswin [nx][ny][zz] = 1;
                    v . push_back ( { { nx , ny } , zz } );
                }
            }
        }
    }
    for ( int i = 0 ; i < n ; i ++ )
    {
        int num = 0;
        for ( int j = 0 ; j < n ; j ++ )
        {
            if ( iswin [i][j][0] ) num ++;
        }
        if ( num == n )
        {
            cur = i;
            return i;
        }
    }
    return -1;
}


int nextMove(int R) {
    if ( cur == -1 ) return -1;
    cur = nxt [cur][R][0];
    return cur;
}

/*
int main()
{
    cin >> n;
    for ( int i = 0 ; i < n ; i ++ )
    {
        for ( int j = 0 ; j < n ; j ++ ) cin >> a [i][j];
    }

    cout << start ( n , a ) << endl;
    for ( int i = 0 ; i < n ; i ++ )
    {
        for ( int j = 0 ; j < n ; j ++ )
        {
            if ( iswin [i][j] ) cout << ' ' << i << ' ' << j << endl;
        }
    }
    while ( true )
    {
        int x;
        cin >> x;
        cout << ' ' << nextMove ( x ) << endl;
    }
}
*/

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:27:13: warning: unused variable 'did' [-Wunused-variable]
   27 |         int did = 0;
      |             ^~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3280 KB Output is correct
2 Correct 2 ms 3280 KB Output is correct
3 Correct 2 ms 3280 KB Output is correct
4 Correct 278 ms 9000 KB Output is correct
5 Correct 41 ms 5840 KB Output is correct
6 Correct 327 ms 8672 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3280 KB Output is correct
2 Correct 1 ms 3280 KB Output is correct
3 Correct 288 ms 8608 KB Output is correct
4 Correct 284 ms 8796 KB Output is correct
5 Correct 281 ms 8512 KB Output is correct
6 Correct 297 ms 8744 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3280 KB Output is correct
2 Correct 1 ms 3280 KB Output is correct
3 Correct 2 ms 3280 KB Output is correct
4 Correct 1 ms 3280 KB Output is correct
5 Correct 1 ms 3280 KB Output is correct
6 Correct 2 ms 3280 KB Output is correct
7 Correct 1 ms 3280 KB Output is correct
8 Correct 1 ms 3280 KB Output is correct
9 Correct 2 ms 3408 KB Output is correct
10 Correct 3 ms 4048 KB Output is correct
11 Correct 4 ms 4048 KB Output is correct
12 Correct 2 ms 3408 KB Output is correct
13 Correct 2 ms 3792 KB Output is correct
14 Correct 4 ms 4048 KB Output is correct
15 Correct 3 ms 3708 KB Output is correct
16 Correct 3 ms 3664 KB Output is correct
17 Correct 9 ms 4304 KB Output is correct
18 Correct 2 ms 3920 KB Output is correct
19 Correct 1 ms 3280 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3280 KB Output is correct
2 Correct 2 ms 3280 KB Output is correct
3 Correct 2 ms 3280 KB Output is correct
4 Correct 278 ms 9000 KB Output is correct
5 Correct 41 ms 5840 KB Output is correct
6 Correct 327 ms 8672 KB Output is correct
7 Correct 1 ms 3280 KB Output is correct
8 Correct 1 ms 3280 KB Output is correct
9 Correct 288 ms 8608 KB Output is correct
10 Correct 284 ms 8796 KB Output is correct
11 Correct 281 ms 8512 KB Output is correct
12 Correct 297 ms 8744 KB Output is correct
13 Correct 1 ms 3280 KB Output is correct
14 Correct 1 ms 3280 KB Output is correct
15 Correct 2 ms 3280 KB Output is correct
16 Correct 1 ms 3280 KB Output is correct
17 Correct 1 ms 3280 KB Output is correct
18 Correct 2 ms 3280 KB Output is correct
19 Correct 1 ms 3280 KB Output is correct
20 Correct 1 ms 3280 KB Output is correct
21 Correct 2 ms 3408 KB Output is correct
22 Correct 3 ms 4048 KB Output is correct
23 Correct 4 ms 4048 KB Output is correct
24 Correct 2 ms 3408 KB Output is correct
25 Correct 2 ms 3792 KB Output is correct
26 Correct 4 ms 4048 KB Output is correct
27 Correct 3 ms 3708 KB Output is correct
28 Correct 3 ms 3664 KB Output is correct
29 Correct 9 ms 4304 KB Output is correct
30 Correct 2 ms 3920 KB Output is correct
31 Correct 1 ms 3280 KB Output is correct
32 Correct 1 ms 3280 KB Output is correct
33 Correct 1 ms 3280 KB Output is correct
34 Correct 1 ms 3280 KB Output is correct
35 Correct 293 ms 9004 KB Output is correct
36 Correct 45 ms 5840 KB Output is correct
37 Correct 308 ms 8672 KB Output is correct
38 Correct 2 ms 3280 KB Output is correct
39 Correct 1 ms 3280 KB Output is correct
40 Correct 271 ms 8624 KB Output is correct
41 Correct 280 ms 8804 KB Output is correct
42 Correct 280 ms 8612 KB Output is correct
43 Correct 291 ms 8652 KB Output is correct
44 Correct 2 ms 3280 KB Output is correct
45 Correct 2 ms 3280 KB Output is correct
46 Correct 1 ms 3280 KB Output is correct
47 Correct 1 ms 3408 KB Output is correct
48 Correct 3 ms 4048 KB Output is correct
49 Correct 4 ms 4048 KB Output is correct
50 Correct 2 ms 3408 KB Output is correct
51 Correct 2 ms 3792 KB Output is correct
52 Correct 5 ms 4048 KB Output is correct
53 Correct 3 ms 3764 KB Output is correct
54 Correct 3 ms 3664 KB Output is correct
55 Correct 9 ms 4304 KB Output is correct
56 Correct 3 ms 3920 KB Output is correct
57 Correct 5 ms 4944 KB Output is correct
58 Correct 14 ms 6752 KB Output is correct
59 Correct 33 ms 7588 KB Output is correct
60 Correct 585 ms 8692 KB Output is correct
61 Correct 100 ms 7172 KB Output is correct
62 Correct 101 ms 7716 KB Output is correct
63 Correct 603 ms 8844 KB Output is correct
64 Correct 106 ms 7712 KB Output is correct
65 Correct 631 ms 8716 KB Output is correct
66 Correct 320 ms 8536 KB Output is correct
67 Correct 648 ms 8724 KB Output is correct
68 Correct 270 ms 7712 KB Output is correct
69 Correct 2 ms 3280 KB Output is correct