답안 #639735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
639735	2022-09-11T10:50:19 Z	bonk	쌀 창고 (IOI11_ricehub)	C++14	17 / 100	1000 ms	468 KB

ricehub

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

using namespace std;
using ll = long long;

int besthub(int r, int l, int x[], ll b){
    ll ans = 0;
    for(ll i = 0; i < r; i++){
        ll cur = 0;
        for(ll j = i; j < r; j++){
            cur += x[j];
            ll mid = cur/(j - i + 1);
            ll cost = 0;
            for(ll k = i; k <= j; k++){
                cost += abs(x[k] - mid);
            }

            if(cost <= b) ans = max(ans, j - i + 1);
        }
    }

    return ans;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

0 / 25.0

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

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	212 KB	Output is correct
2	Correct	2 ms	212 KB	Output is correct
3	Correct	120 ms	312 KB	Output is correct
4	Correct	118 ms	332 KB	Output is correct
5	Correct	25 ms	340 KB	Output is correct
6	Correct	24 ms	212 KB	Output is correct
7	Correct	156 ms	296 KB	Output is correct
8	Correct	153 ms	304 KB	Output is correct
9	Correct	20 ms	212 KB	Output is correct
10	Correct	22 ms	212 KB	Output is correct
11	Correct	90 ms	212 KB	Output is correct
12	Correct	83 ms	212 KB	Output is correct
13	Correct	158 ms	296 KB	Output is correct
14	Correct	153 ms	304 KB	Output is correct
15	Correct	23 ms	212 KB	Output is correct
16	Correct	22 ms	312 KB	Output is correct
17	Correct	83 ms	296 KB	Output is correct
18	Correct	80 ms	312 KB	Output is correct
19	Correct	153 ms	304 KB	Output is correct
20	Correct	163 ms	308 KB	Output is correct
21	Execution timed out	1088 ms	320 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1085 ms	468 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-