Submission #438625

#	Time	Username	Problem	Language	Result	Execution time	Memory
438625		Mil0S	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7094 ms	21288 KiB

dungeons

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define vi vector<int>
int n1;
vector<int> s1,p1,w1,l1;
void init(int n,vi s,vi p,vi w, vi l){
n1=n;
for(int i=0;i<n;i++){
s1.push_back(s[i]);
}
for(int i=0;i<n;i++){
p1.push_back(p[i]);
}
for(int i=0;i<n;i++){
w1.push_back(w[i]);
}
for(int i=0;i<n;i++){
l1.push_back(l[i]);
}
}
long long simulate(int x,int z){
    long long pom=z;
while(x!=n1){
    if(s1[x]<=pom){
        pom+=s1[x];
        x=w1[x];
    }
    else{
        pom+=p1[x];
        x=l1[x];
    }
}
return pom;
}

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