Submission #830806

#TimeUsernameProblemLanguageResultExecution timeMemory
830806NeroZeinPrisoner Challenge (IOI22_prison)C++17
5 / 100
21 ms19028 KiB
#include "prison.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
  vector<vector<int>> ret(N + 1);
  for (int i = 0; i <= N; ++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;
    } else {
      for (int j = 1; j <= i; ++j) {
        ret[i][j] = -2;
      }
      for (int j = i + 1; j <= N; ++j) {
        ret[i][j] = -1; 
      }      
    }
  }
  return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...