제출 #623509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623509		MohamedFaresNebili	던전 (IOI21_dungeons)	C++17	24 / 100	7086 ms	105172 KiB

dungeons

#include <bits/stdc++.h>
 
            using namespace std;
            using ll = long long;
 
            ll N, D[50005], A[50005][30], B[50005][30];
            vector<ll> S, P, W, L;
            vector<ll> rev[50005];
            bool sameS = 1;
 
            long long solve(int i, int k) {
                if(i == N) return k;
                if(k >= S[i]) return solve(W[i], k + S[i]);
                return solve(L[i], k + P[i]);
            }
            void dfs(int v, int p) {
                for(auto u : rev[v]) {
                    D[u] = D[v] + S[0];
                    dfs(u, v);
                }
            }
 
            void init(int n, vector<int> s, vector<int> p,
                      vector<int> w, vector<int> l) {
 
                N = n; S.resize(n), P.resize(n), W.resize(n), L.resize(n);
                for(int i = 0; i < N; i++) {
                    S[i] = s[i], P[i] = p[i], W[i] = w[i], L[i] = l[i];
                    A[i][0] = L[i], B[i][0] = P[i];
                    sameS &= (S[i] == S[0]);
                    rev[W[i]].push_back(i);
                }
 
                A[N][0] = N; L[N] = N;
 
                for(int i = 1; i < 30; i++)
                    for(int l = 0; l <= N; l++) {
                        A[l][i] = A[A[l][i - 1]][i - 1];
                        B[l][i] = B[l][i - 1] + B[A[l][i - 1]][i - 1];
                    }
 
                dfs(N, N);
            }
 
            long long simulate(int x, int z) {
              	if(!sameS) return solve(x, z);
                ll res = z;
                for(int l = 25; l >= 0; l--)
                    if(res + B[x][l] < S[0]) {
                        res += B[x][l];
                        x = A[x][l];
                    }
                if(res >= S[0]) return res + D[x];
                res += P[x]; x = L[x]; res += D[x];
                return res;
            }

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