답안 #405356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405356	2021-05-16T09:35:26 Z	Andyvanh1	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1000 ms	1484 KB

ricehub

#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

#define vt vector
#define pb push_back
#define all(x) x.begin(),x.end()

typedef vt<int> vi;
typedef long long ll;
typedef pair<int,int> pii;

ll prefsum[100005];

int besthub(int r, int l, int x[], ll b){
    prefsum[0] = 0;
    for(int i = 1; i <= r; i++){
        prefsum[i] = prefsum[i-1]+x[i-1];
    }
    int ans = 1;
    for(int i = 0; i < r; i++){
        for(int j = i+ans; j < r; j++){
            int mid = (i+j)>>1;
            ll n = (ll)x[mid]*(2*mid-j-i+1)-(prefsum[mid+1]-prefsum[i])+(prefsum[j+1]-prefsum[mid+1]);
            if(n <= b){
                ans = j-i+1;
            }
        }
    }
    return ans;


}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	3 ms	312 KB	Output is correct
8	Correct	2 ms	308 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	2 ms	204 KB	Output is correct
12	Correct	2 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	300 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	308 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	35 ms	332 KB	Output is correct
22	Correct	37 ms	304 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	332 KB	Output is correct
26	Correct	2 ms	332 KB	Output is correct
27	Correct	10 ms	404 KB	Output is correct
28	Correct	10 ms	332 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	588 ms	520 KB	Output is correct
2	Correct	589 ms	520 KB	Output is correct
3	Correct	15 ms	1484 KB	Output is correct
4	Correct	19 ms	1456 KB	Output is correct
5	Execution timed out	1090 ms	844 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-