Submission #1140353

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140353		SpartanCode	Prisoner Challenge (IOI22_prison)	C++20	5 / 100	13 ms	19012 KiB

prison

#include "prison.h"

#include <vector>
using namespace std;

std::vector<std::vector<int>> devise_strategy(int N) {
  vector<vector<int>> vec;
  vec.resize(N-1, vector<int> (N+1, 0));

  vec[0][0] = 0;
  for(int i = 2; i <= N-1; i++)
    vec[0][i] = i-1;
  vec[0][1] = -1; vec[0][N] = -2;

  for(int i = 1; i <= N-2; i++)
  {
    vec[i][0] = 1;
    for(int j = 1; j <= i; j++)
      vec[i][j] = -2;
    for(int j = i+1; j <= N; j++)
      vec[i][j] = -1;
  }
  return vec;
}

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