답안 #969924

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
969924	2024-04-25T21:02:36 Z	urieg	쌀 창고 (IOI11_ricehub)	C++17	74 / 100	19 ms	4256 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
typedef long long ll;
/// for NC 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];
    }
    ll INF = 7e18;
    ll ans = 1;
    for(int i=0;i<R;i++){
        ll l = 1, r = R;
        while(l<r){
            ll m = (l+r+1)/2;
            ll l_, r_;
            ll sum = INF;
            if(m%2){
                l_ = i-m/2; r_ = i+m/2;
                if(0<=l_&&r_<R){
                    sum = p[r_] - p[i] - (x[i]*(r_-i));
                    sum += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
                }
            }
            else{
                ll s1=INF,s2=INF;
                l_ = i-m/2+1; r_ = i+m/2;
                if(0<=l_&&r_<R){
                    s1 = p[r_] - p[i] - (x[i]*(r_-i));
                    s1 += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
                }
                l_ = i-m/2; r_ = i+m/2-1;
                if(0<=l_&&r_<R){
                    s2 = p[r_] - p[i] - (x[i]*(r_-i));
                    s2 += x[i]*(i-l_+1) - (!l_ ? 0 : p[i]-p[l_-1]);
                }
                sum = min(s1,s2);
            }

            if(sum <= B)l = m;
            else r = m-1;
        }
        ans = max(ans, l);
    }
    return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	500 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	600 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	600 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	540 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Incorrect	1 ms	348 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	604 KB	Output is correct
2	Correct	3 ms	856 KB	Output is correct
3	Correct	17 ms	4188 KB	Output is correct
4	Correct	17 ms	4120 KB	Output is correct
5	Correct	7 ms	3420 KB	Output is correct
6	Correct	8 ms	3420 KB	Output is correct
7	Correct	17 ms	4256 KB	Output is correct
8	Correct	17 ms	4188 KB	Output is correct
9	Correct	9 ms	3420 KB	Output is correct
10	Correct	7 ms	3420 KB	Output is correct
11	Correct	18 ms	4256 KB	Output is correct
12	Correct	18 ms	4256 KB	Output is correct
13	Correct	8 ms	3420 KB	Output is correct
14	Correct	8 ms	3420 KB	Output is correct
15	Correct	13 ms	3768 KB	Output is correct
16	Correct	13 ms	3676 KB	Output is correct
17	Correct	16 ms	3932 KB	Output is correct
18	Correct	17 ms	3932 KB	Output is correct
19	Correct	17 ms	4172 KB	Output is correct
20	Correct	19 ms	3932 KB	Output is correct