Submission #1223716

#TimeUsernameProblemLanguageResultExecution timeMemory
1223716trimkusPrisoner Challenge (IOI22_prison)C++20
5 / 100
14 ms19096 KiB
#include "prison.h"

#include <bits/stdc++.h>
using namespace std;
std::vector<std::vector<int>> devise_strategy(int N) {
  vector<vector<int>> res(N + 1, vector<int>(N + 1));
  res[0][1] = -1;
  res[0][N] = -2;
  for (int i = 2; i < N; ++i) {
    res[0][i] = i - 1;
  }
  for (int i = 1; i <= N; ++i) {
      res[i][0] = 1;
      for (int j = 1; j <= i; ++j) {
        res[i][j] = -2;
      }
      for (int j = i + 1; j <= N; ++j) {
        res[i][j] = -1;
      }
  }
  // for (auto& u : res) {
  //   for (auto& i : u) {
  //     cout << i << " ";
  //   }
  //   cout << "\n";
  // }
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...