Submission #1046277

#	Time	Username	Problem	Language	Result	Execution time	Memory
1046277		VMaksimoski008	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	42 ms	26460 KiB

dungeons

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

const int maxn = 6e5 + 5;
const int LOG = 25;
vector<int> S, P, W, L;
ll N, sub3 = 1, up[maxn][LOG];
ll sum[maxn][LOG], dist[maxn];

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
    N = n;
    S = s;
    P = p;
    W = w;
    L = l;

    for(int i=1; i<N; i++) if(S[i] != S[i-1]) sub3 = 0;
    for(int i=N-1; i>=0; i--) dist[i] = dist[W[i]] + S[i];
    for(int i=0; i<N; i++) up[i][0] = L[i], sum[i][0] = P[i];

    for(int j=1; j<LOG; j++)
        for(int i=0; i<=N; i++) up[i][j] = up[up[i][j-1]][j-1];
    for(int j=1; j<LOG; j++)
        for(int i=0; i<=N; i++) sum[i][j] = sum[i][j-1] + sum[up[i][j-1]][j-1];
	return;
}

ll simulate(int x, int z) {
        if(z >= S[x]) return (ll)z + dist[x];
        ll ans = z;

        for(int i=LOG-1; i>=0; i--) {
            if(ans + sum[x][i] < S[x]) {
                ans += sum[x][i];
                x = up[x][i];
            }
        }

        if(x == N) return ans;
        if(ans < S[x]) ans += P[x], x = up[x][0];
        return ans + dist[x];

    // ll ans = z;
    // while(x != N) {
    //     if(z >= S[x]) {
    //         z += S[x];
    //         x = W[x];
    //     } else {
    //         z += P[x];
    //         x = L[x];
    //     }
    // }
	// return z;
}

Compilation message (stderr)

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:25:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   25 |     for(int j=1; j<LOG; j++)
      |     ^~~
dungeons.cpp:27:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   27 |  return;
      |  ^~~~~~

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