Submission #1140326

#TimeUsernameProblemLanguageResultExecution timeMemory
1140326JuanchokiPrisoner Challenge (IOI22_prison)C++20
0 / 100
1 ms1352 KiB
#include "prison.h"

#include <vector>
using namespace std;
vector<vector<int>> devise_strategy(int N) 
{
  vector<vector<int>> resp(501, vector<int> (501)) ;
  for (int i = 0; i < 501; i++)
  {
    resp[0][i] = i;
  }
  resp[0][0] = 0;
  for (int j = 0; j < 501; j++)
  {
    for (int k = 1; k < 501; k++)
    {
      if (k<j)
      {
          resp[j][k]=-2;
      }
      else 
        resp[j][k]=-1;
    }
  }
  return resp;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...