Submission #645844

#	Time	Username	Problem	Language	Result	Execution time	Memory
645844		ymm	Prisoner Challenge (IOI22_prison)	C++17	36.50 / 100	19 ms	1868 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int BITS = 13;

std::vector<std::vector<int>> devise_strategy(int N) {
	vector<vector<int>> ans(BITS*3+1);
	Loop (i,0,BITS) {
		int ii = 1 << (BITS-1-i);
		ans[i*3+0].push_back(0);
		ans[i*3+1].push_back(1);
		ans[i*3+2].push_back(1);
		Loop (x,1,N+1) {
			ans[i*3+0].push_back(x&ii? i*3 + 2: i*3 + 1);
			ans[i*3+1].push_back(x&ii? -1: (i+1)*3);
			ans[i*3+2].push_back(x&ii? (i+1)*3: -2);
		}
	}
	ans[BITS*3].resize(N+1);
	return ans;
}

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