| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 852144 | alex_2008 | Dungeons Game (IOI21_dungeons) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dungeons.h"
#include <bits/stdc++.h>
#define mindiff first
#define pos second.first
#define strength second.second
using namespace std;
const int N = 4e5 + 10;
const int M = 10000001;
const int INF = 1e9 + 10;
pair<int, pair<int, int>> dp[N][24][24];
long long NN;
bool ch = true;
vector <long long> ss, pp, ww, ll;
long long nxt[N];
int lg2[M];
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
lg2[1] = 0;
for (int i = 2; i < M; i++) {
lg2[i] = lg2[i / 2] + 1;
}
NN = n;
s.push_back(0);
p.push_back(0);
w.push_back(n);
l.push_back(n);
for (int i = 0; i <= n; i++) {
ss.push_back(s[i]);
if (w[i] != l[i]) ch = false;
}
nxt[n] = 0;
for (int i = n - 1; i >= 0; i--) {
nxt[i] = s[i] + nxt[w[i]];
}
for (int i = 0; i <= n; i++) {
pp.push_back(p[i]);
}
for (int i = 0; i <= n; i++) {
ww.push_back(w[i]);
}
for (int i = 0; i <= n; i++) {
ll.push_back(l[i]);
}
for (int k = 0; k < 24; k++) {
for (int i = 0; i <= n; i++) {
for (int j = 0; j < 24; j++) {
if (k == 0) {
dp[i][j][k].pos = ((1 << j) >= s[i]) ? w[i] : l[i];
dp[i][j][k].strength = ((1 << j) >= s[i]) ? s[i] : p[i];
dp[i][j][k].mindiff = ((1 << j) < s[i]) ? s[i] : INF;
}
else {
int q = 2, p = dp[i][j][k - 1].pos, sm = 0;
while (q--) {
p = dp[p][j][k - 1].pos;
}
dp[i][j][k].pos = p;
dp[i][j][k].strength = dp[i][j][k - 1].strength;
q = 2; p = dp[i][j][k - 1].pos;
while (q--) {
dp[i][j][k].strength += dp[p][j][k - 1].strength;
dp[i][j][k].strength = min(INF, dp[i][j][k].strength);
p = dp[p][j][k - 1].pos;
}
dp[i][j][k].mindiff = dp[i][j][k - 1].mindiff;
q = 2; p = dp[i][j][k - 1].pos; sm = dp[i][j][k - 1].strength;
while (q--) {
dp[i][j][k].mindiff = min(dp[i][j][k].mindiff, dp[p][j][k - 1].mindiff - sm);
sm = min(sm + dp[p][j][k - 1].strength, INF);
p = dp[p][j][k - 1].pos;
}
}
}
}
}
}
long long simulate(int xx, int zz) {
long long x = xx, z = zz;
while (1) {
if (z >= 10000000) {
z += nxt[x];
return z;
}
int v = (int)lg2[z];
for (int k = 23; k >= 0; k--) {
if (dp[x][v][k].pos == NN || dp[x][v][k].mindiff <= z || (z + dp[x][v][k].strength >= 10000000) || lg2[z + dp[x][v][k].strength] > v) continue;
z += dp[x][v][k].strength;
x = dp[x][v][k].pos;
k++;
}
if (z >= ss[x]) {
z += ss[x];
x = ww[x];
}
else {
z += pp[x];
x = ll[x];
}
if (x == NN) return z;
}
return 0;
}
//int main() {
// init(3, { 2, 6, 9 }, { 3, 1, 2 }, { 2, 2, 3 }, { 1, 0, 1 });
// cout << simulate(0, 1) << "\n";
// cout << simulate(2, 3) << "\n";
//}