Submission #670384

#	Time	Username	Problem	Language	Result	Execution time	Memory
670384		MilosMilutinovic	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	212 KiB

prison

#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(37, vector<int>(N + 1));
  for (int i = 0; i < 37; 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 == 36) {
        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;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90