Submission #858675

#TimeUsernameProblemLanguageResultExecution timeMemory
858675MasterDobbyPrisoner Challenge (IOI22_prison)C++17
5 / 100
18 ms2144 KiB
#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;

vector<vector<int>> devise_strategy(int N){
    vector<vector<int>> ans(501,vector<int>(N+1));
    ans[0][0]=0;
    for(int i=1;i<=500;i++) ans[i][0]=1;
    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(j>i) ans[i][j]=-1;
            else ans[i][j]=-2;
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...