Submission #542015

#TimeUsernameProblemLanguageResultExecution timeMemory
5420152fat2code던전 (IOI21_dungeons)C++17
11 / 100
7069 ms26668 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define all(a) (a).begin(), (a).end() #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define fr first #define sc second //#define int long long #define rc(s) return cout<<s,0 #define rcc(s) cout<<s,exit(0) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int N; vector<int>S, P, W, L; void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) { N = n; S = s; P = p; W = w; L = l; } long long simulate(int x, int z) { int curr = x; while(curr != N){ if(z < S[curr]){ z += P[curr]; curr = L[curr]; } else{ z += S[curr]; curr = W[curr]; } } 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...