Submission #774074

#TimeUsernameProblemLanguageResultExecution timeMemory
774074jasminPrisoner Challenge (IOI22_prison)C++17
0 / 100
1 ms296 KiB
#include "prison.h"
#include<bits/stdc++.h>
using namespace std;

std::vector<std::vector<int>> devise_strategy(int n) {

    vector<vector<int> > ans(n+1, vector<int> (n+1, -1));
    
    ans[0][0]=0;
    for(int i=1; i<=n; i++){
        ans[i][0]=1;
    }

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){

            if(j<i){
                ans[i][j]=-2;
            }
            else{
                ans[i][j]=-1;
            }

        }
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...