oj.uz

답안 #1003091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003091 2024-06-20T05:57:38 Z vjudge1 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 2 ms 604 KB 
#include<bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    int n = R, i;
    int h[n+5], pref[n+5];
    pref[0] = 0;
    for(i = 1; i <= n; i++)
        h[i] = X[i-1];
    for(i = 1; i <= n - 1; i++)
        pref[i] = pref[i-1] + (h[i+1] - h[i]);
    pref[n] = 0;
    int res = 0;
    for(i = 1; i <= n; i++)
    {
        int l = i, r = n, ans = i;
        while(l <= r)
        {
            int mid = (l + r) / 2;
            if(pref[mid] - pref[i-1] > B)
                r = mid - 1;
            else
            {
                ans = mid;
                l = mid + 1;
            }
        }
        res = max(res, ans - i + 1);
    }
    return res;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -