답안 #969906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969906 2024-04-25T19:18:26 Z urieg 쌀 창고 (IOI11_ricehub) C++17
17 / 100
1000 ms 5208 KB

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;
/// for moondance

int besthub(int R, int L, int X[], long long B){

    vector<ll>x(R), p(R);
    for(int i=0;i<R;i++){
        x[i] = X[i];
        p[i] = x[i];
        if(i)p[i] += p[i-1];
    }


    int ans = 0;
    ll sum = 0;
    int l = 0, r = 0;
    for(int i =0;i<R;i++){
        l = r = i;
        sum = 0;
        while(l>0 && r<R-1 && sum <= B){
            if(l>0 && r<R-1){
                if(x[i]-x[l-1] < x[r+1]-x[i]){
                    if(sum + x[i]-x[l-1] <= B){
                        sum += x[i]-x[l-1];
                        l--;
                    }
                    else break;
                }
                else{
                    if(sum + x[r+1]-x[i] <= B){
                        sum += x[r+1]-x[i];
                        r++;
                    }
                    else break;
                }
            }
            else if(l>0){
                if(sum + x[i]-x[l-1] <= B){
                    sum += x[i]-x[l-1];
                    l--;
                }
                else break;
            }
            else if(r<R-1){
                if(sum + x[r+1]-x[i] <= B){
                    sum += x[r+1]-x[i];
                    r++;
                }
                else break;
            }
        }
        ans = max(ans, r-l+1);
    }
    return ans;
}




# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Execution timed out 1020 ms 5208 KB Time limit exceeded
4 Halted 0 ms 0 KB -