Submission #719191

#	Time	Username	Problem	Language	Result	Execution time	Memory
719191		ChrisM2309	Race (IOI11_race)	C++17	9 / 100	36 ms	3160 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 psum[N];
  psum[0] = 0;
  for (int i = 0; i < N; i++){
    psum[i+1] = psum[i] + L[i]; 
  }
  //for (auto x : psum) cout << x << " ";
  bool found = false;
  int ans = -1;
  for (int d = 0; d <= N; d++){
     if(found) break;
     for (int i = 0; i <= N - d; i++){
        if(i + d <= N){
           if(psum[i + d] - psum[i] == K){
             ans = d;
             //cout << i + d << " " << i << "\n";
             found = true;
             break;
           }
        }
     }
  }
  if(!found) return -1;
  //cout << ans;
  return ans;
}

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