Submission #833609

#TimeUsernameProblemLanguageResultExecution timeMemory
833609TrumlingPrisoner Challenge (IOI22_prison)C++17
5 / 100
19 ms19028 KiB
#include "prison.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<int>> devise_strategy(int N) {

vector<vector<int>>s(N+1,vector<int>(N+1));
s[0][0]=0;
for(int i=1;i<=N;i++)
s[0][i]=i;

for(int i=1;i<=N;i++)
{
  s[i][0]=1;
  for(int j=1;j<=N;j++)
      s[i][j]=((j<=i)?-2:-1);
}
return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...