Submission #628310

#	Time	Username	Problem	Language	Result	Execution time	Memory
628310		c28dnv9q3	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	28 ms	18996 KiB

prison

#include "prison.h"
#include <vector>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
  vector<vector<int>> s(N+1, vector<int>(N+1));
  
  s[0][0] = 0; // inspect bag A
  for (int i = 1; i <= N; i++)
    s[0][i] = i; // write i on board
  
  for (int i = 1; i <= N; i++) {
    // when sees i on board
    s[i][0] = 1; // inspect bag B
    for (int j = 1; j <= N; j++) {
      // j in bag B
      s[i][j] = i < j ? -1 : -2;
    }
  }

  return s;
}

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