Submission #1305908

#TimeUsernameProblemLanguageResultExecution timeMemory
1305908alosza장애물 (IOI25_obstacles)C++20
0 / 100
53 ms6352 KiB
#include <bits/stdc++.h> using namespace std; vector<int> t, h; void initialize(vector<int> T, vector<int> H) { t = T; h = H; string res; for(int i = 0; i < H.size(); i++) res += H[i]; reverse(res.begin(), res.end()); cout << res << "\n"; } bool can_reach(int L, int R, int S, int D) { for(int i = S; i <= D; i++) { if(t[0] <= h[i]) return false; } return true; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...