제출 #670382

#제출 시각아이디문제언어결과실행 시간메모리
670382MilosMilutinovic죄수들의 도전 (IOI22_prison)C++17
30 / 100
19 ms1748 KiB
#include "prison.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
  vector<int> seq(13, 2);
  vector<vector<int>> strategy(43, vector<int>(N + 1));
  for (int i = 0; i < 43; i++) {
    int player = (i % 3 == 0 ? 0 : 1);
    int bit = (i / 3);
    strategy[i][0] = player;
    for (int j = 1; j <= N; j++) {
      if (i == 42) {
        strategy[i][j] = 0;
        continue;
      }
      if (player == 0) {
        strategy[i][j] = i + 1 + (j >> (12 - bit) & 1);
      } else {
        int he = (i % 3) - 1;
        int me = (j >> (12 - bit) & 1);
        strategy[i][j] = (me < he ? -2 : (me > he ? -1 : 3 * (bit + 1)));
      }
    }
  }
  return strategy;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...