oj.uz

답안 #134376

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134376 2019-07-22T13:54:46 Z Kastanda 경찰관과 강도 (BOI14_coprobber) C++11
100 / 100
 785 ms 9224 KB 
// ItnoE
#include<bits/stdc++.h>
#include "coprobber.h"
using namespace std;
const int N = 505;
int n, now, P[N][N], C[N][N];
bool dp[N][N][2];
vector < int > Adj[N];
int start(int _n, bool _A[500][500])
{
    n = _n;
    for (int i = 0; i < n; i ++)
        for (int j = 0; j < n; j ++)
            if (_A[i][j])
                Adj[i].push_back(j);
    queue < tuple < int , int , int > > qu;
    for (int i = 0; i < n; i ++)
    {
        dp[i][i][0] = dp[i][i][1] = 1;
        P[i][i] = -1;
        qu.push(make_tuple(i, i, 0));
        qu.push(make_tuple(i, i, 1));
    }
    while (qu.size())
    {
        int a, b, w;
        tie(a, b, w) = qu.front();
        qu.pop();
        if (w == 1)
        {
            if (!dp[a][b][0])
            {
                dp[a][b][0] = 1;
                P[a][b] = a;
                qu.push(make_tuple(a, b, 0));
            }
            for (int u : Adj[a])
                if (!dp[u][b][0])
                {
                    dp[u][b][0] = 1;
                    P[u][b] = a;
                    qu.push(make_tuple(u, b, 0));
                }
        }
        if (w == 0)
        {
            for (int u : Adj[b])
            {
                C[a][u] ++;
                if (C[a][u] == Adj[u].size())
                {
                    dp[a][u][1] = 1;
                    qu.push(make_tuple(a, u, 1));
                }
            }
        }
    }
    for (int i = 0; i < n; i ++)
    {
        bool w = 1;
        for (int j = 0; j < n; j ++)
            w &= dp[i][j][0];
        if (w)
        {
            now = i;
            return (i);
        }
    }
    return (-1);
}
int nextMove(int v)
{
    now = P[now][v];
    return (now);
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:50:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (C[a][u] == Adj[u].size())
                     ~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 63 ms 5752 KB Output is correct
5 Correct 18 ms 2560 KB Output is correct
6 Correct 71 ms 5880 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 65 ms 5596 KB Output is correct
4 Correct 64 ms 5736 KB Output is correct
5 Correct 63 ms 5528 KB Output is correct
6 Correct 65 ms 5496 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 4 ms 1016 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 3 ms 888 KB Output is correct
19 Correct 2 ms 376 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 63 ms 5752 KB Output is correct
5 Correct 18 ms 2560 KB Output is correct
6 Correct 71 ms 5880 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 65 ms 5596 KB Output is correct
10 Correct 64 ms 5736 KB Output is correct
11 Correct 63 ms 5528 KB Output is correct
12 Correct 65 ms 5496 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 3 ms 888 KB Output is correct
23 Correct 5 ms 1016 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 4 ms 1016 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 3 ms 760 KB Output is correct
29 Correct 8 ms 1272 KB Output is correct
30 Correct 3 ms 888 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 68 ms 5676 KB Output is correct
36 Correct 19 ms 2552 KB Output is correct
37 Correct 72 ms 5880 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 64 ms 5560 KB Output is correct
41 Correct 64 ms 5752 KB Output is correct
42 Correct 63 ms 5496 KB Output is correct
43 Correct 67 ms 5476 KB Output is correct
44 Correct 3 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 504 KB Output is correct
47 Correct 2 ms 504 KB Output is correct
48 Correct 4 ms 888 KB Output is correct
49 Correct 5 ms 1016 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 4 ms 1016 KB Output is correct
53 Correct 3 ms 760 KB Output is correct
54 Correct 3 ms 760 KB Output is correct
55 Correct 8 ms 1272 KB Output is correct
56 Correct 3 ms 888 KB Output is correct
57 Correct 7 ms 1528 KB Output is correct
58 Correct 18 ms 2808 KB Output is correct
59 Correct 27 ms 3576 KB Output is correct
60 Correct 785 ms 9224 KB Output is correct
61 Correct 82 ms 4600 KB Output is correct
62 Correct 74 ms 4956 KB Output is correct
63 Correct 527 ms 7804 KB Output is correct
64 Correct 48 ms 4216 KB Output is correct
65 Correct 584 ms 9116 KB Output is correct
66 Correct 75 ms 5752 KB Output is correct
67 Correct 276 ms 7412 KB Output is correct
68 Correct 88 ms 4356 KB Output is correct
69 Correct 2 ms 376 KB Output is correct