답안 #1093639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093639	2024-09-27T07:17:15 Z	Aviansh	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	11 ms	1884 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

bool check(int x[], int n, int siz, long long b){
    int med = n/2;
    long long f = 0;
    long long s = 0;
    for(int i = 0;i<=med;i++){
        f+=x[med]-x[i];
    }
    for(int i = med+1;i<n;i++){
        s+=x[i]-x[med];
    }
    if(f+s<=b)
        return 1;
    for(int i = 1;i<=siz-n;i++){
        f+=1LL*(x[med+i]-x[med+i-1])*(med+1);
        f-=(x[med+i]-x[i-1]);
        s-=1LL*(x[med+i]-x[med+i-1])*(n-med-1);
        s+=(x[n+i-1]-x[med+i]);
        if(f+s<=b){
            return 1;
        }
    }
    return 0;
}

int besthub(int n, int l, int x[], long long b)
{
    int lo = 0;
    int hi = n;
    while(lo<hi){
        int mid = (lo+hi+1)/2;
        if(check(x,mid,n,b)){
            lo=mid;
        }
        else{
            hi=mid-1;
        }
    }
    return lo;
}

Subtask #1

17.0 / 17.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	348 KB	Output is correct
4	Correct	0 ms	448 KB	Output is correct
5	Correct	0 ms	344 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	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	1 ms	348 KB	Output is correct
7	Correct	0 ms	444 KB	Output is correct
8	Correct	0 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	448 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	348 KB	Output is correct
18	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 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	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	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 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	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	488 KB	Output is correct
24	Correct	1 ms	484 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	604 KB	Output is correct
2	Correct	2 ms	604 KB	Output is correct
3	Correct	9 ms	1884 KB	Output is correct
4	Correct	11 ms	1796 KB	Output is correct
5	Correct	7 ms	1112 KB	Output is correct
6	Correct	4 ms	860 KB	Output is correct
7	Correct	8 ms	1428 KB	Output is correct
8	Correct	9 ms	1372 KB	Output is correct
9	Correct	5 ms	856 KB	Output is correct
10	Correct	6 ms	860 KB	Output is correct
11	Correct	9 ms	1824 KB	Output is correct
12	Correct	10 ms	1884 KB	Output is correct
13	Correct	8 ms	1032 KB	Output is correct
14	Correct	5 ms	860 KB	Output is correct
15	Correct	8 ms	1372 KB	Output is correct
16	Correct	7 ms	1372 KB	Output is correct
17	Correct	9 ms	1732 KB	Output is correct
18	Correct	10 ms	1628 KB	Output is correct
19	Correct	9 ms	1584 KB	Output is correct
20	Correct	9 ms	1584 KB	Output is correct