oj.uz

답안 #69720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69720 2018-08-21T12:01:47 Z doowey 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 461 ms 10596 KB 
#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

#define MAX_N 500

struct Pos{
  int cop_x;
  int robber_x;
  int next_move;
  /* 0 - cop
   * 1 - robber
   */
};

int dp[MAX_N][MAX_N][2];
int nex[MAX_N][MAX_N][2];
int req[MAX_N][MAX_N][2];
int deg[MAX_N];

int go;

int start(int N, bool A[MAX_N][MAX_N]) {
  for(int i = 0;i < N;i ++ ){
    for(int j = 0;j < N; j ++ ){
      deg[i] += A[i][j];
    }
  }
  for(int i = 0;i < MAX_N;i ++ ){
    for(int j = 0;j < MAX_N;j ++ ){
      nex[i][j][0] = -1;
      nex[i][j][1] = -1;
      req[i][j][1] = deg[j];
    }
  }
  queue<Pos> state;
  for(int i = 0;i < N; i ++ ){
    state.push({i, i, 0});
    state.push({i, i, 1});
    dp[i][i][0] = 1;
    dp[i][i][1] = 1;
  }
  Pos cur;
  int cop, robber, nx;
  while(!state.empty()){
    cur = state.front();
    cop = cur.cop_x;
    robber = cur.robber_x;
    nx = cur.next_move;
    state.pop();
    if(nx == 1){
      for(int j = 0; j < N; j ++ ){
        if(A[cop][j] or cop == j){
          if(dp[j][robber][0] == 0){
            dp[j][robber][0] = 1;
            nex[j][robber][0] = cop;
            state.push({j, robber, 0});
          }
        }
      }
    }
    else{
      for(int j = 0;j < N ; j ++ ){
        if(A[robber][j] and robber != j){
          if(dp[cop][j][1] == 0){
            req[cop][j][1] -- ;
            if(req[cop][j][1] == 0){
              dp[cop][j][1] = 1;
              state.push({cop, j, 1});
            }
          }
        }
      }
    }
  }
  bool ok = false;
  go = -1;
  for(int i = 0;i < N ; i ++ ){
    ok = true;
    for(int j = 0;j < N; j ++) {
      if(dp[i][j][0] == 0)
        ok = false;
    }
    if(ok){
      go = i;
      break;
    }
  }
  return go;
  
}

int nextMove(int R) {
  return go = nex[go][R][0];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 5 ms 4224 KB Output is correct
3 Correct 6 ms 4352 KB Output is correct
4 Correct 252 ms 7636 KB Output is correct
5 Correct 42 ms 5880 KB Output is correct
6 Correct 321 ms 7880 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 6 ms 4352 KB Output is correct
3 Correct 263 ms 7720 KB Output is correct
4 Correct 248 ms 7648 KB Output is correct
5 Correct 249 ms 7588 KB Output is correct
6 Correct 249 ms 7544 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 5 ms 4352 KB Output is correct
3 Correct 5 ms 4352 KB Output is correct
4 Correct 5 ms 4224 KB Output is correct
5 Correct 5 ms 4352 KB Output is correct
6 Correct 5 ms 4352 KB Output is correct
7 Correct 5 ms 4352 KB Output is correct
8 Correct 6 ms 4352 KB Output is correct
9 Correct 5 ms 4352 KB Output is correct
10 Correct 7 ms 4736 KB Output is correct
11 Correct 8 ms 4732 KB Output is correct
12 Correct 5 ms 4352 KB Output is correct
13 Correct 6 ms 4656 KB Output is correct
14 Correct 9 ms 4736 KB Output is correct
15 Correct 7 ms 4608 KB Output is correct
16 Correct 6 ms 4608 KB Output is correct
17 Correct 11 ms 4992 KB Output is correct
18 Correct 6 ms 4736 KB Output is correct
19 Correct 5 ms 4224 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 5 ms 4224 KB Output is correct
3 Correct 5 ms 4352 KB Output is correct
4 Correct 246 ms 7644 KB Output is correct
5 Correct 45 ms 5880 KB Output is correct
6 Correct 389 ms 7872 KB Output is correct
7 Correct 5 ms 4224 KB Output is correct
8 Correct 5 ms 4352 KB Output is correct
9 Correct 262 ms 7684 KB Output is correct
10 Correct 241 ms 7604 KB Output is correct
11 Correct 294 ms 7572 KB Output is correct
12 Correct 254 ms 7596 KB Output is correct
13 Correct 5 ms 4224 KB Output is correct
14 Correct 5 ms 4224 KB Output is correct
15 Correct 4 ms 4352 KB Output is correct
16 Correct 4 ms 4352 KB Output is correct
17 Correct 6 ms 4736 KB Output is correct
18 Correct 7 ms 4736 KB Output is correct
19 Correct 5 ms 4352 KB Output is correct
20 Correct 6 ms 4580 KB Output is correct
21 Correct 7 ms 4736 KB Output is correct
22 Correct 7 ms 4736 KB Output is correct
23 Correct 6 ms 4608 KB Output is correct
24 Correct 11 ms 4992 KB Output is correct
25 Correct 6 ms 4608 KB Output is correct
26 Correct 9 ms 5176 KB Output is correct
27 Correct 18 ms 6016 KB Output is correct
28 Correct 28 ms 6492 KB Output is correct
29 Correct 399 ms 10596 KB Output is correct
30 Correct 76 ms 7288 KB Output is correct
31 Correct 78 ms 7288 KB Output is correct
32 Correct 389 ms 9480 KB Output is correct
33 Correct 85 ms 7016 KB Output is correct
34 Correct 430 ms 10240 KB Output is correct
35 Correct 321 ms 8192 KB Output is correct
36 Correct 461 ms 9252 KB Output is correct
37 Correct 214 ms 6820 KB Output is correct
38 Correct 5 ms 4224 KB Output is correct