Submission #1070107

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070107		c2zi6	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	20 ms	19224 KiB

prison

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "prison.h"

int n;

VVI devise_strategy(int N) {n = N;
    /* ans[i][j]
     * grataxtakin ktesni i
     * meshoki mej ktesni j
     */
    VVI ans(n+1, VI(n+1));
    
    ans[0][0] = 0;
    replr(i, 1, n) ans[i][0] = 1;

    replr(j, 1, n) ans[0][j] = j;
    replr(i, 1, n) {
        replr(j, 1, n) {
            ans[i][j] = (j > i ? -1 : -2);
        }
    }

    return ans;
}

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