| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1048575 | DorostWef | 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>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define mk make_pair
typedef pair <ll, ll> pii;
const int N = 400023, LG = 24, L2 = 11, K = 4;
int s[N], p[N], w[N], l[N], n;
long long m[N], a[N];
pair <int, pii> nx[N][L2];
pair <int, pii> nx2[LG][N][L2];
void init(int nn, std::vector<int> ss, std::vector<int> pp, std::vector<int> ww, std::vector<int> ll) {
n = nn;
for (int i = 0; i < n; i++) {
s[i] = ss[i];
p[i] = pp[i];
w[i] = ww[i];
l[i] = ll[i];
}
m[n] = 0;
a[n] = 0;
l[n] = n;
w[n] = n;
for (int i = n - 1; i >= 0; i--) {
a[i] = a[w[i]] + s[i];
m[i] = max((long long)s[i], m[w[i]] - s[i]);
}
for (int i = 0; i <= n; i++) {
nx[i][0].F = l[i];
nx[i][0].S.F = s[i] - 1;
nx[i][0].S.S = p[i];
}
for (int j = 1; j < L2; j++) {
for (int i = 0; i <= n; i++) {
for (int k = 0; k < K; k++) {
int w = nx[i][j - 1].F;
nx[i][j].F = nx[w][j - 1].F;
nx[i][j].S.S = nx[i][j - 1].S.S + nx[w][j - 1].S.S;
nx[i][j].S.F = min (nx[i][j - 1].S.F, nx[w][j - 1].S.F - nx[i][j - 1].S.S);
}
}
}
return;
}
pair <int, long long> find (int x, ll z) {
for (int i = L2 - 1; i >= 0; i--) {
for (int k = 0; k < K; k++) {
if (z <= nx[x][i].S.F) {
z += nx[x][i].S.S;
x = nx[x][i].F;
}
}
}
return {x, z};
}
int c = 0;
ll ans (int x, ll z) {
if (z >= m[x])
return z + a[x];
c++;
if (z >= s[x]) {
z += s[x];
x = w[x];
} else {
pair <int, long long> p = find (x, z);
z = p.S;
x = p.F;
}
return ans (x, z);
}
long long simulate(int x, int z) {
c = 0;
ll w = ans (x, z);
return w;
}