# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638207 | blue | 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 "prison.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
vvi devise_strategy(int N)
{
vvi s(1+N, vi(1+N, -1));
s[0][0] = 0;
for(int i = 1; i <= N; i++)
s[i][0] = 1;
for(int i = 1; i <= N; i++)
{
for(int j = 1; j <= N; j++)
{
if(i < j)
s[i][j] = -1;
else
s[i][j] = -2;
}
}
return res;
}