| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 858661 | MasterDobby | Prisoner Challenge (IOI22_prison) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include < "prison.h">
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
using namespace std;
using ll = long long;
int[][] devise_strategy(int N){
int ans[505][N+5];
memset(ans,0,sizeof ans);
for(int i=1;i<=N;i++) ans[0][i]=i;
for(int i=1;i<=500;i++){
for(int j=1;j<=N;j++){
if(i>j) ans[i][j]=-1;
else ans[i][j]=-2;
}
}
return ans;
}