Submission #1210808

#TimeUsernameProblemLanguageResultExecution timeMemory
1210808islam_2010경주 (Race) (IOI11_race)C++20
0 / 100
1 ms320 KiB
#pragma GCC optimize("O3") #include "race.h" #include <bits/stdc++.h> using namespace std; const int sz = 1e5+5; int best_path(int n, int k, int h[][2], int l[]){ int s = 0; for(int i = 0; i < n; i++){ s+=l[i]; if(s==k){ return i+1; } }return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...