Submission #915475

#TimeUsernameProblemLanguageResultExecution timeMemory
915475NamkhingPrisoner Challenge (IOI22_prison)C++17
5 / 100
20 ms19036 KiB
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;

vvi devise_strategy(int N) {
    vvi report(N + 1, vi(N + 1));

    report[0][0] = 0;

    for (int i = 1; i <= N; i++) {
        report[0][i] = i;
    }

    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) {
            report[i][j] = (i < j) ? -1 : -2;
        }
        report[i][0] = 1;
    }

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