답안 #97396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97396 2019-02-15T17:25:53 Z Shafin666 쌀 창고 (IOI11_ricehub) C++14
100 / 100
24 ms 3200 KB
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<ll, ll>
#define to second
#define cost first
typedef long long ll;
typedef long double ld;
using namespace std;

ll a[1000005];
ll l[1000005];

bool can(int i, int j, ll b) {
	int mid = (i+j)/2;

	ll left = (mid-i+1)*a[mid] - (l[mid]-l[i-1]);
	ll right = l[j]-l[mid-1] - (j-mid+1)*a[mid];
	return left+right <= b;
}

ll besthub(int r, int L, int x[], ll b) {
	int maxlen = -1;

	for(int i = 0; i < r; i++) a[i+1] = x[i];
	for(int i = 1; i <= r; i++) l[i] = l[i-1] + a[i];

	int ptr = 1;
	for(int i = 1; i <= r; i++) {
		ptr = max(i, ptr);
		while(ptr+1 <= r && can(i, ptr+1, b)) ptr++;
		maxlen = max(maxlen, ptr-i+1);
	}

	return maxlen;
}
/*
int main()
{	
	int x[1] = {1};
	cout << besthub(1, 20, x, 6) << endl;

    return 0;
}*/
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 432 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 4 ms 512 KB Output is correct
27 Correct 4 ms 512 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 21 ms 2432 KB Output is correct
4 Correct 21 ms 2304 KB Output is correct
5 Correct 11 ms 1280 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 18 ms 2296 KB Output is correct
8 Correct 16 ms 2304 KB Output is correct
9 Correct 12 ms 1280 KB Output is correct
10 Correct 14 ms 1280 KB Output is correct
11 Correct 24 ms 2304 KB Output is correct
12 Correct 23 ms 2304 KB Output is correct
13 Correct 10 ms 1280 KB Output is correct
14 Correct 11 ms 1792 KB Output is correct
15 Correct 19 ms 2680 KB Output is correct
16 Correct 18 ms 2552 KB Output is correct
17 Correct 20 ms 3072 KB Output is correct
18 Correct 24 ms 3064 KB Output is correct
19 Correct 20 ms 3200 KB Output is correct
20 Correct 23 ms 3192 KB Output is correct