Submission #1140354

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140354		jhibarra	Prisoner Challenge (IOI22_prison)	C++20	5 / 100	28 ms	37960 KiB

prison

#include "prison.h"

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
  int i, j;
  std::vector<std::vector<int>> gran_vector;
for(i = 0; i < N; i++){
  std::vector<int> mini_vector;
  for(j = 0; j <= N; j++){
    if(i == 0){
      if(j == 0){
        mini_vector.push_back(0);
      }
      else if(j == 1){
        mini_vector.push_back(-1);
      }
      else if(j < N){
        mini_vector.push_back(j);
      }
      else if(j == N){
        mini_vector.push_back(-2);
      }
    }
    else {
      if(j == 0){
      mini_vector.push_back(1);
      }
      else if(i < j){
        mini_vector.push_back(-1);
      }
      else if(i > j){
        mini_vector.push_back(-2);
      }
      else {
        mini_vector.push_back(0);
      }
    }
  }
  gran_vector.push_back(mini_vector);
}
  return {gran_vector};
}

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