Submission #623897

#	Time	Username	Problem	Language	Result	Execution time	Memory
623897		sofapuden	Dungeons Game (IOI21_dungeons)	C++17	89 / 100	7143 ms	868420 KiB

dungeons

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#include "dungeons.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int mxn = 4e5+1;
const int m = 9;
const int c = 15;

int b[mxn][m][c], t[mxn][m][c];
ll a[mxn][m][c];
ll suf[mxn];
vector<int> s, p, w, l;
int n;

const ll inf = (1<<30);

void init(int _n, vector<int> _s, vector<int> _p, vector<int> _w, vector<int> _l) {
	n = _n, s = _s, p = _p, w = _w, l = _l;
	suf[n] = 0;
	for(int i = n-1; ~i; --i){
		suf[i] = s[i] + suf[w[i]];
	}
	for(int i = 0; i < c; ++i){
		b[n][0][i] = n;
		t[n][0][i] = inf;
		a[n][0][i] = 0;
		for(int k = 0; k < n; ++k){
			if(s[k] <= (1<<i<<10)){
				t[k][0][i] = inf;
				a[k][0][i] = s[k];
				b[k][0][i] = w[k];
			}
			else{
				t[k][0][i] = s[k];
				a[k][0][i] = p[k];
				b[k][0][i] = l[k];
			}
		}
		for(int j = 1; j < 2*m; ++j){
			for(int k = 0; k < n; ++k){
				int cur = (j-1)%m;
				t[k][j%m][i] = (t[b[k][cur][i]][cur][i] == inf ? t[k][cur][i] : min((int)max(0ll,t[b[k][cur][i]][cur][i] - a[k][cur][i]), t[k][cur][i]));
				a[k][j%m][i] = a[b[k][cur][i]][cur][i] + a[k][cur][i];
				b[k][j%m][i] = b[b[k][cur][i]][cur][i];
			}
		}
	}
}

ll simulate(int x, int _z) {
	ll z = _z;
	while(z <= 1024 && x != n) {
		if(z >= s[x]){
			z += s[x];
			x = w[x];
		} else {
			z += p[x];
			x = l[x];
		}
	}
	if(x != n){
		for(int i = 0; i < c; ++i){
			if(z > (1<<i<<11))continue;
			for(int j = m-1; ~j; --j){
				while(x != n && z < t[x][j][i]){
					z += a[x][j][i];
					x = b[x][j][i];
				}
			}
			while(x != n && z <= (1<<i<<11)){
				if(z >= s[x]){
					z += s[x];
					x = w[x];
				} else {
					z += p[x];
					x = l[x];
				}
			}
			if(x == n)break;
		}
		z+=suf[x];
	}
	return z;
}

• Subtask 1: 11 / 11
• Subtask 2: 26 / 26
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 27 / 27
• Subtask 6: 0 / 11