Submission #1181235

#TimeUsernameProblemLanguageResultExecution timeMemory
1181235madamadam3Prisoner Challenge (IOI22_prison)C++20
5 / 100
14 ms19012 KiB
#include "prison.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;

vvi devise_strategy(int N) {
  int X = N;
  vvi s(X+1, vi(N+1, 0));
  
  for (int i = 0; i <= X; i++) {
    s[i][0] = i == 0 ? 0 : 1;
    
    for (int j = 1; j <= N; j++) {
      if (i == 0) {
        s[i][j] = j;
      } else if (i == j) { 
        s[i][j] = -1;
      } else {
        s[i][j] = i < j ? -1 : -2;
      }
    }
    
  }

  return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...