| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 761245 | tolbi | 던전 (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.
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulHamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
#define author tolbi
#include<bits/stdc++.h>
using namespace std;
template<typename T> vector<int32_t> normalize(vector<T> &rt){vector<int32_t> arr(rt.size());for (int i = 0; i < rt.size(); i++){arr[i]=rt[i];}return arr;}
#define endl '\n'
#define int long long
#define vint(x) vector<int> x
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define tol(bi) (1LL<<((int)(bi)))
#define lsb(x) (x&-x)
const int MOD = 1e9+7;
const int64_t INF = 1e15;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "dungeons.h"
vector<int32_t> s,p,w,l;
int n;
vector<vector<vector<int>>> st;
vector<vector<vector<int>>> val;
set<int> ele;
map<int,int> mp;
vector<int> revmp;
const int LOG = 60;
int mava;
void init(int32_t _n, vector<int32_t> _s, vector<int32_t> _p, vector<int32_t> _w, vector<int32_t> _l) {
n=_n,s=_s,p=_p,w=_w,l=_l;
mava=*max_element(s.begin(), s.end());
mava=max(mava,*max_element(p.begin(), p.end()));
ele.insert(0);
for (int i = 0; i < s.size(); i++){
ele.insert(s[i]);
}
int ind = 0;
for (auto it : ele){
mp[it]=ind++;
revmp.push_back(it);
}
st.resize(ind,vector<vector<int>>(n+1,vector<int>(LOG,-1)));
val.resize(ind,vector<vector<int>>(n+1,vector<int>(LOG,-1)));
for (int el = 0; el < ind; el++){
int va = revmp[el];
int sin = INF;
if (el<ind-1) sin = revmp[el+1]-revmp[el];
for (int i = 0; i < n; i++){
if (va>=s[i]){
st[el][i][0]=w[i];
val[el][i][0]=s[i];
}
else {
st[el][i][0]=l[i];
val[el][i][0]=p[i];
}
if (val[el][i][0]>=sin) {
st[el][i][0]=val[el][i][0]=-1;
}
}
for (int bit = 1; bit < LOG; bit++){
for (int i = 0; i < n; ++i)
{
if (st[el][i][bit-1]==-1) continue;
st[el][i][bit]=st[el][st[el][i][bit-1]][bit-1];
if (st[el][i][bit]==-1) continue;
val[el][i][bit]=val[el][i][bit-1]+val[el][st[el][i][bit-1]][bit-1];
if (val[el][i][bit]>=sin){
st[el][i][bit]=val[el][i][bit]=-1;
}
}
}
}
}
int bk(int x){
auto it = ele.lower_bound(x+1);
it--;
return *it;
}
int sonr(int x){
auto it = ele.lower_bound(x+1);
if (it==ele.end()) return INF;
return *it;
}
int64_t simul(int32_t x, int64_t z){
int cur = mp[bk(z)];
int cc = sonr(z);
for (int bit = LOG-1; bit >= 0; bit--){
if (st[cur][x][bit]==-1) continue;
if (val[cur][x][bit]+z>=cc) continue;
z+=val[cur][x][bit];
x=st[cur][x][bit];
}
if (x==n) return z;
if (z>=s[x]){
z+=s[x];
x=w[x];
}
else {
z+=p[x];
x=l[x];
}
return simul(x,z);
}
int64_t simulate(int32_t x, int32_t z) {
if (mava<=10000){
int nn = z;
while (x!=n){
if (nn>=s[x]){
nn+=s[x];
x=w[x];
}
else {
nn+=p[x];
x=l[x];
}
}
return nn;
}
return simul(x,z);
}