Submission #1321191

#TimeUsernameProblemLanguageResultExecution timeMemory
1321191mirasmPrisoner Challenge (IOI22_prison)C++20
5 / 100
16 ms19016 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));
        ans[0][0] = 0;
        for (int i = 1; i <= n; i++) {
                ans[0][i] = i;
        }
        for (int i = 1; i <= n; i++) {
                ans[i][0] = 1;
                for (int j = 1; j <= n; j++) {
                        if (i < j) {
                                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...