Submission #790170

#	Time	Username	Problem	Language	Result	Execution time	Memory
790170		alexander707070	던전 (IOI21_dungeons)	C++17	11 / 100	7048 ms	26700 KiB

dungeons

#include<bits/stdc++.h>
#define MAXN 400007
using namespace std;

int n,parent[MAXN],to[MAXN];
int win[MAXN],lose[MAXN];
long long curr;

void init(int N,vector<int> s,vector<int> p,vector<int> w,vector<int> l){
    n=N;
    for(int i=0;i<n;i++){
        parent[i]=w[i];
        to[i]=l[i];

        win[i]=s[i]; lose[i]=p[i];
    }
}

long long simulate(int x, int z){
    curr=z;
    while(x!=n){
        if(curr>=win[x]){
            curr+=win[x]; x=parent[x];
        }else{
            curr+=lose[x]; x=to[x];
        }
    }
    return curr;
}

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