제출 #398221

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
398221	2021-05-04 00:57:31	mars	경찰관과 강도 (BOI14_coprobber)	C++14	60 / 100	3080 ms	9000 KiB

coprobber

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "coprobber.h"
#include <queue>
#include <tuple>
using namespace std;
typedef tuple<int, int, int> Position;
const int COP = 0, ROBBER = 1;
bool CopWins[2][MAX_N][MAX_N];
int NextPos[MAX_N][MAX_N];
int start(int N, bool A[MAX_N][MAX_N]) {
  queue<Position> q;
  for (int i = 0; i < N; i++) {
    q.push(Position(COP, i, i));
    q.push(Position(ROBBER, i, i));
    CopWins[COP][i][i] = true;
    CopWins[ROBBER][i][i] = true;
  }
  
  while (!q.empty()) {
    int t, c, r;
    tie(t, c, r) = q.front();
    q.pop();
    if (t == COP) {
      for (int n = 0; n < N; n++)
        if (A[r][n] && !CopWins[ROBBER][c][n]) {
          bool all = true;
          for (int i = 0; i < N; i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 16 / 16
• Subtask 2: 14 / 14
• Subtask 3: 30 / 30
• Subtask 4: 0 / 40