Submission #524727

#	Time	Username	Problem	Language	Result	Execution time	Memory
524727		Lobo	Dungeons Game (IOI21_dungeons)	C++17	36 / 100	7008 ms	253816 KiB

dungeons

#include "dungeons.h"
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 55000

int N, P[maxn], L[maxn], S[maxn], W[maxn];
pair<int,int> nx[maxn][10][32];
vector<int> st;
int tp;

pair<int,int> nxt(int u, int qtd, int id) {
    int val = 0;
    for(int pt = 30; pt >= 0; pt--) {
        if(qtd >= (1<<pt)) {
            qtd-= (1<<pt);
            val+= nx[u][id][pt].sc;
            u = nx[u][id][pt].fr;
        }
    }

    return mp(u,val);
}

int simulate(int32_t x, int32_t z) {
    int zz = z;
    if(tp == 0) {
        int id = 0;
        while(zz >= st[id]) id++;
        id--;

        while(x != N) {
            // cout << x << " " << zz << " " << id << endl;
            int l = 0;
            int r = 1e7 + 10;
            pair<int,int> ans1;
            while(l <= r) {
                int mid = (l+r)>>1;

                auto aux = nxt(x,mid,id);
                if(zz+aux.sc >= st[id+1] || aux.fr == N) {
                    ans1 = aux;
                    ans1.sc+= zz;
                    r = mid-1;
                }
                else {
                    l = mid+1;
                }
            }

            x = ans1.fr;
            zz = ans1.sc;
            id++;
        }
    }
    else {
        while(x != N) {
            if(S[x] <= zz) {
                //ganhou
                zz+= S[x];
                x = W[x];
            }
            else {
                //perdeu
                zz+= P[x];
                x = L[x];
            }
        }
    }

    return zz;
}

void init(int32_t n, vector<int32_t> s, vector<int32_t> p, vector<int32_t> w, vector<int32_t> l) {
    N = n;
    st.pb(0);
    st.pb(inf);
    for(int i = 0; i < n; i++) {
        st.pb(s[i]);
    }
    sort(all(st));
    st.erase(unique(all(st)),st.end());

    if(st.size() <= 8) {
        tp = 0;
        for(int i = 0; i < st.size(); i++) {
            for(int j = 0; j < n; j++) {
                if(s[j] <= st[i]) {
                    nx[j][i][0] = mp(w[j],s[j]);
                }
                else {
                    nx[j][i][0] = mp(l[j],p[j]);
                }
            }

            for(int pt = 0; pt <= 30; pt++) {
                nx[n][i][pt].fr = n;
                nx[n][i][pt].sc = 0; 
            }
            for(int pt = 1; pt <= 30; pt++) {
                for(int j = 0; j < n; j++) {
                    nx[j][i][pt].fr = nx[nx[j][i][pt-1].fr][i][pt-1].fr;
                    nx[j][i][pt].sc = nx[j][i][pt-1].sc + nx[nx[j][i][pt-1].fr][i][pt-1].sc;
                }
            }
        }
    }
    else {
        tp = 1;
        for(int i = 0; i < n; i++) {
            S[i] = s[i];
            W[i] = w[i];
            L[i] = l[i];
            P[i] = p[i];
        }
    }
}

Compilation message (stderr)

dungeons.cpp: In function 'void init(int32_t, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:97:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int i = 0; i < st.size(); i++) {
      |                        ~~^~~~~~~~~~~

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