Submission #1213754

#TimeUsernameProblemLanguageResultExecution timeMemory
121375412baaterRace (IOI11_race)C++20
0 / 100
1 ms328 KiB
#include "race.h" #include <iostream> using namespace std; int best_path(int N, int K, int H[][2], int L[]) { int current = 0; int currentPaths = 0; int best = 2000000000; for(int i = 0; i < N; i++) { while (current > K) { current -= L[i-currentPaths]; currentPaths--; } if(current == K) { best = min(best,currentPaths); current -= L[i-currentPaths]; currentPaths--; } current += L[i]; currentPaths++; if (current == K) { best = min(best, currentPaths); } } return (best==2000000000) ? -1 : best; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...