Submission #1199996

#TimeUsernameProblemLanguageResultExecution timeMemory
1199996fadyscubePrisoner Challenge (IOI22_prison)C++20
0 / 100
1 ms836 KiB
#include "prison.h"

#include <vector>

using namespace std;

#define ll long long

vector<vector<int>> devise_strategy(int N) {
    vector<vector<int>> v(60, vector<int>(N+1, 0));
    for (int i = 1; i <= N; i++) {
        if (i/10 > 0)
            v[0][i] = i/10;
        else
            v[0][i] = i;
    }
    for (int i = 1; i < 60; i++) {
        v[i][0] = 1;
        for (int j = 1; j <= N; j++) {
            int k = j;
            if (j/10 > 0)
                k /= 10;
            if (k < i)
                v[i][j] = -2;
            else
                v[i][j] = -1;
        }
    }
    return v;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...