Submission #1067418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067418		ender	Race (IOI11_race)	C++17	0 / 100	1 ms	2392 KiB

race

#include "race.h"
#include <bits/stdc++.h>

using namespace std;

int best_path(int N, int K, int H[][2], int L[])
{

  int ans = INT32_MAX;

  for(int i = 0; i < N; ++i){

    int act = 0;
    int s = 0;

    for(int j = i; j < N; ++j){

      if(act + L[j] > K) break;

      act += L[j];
      s++;

    }

    if(act == K) {

      ans = min(ans, s);

    }

  }

  return ans;
}

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