Submission #761415

#	Time	Username	Problem	Language	Result	Execution time	Memory
761415		tolbi	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	1176 ms	2097152 KiB

dungeons

#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;
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;
    st.resize(LOG,vector<vector<int>>(n+1,vector<int>(LOG,-1)));
    val.resize(LOG,vector<vector<int>>(n+1,vector<int>(LOG,-1)));
    for (int i = 0; i < LOG; i++){
        for (int node = 0; node < n; node++){
            if (tol(i)>=s[node]){
                st[i][node][0]=w[node];
                val[i][node][0]=s[node];
            }
            else {
                st[i][node][0]=l[node];
                val[i][node][0]=p[node];
            }
            if (val[i][node][0]>=tol(i)){
                st[i][node][0]=val[i][node][0]=-1;
            }
        }
        for (int bit = 1; bit < LOG; bit++){
            for (int node = 0; node < n; node++){   
                if (st[i][node][bit-1]==-1) continue;
                st[i][node][bit]=st[i][st[i][node][bit-1]][bit-1];
                if (st[i][node][bit]==-1) continue;
                val[i][node][bit]=val[i][node][bit-1]+val[i][st[i][node][bit-1]][bit-1];
                if (val[i][node][bit]>=tol(i)){
                    st[i][node][bit]=val[i][node][bit]=-1;
                }
            }
        }
    }
}
int simul(int x, int z){
    int crr = log2(z);
    int hed = tol(crr+1);
    for (int bit = LOG-1; bit >= 0; bit--){
        if (st[crr][x][bit]==-1) continue;
        if (z+val[crr][x][bit]>=hed) continue;
        z+=val[crr][x][bit];
        x=st[crr][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) {
    int ans = simul(x,z);
    return ans;
}

Compilation message (stderr)

dungeons.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

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