제출 #1312306

#제출 시각아이디문제언어결과실행 시간메모리
1312306opeleklanos던전 (IOI21_dungeons)C++20
11 / 100
7095 ms19752 KiB
#include <iostream>
#include <vector>
#include "dungeons"
using namespace std;

#define ll long long

vector<int> w, l, s, p;
int n;

void init(int n1, vector<int> s1, vector<int> p1, vector<int> w1, vector<int> l1){
    n = n1;
    s = s1;
    p = p1;
    w = w1;
    l = l1;
}

ll simulate(int x, int z1){
    ll z = (ll)z1;
    while(x!=n){
        if(z < s[x]){
            z += (ll)p[x];
            x = l[x];
        }
        else{
            z += s[x];
            x = w[x];
        }
    }
    return z;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...