Submission #815307

#	Time	Username	Problem	Language	Result	Execution time	Memory
815307		eltu0815	Dungeons Game (IOI21_dungeons)	C++17	100 / 100	4918 ms	1591392 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
int N;
const int MX = 8;
int pos[MX][400001][25];
ll mn[MX][400001][25], sum[MX][400001][25];
ll dp[400001];
 
 vector<int> s, p, w, l;
void init(int n, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
    N = n; s = S; p = P, w = W, l = L;
    for(int j = 0; j < MX; ++j) {
        for(int i = 0; i < N; ++i) {
            pos[j][i][0] = (1 << 3 * j) <= S[i] ? L[i] : W[i];
            sum[j][i][0] = (1 << 3 * j) <= S[i] ? P[i] : S[i];
            mn[j][i][0] = (1 << 3 * j) <= S[i] ? S[i] : (ll)(1e16);
        }
        pos[j][N][0] = N, sum[j][N][0] = 0;
    }
    for(int k = 0; k < MX; ++k) for(int j = 1; j < 25; ++j) {
        for(int i = 0; i <= N; ++i) {
            pos[k][i][j] = pos[k][pos[k][i][j - 1]][j - 1];
            sum[k][i][j] = sum[k][pos[k][i][j - 1]][j - 1] + sum[k][i][j - 1];
            mn[k][i][j] = min(mn[k][i][j - 1], mn[k][pos[k][i][j - 1]][j - 1] - sum[k][i][j - 1]);
        }
    }
    
    for(int i = n - 1; i >= 0; --i) dp[i] = dp[W[i]] + S[i];
	return;
}
 
long long simulate(int x, int z) {
    ll ans = z;
    for(int k = 0; k < MX; ++k) {
        while(ans < (1ll << 3 * k + 3)) {
            for(int j = 24; j >= 0; --j) {
                if(pos[k][x][j] != N && sum[k][x][j] + ans < (1 << 3 * k + 3) && mn[k][x][j] > ans) {
                    ans += sum[k][x][j], x = pos[k][x][j];
                }
            }
            if(s[x] <= ans) ans += s[x], x = w[x];
            else if(ans < (1 << 3 * k + 3)) ans += p[x], x = l[x];
            if(x == N) return ans;
        }
    }
	return ans + dp[x];
}

Compilation message (stderr)

dungeons.cpp: In function 'long long int simulate(int, int)':
dungeons.cpp:39:35: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   39 |         while(ans < (1ll << 3 * k + 3)) {
      |                             ~~~~~~^~~
dungeons.cpp:41:74: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   41 |                 if(pos[k][x][j] != N && sum[k][x][j] + ans < (1 << 3 * k + 3) && mn[k][x][j] > ans) {
      |                                                                    ~~~~~~^~~
dungeons.cpp:46:39: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   46 |             else if(ans < (1 << 3 * k + 3)) ans += p[x], x = l[x];
      |                                 ~~~~~~^~~

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