제출 #1210819

#제출 시각아이디문제언어결과실행 시간메모리
1210819islam_2010경주 (Race) (IOI11_race)C++20
0 / 100
1 ms328 KiB
#pragma GCC optimize("O3")
#include "race.h"
#include <bits/stdc++.h>
using namespace std;

int best_path(int n, int k, int h[][2], int l[]) {
    int sum = 0;
    int mn = INT_MAX;
    int left = 0;

    for (int i = 0; i < n - 1; i++) {
        sum += l[i];
        while (sum > k) {
            sum -= l[left++];
        }
        if (sum == k) {
            mn = min(mn, i - left + 1);
        }
    }
    return (mn == INT_MAX ? -1 : mn);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...