Submission #1213775

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213775		12baater	Race (IOI11_race)	C++20	9 / 100	18 ms	1604 KiB

race

#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++) {
    current += L[i];
    currentPaths++;
    if(current == K && currentPaths > 0) {
      best = min(best, currentPaths);
    }
    while (current >= K) {
      currentPaths--;
      current -= L[i-currentPaths];
      if(current == K && currentPaths > 0) {
        best = min(best, currentPaths);
      }
    }
  }

  return (best==2000000000) ? -1 : best;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57