Submission #1223207

#TimeUsernameProblemLanguageResultExecution timeMemory
1223207simplemind_31Dungeons Game (IOI21_dungeons)C++20
11 / 100
7091 ms35512 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; int N; vector<vi> To; //strenth,losingstrength,winignto,losingto void init(int n,vi s,vi p,vi w,vi l) { To.resize(N=n); for(int i=0;i<n;i++){ To[i]={s[i],p[i],w[i],l[i]}; } return; } ll simulate(int x, int z){ while(x!=N){ if(z>=To[x][0]){ z+=To[x][0]; x=To[x][2]; }else{ z+=To[x][1]; x=To[x][3]; } } 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...