oj.uz

답안 #91281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
91281 2018-12-26T23:12:30 Z Mohammad_Yasser 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 449 ms 5216 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 505;

vector<int> adj[N];

int nxt[N][N];
bool vis[N][N][2];
int losing_children[N][N];

int current = 0;

void dfs(int cop, int robber, bool cop_turn) {
  if (cop_turn) {
    if (!vis[cop][robber][false]) {
      vis[cop][robber][false] = true;
      nxt[cop][robber] = cop;
      dfs(cop, robber, false);
    }

    for (int v : adj[cop]) {
      if (!vis[v][robber][false]) {
        vis[v][robber][false] = true;
        nxt[v][robber] = cop;
        dfs(v, robber, false);
      }
    }
  } else {
    for (int v : adj[robber]) {
      if (++losing_children[cop][v] == adj[v].size()) {
        dfs(cop, v, true);
      }
    }
  }
}

int start(int n, bool A[MAX_N][MAX_N]) {
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (A[i][j]) {
        adj[i].push_back(j);
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    vis[i][i][true] = true;
    dfs(i, i, true);
  }

  for (int i = 0; i < n; ++i) {
    bool valid = true;
    for (int j = 0; j < n; ++j) {
      valid &= vis[i][j][false];
    }
    if (valid) {
      current = i;
      return i;
    }
  }
  return -1;
}

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

Compilation message

coprobber.cpp: In function 'void dfs(int, int, bool)':
coprobber.cpp:32:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if (++losing_children[cop][v] == adj[v].size()) {
           ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 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 53 ms 4316 KB Output is correct
5 Correct 15 ms 2176 KB Output is correct
6 Correct 57 ms 4088 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 53 ms 4200 KB Output is correct
4 Correct 53 ms 4464 KB Output is correct
5 Correct 50 ms 4088 KB Output is correct
6 Correct 51 ms 4288 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 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 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 896 KB Output is correct
11 Correct 3 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 4 ms 896 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 740 KB Output is correct
17 Correct 6 ms 1024 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 2 ms 256 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 52 ms 4344 KB Output is correct
5 Correct 15 ms 2176 KB Output is correct
6 Correct 58 ms 4036 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 55 ms 4216 KB Output is correct
10 Correct 53 ms 4216 KB Output is correct
11 Correct 54 ms 4088 KB Output is correct
12 Correct 54 ms 4316 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 896 KB Output is correct
18 Correct 4 ms 896 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 6 ms 1152 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 6 ms 1408 KB Output is correct
27 Correct 16 ms 2560 KB Output is correct
28 Correct 23 ms 3064 KB Output is correct
29 Correct 449 ms 5216 KB Output is correct
30 Correct 47 ms 3200 KB Output is correct
31 Correct 45 ms 3576 KB Output is correct
32 Correct 306 ms 5040 KB Output is correct
33 Correct 34 ms 3192 KB Output is correct
34 Correct 348 ms 5152 KB Output is correct
35 Correct 61 ms 3960 KB Output is correct
36 Correct 200 ms 4600 KB Output is correct
37 Correct 65 ms 3328 KB Output is correct
38 Correct 2 ms 384 KB Output is correct