Submission #1054174

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054174		shiomusubi496	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	14 ms	19036 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

std::vector<std::vector<int>> devise_strategy(int N) {
    vector<vector<int>> res(N + 1, vector<int>(N + 1));
    res[0][0] = 0;
    rep2 (i, 1, N + 1) res[i][0] = 1;
    rep2 (i, 1, N + 1) res[0][i] = i;
    rep2 (i, 1, N + 1) {
        rep2 (j, 1, N + 1) {
            if (i < j) res[i][j] = -1;
            else res[i][j] = -2;
        }
    }
    return res;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 90