Submission #1321335

#TimeUsernameProblemLanguageResultExecution timeMemory
1321335metall1caPrisoner Challenge (IOI22_prison)C++20
5 / 100
13 ms19232 KiB
#include "prison.h"
#include <bits/stdc++.h>
#define ll int
using namespace std;
std::vector<std::vector<int>> devise_strategy(int N) {
  vector<vector<ll>> s(N+1,vector<ll> (N+1));
    for(ll i=0;i<=N;i++)
    {
        s[0][i]=i;
        if(i>=1)
        {
            s[i][0]=1;
        }
    }
    for(ll i=1;i<=N;i++)
    {
        for(ll j=1;j<=N;j++)
        {
            if(i<=j)
            {
                s[i][j]=-1;
            }
            else
            {
                s[i][j]=-2;
            }
        }
    }
    return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...