Submission #772704

#	Time	Username	Problem	Language	Result	Execution time	Memory
772704		Magikarp4000	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	19 ms	19028 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

std::vector<std::vector<int>> devise_strategy(int n) {
    vector<vector<int>> v(n+1,vector<int>(n+1,0));
    v[0][0] = 1;
    FOR(j,1,n+1) v[0][j] = j;
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            v[i][j] = j > i ? -2 : -1;
        }
    }
    return v;
}

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