Submission #830788

#	Time	Username	Problem	Language	Result	Execution time	Memory
830788		NeroZein	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	468 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
  vector<vector<int>> ret(500);
  for (int i = 0; i < 500; ++i) {
    ret[i].resize(N + 1); 
    ret[i][0] = (i == 0 ? 0 : 1);
    if (i == 0) {
      for (int j = 1; j < N; ++j) ret[i][j] = j;
      ret[i][N] = -1; 
    } else {
      for (int j = 1; j <= i; ++j) {
        ret[i][j] = -1;
      }
      for (int j = i + 1; j <= N; ++j) {
        ret[i][j] = -2; 
      }      
    }
  }
  return ret;
}

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