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;
typedef long long ll;
typedef long double ld;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
vector<vector<int>> wyn;
vector<vector<int>> devise_strategy(int N)
{
wyn.assign(N+1,{});
rep(i,N+1) wyn[i].assign(N+1,-1);
wyn[0][0] = 0;
for(int i = 1; i <= N; ++i) wyn[0][i] = i;
for(int i = 1; i <= N; ++i)
{
wyn[i][0] = 1;
for(int j = 1; j <= N; ++j)
{
if(i < j) wyn[i][j] = -1;
else wyn[i][j] = -2;
}
}
return wyn;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |