Submission #827691

#TimeUsernameProblemLanguageResultExecution timeMemory
827691VMaksimoski008Prisoner Challenge (IOI22_prison)C++17
5 / 100
25 ms19112 KiB
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<int> > devise_strategy(int n) {
    vector<vector<int> > ans(n+1, vector<int>(n+1));

    for(int i=1; i<=n; i++) {
        ans[0][i] = i;
        ans[i][0] = 1;

        fill(ans[i].begin()+1, ans[i].begin()+i, -2);
        fill(ans[i].begin()+1+i, ans[i].end(), -1);
    }

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