제출 #335973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335973		aryan12	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1090 ms	3180 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;

int besthub(int r, int l, int x[], long long b) {
    long long pre[r + 1], suf[r + 1];
    pre[0] = 0;
    pre[1] = 0;
    for(long long i = 2; i <= r; i++) {
        pre[i] = pre[i - 1] + x[i - 1];
    }
    suf[r] = 0;
    for(long long i = r - 1; i >= 1; i--) {
        suf[i] = suf[i + 1] + x[i + 1];
    }
    /*for(long long i = 1; i <= r; i++) {
        cout << pre[i] << " ";
    }
    cout << endl;
    for(long long i = r; i > 0; i--) {
        cout << suf[i] << " ";
    }
    cout << endl;*/
    long long ans = 1;
    for(long long i = 2; i <= r; i++) {
        long long left = 1, right = i, best = r;
        long long mid;
        while(left <= right) {
            long long LeftPoint = (left + right) / 2;
            long long OptimalField = (LeftPoint + i) / 2;
            long long cost = 0;
            for(long long j = LeftPoint; j <= i; j++) {
                cost += abs(x[j] - x[OptimalField]);
            }
            if(cost <= b) {
                right = LeftPoint - 1;
                best = LeftPoint;
            }
            else {
                left = LeftPoint + 1;
            }
        }
       // cout << i << " " << best << endl;
        ans = max(ans, i - best + 1);
    }
    int lol = ans;
    return lol;
}

/*int main() {
    //cout << "Input the number of rice fields" << endl;
    int r;
    cin >> r;
    //cout << "Input the maximum coordinate" << endl;
    int l;
    cin >> l;
    //cout << "Input r numbers, denoting the rice fields" << endl;
    int x[r + 1];
    for(int i = 1; i <= r; i++) {
        cin >> x[i];
    }
    //cout << "Input the budget" << endl;
    int b;
    cin >> b;
    cout << besthub(r, l, x, b) << endl;
}*/

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:27:19: warning: unused variable 'mid' [-Wunused-variable]
   27 |         long long mid;
      |                   ^~~

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 0 / 32