답안 #531011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
531011 2022-02-27T10:30:42 Z Hanksburger 쌀 창고 (IOI11_ricehub) C++17
100 / 100
14 ms 2500 KB
#include <bits/stdc++.h>
using namespace std;
long long pref[100005];
int besthub(int n, int m, int a[], long long b)
{
	pref[0]=a[0];
	for (long long i=1; i<n; i++)
		pref[i]=pref[i-1]+a[i];
	long long ans=0;
	for (long long i=0; i<n; i++)
	{
		long long l=i, r=n-1;
		while (l<r)
		{
			long long mid=(l+r+1)/2;
			if (pref[mid]-pref[(i+mid)/2]-pref[(i+mid-1)/2]+(i==0?0:pref[i-1])<=b)
				l=mid;
			else
				r=mid-1;
		}
		ans=max(ans, l-i+1);
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 276 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 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 0 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 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 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 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 14 ms 2468 KB Output is correct
4 Correct 13 ms 2440 KB Output is correct
5 Correct 7 ms 1168 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 12 ms 2196 KB Output is correct
8 Correct 13 ms 2148 KB Output is correct
9 Correct 7 ms 1168 KB Output is correct
10 Correct 7 ms 1076 KB Output is correct
11 Correct 14 ms 2500 KB Output is correct
12 Correct 14 ms 2464 KB Output is correct
13 Correct 6 ms 1212 KB Output is correct
14 Correct 7 ms 1228 KB Output is correct
15 Correct 10 ms 1828 KB Output is correct
16 Correct 10 ms 1868 KB Output is correct
17 Correct 12 ms 2164 KB Output is correct
18 Correct 12 ms 2288 KB Output is correct
19 Correct 13 ms 2372 KB Output is correct
20 Correct 12 ms 2336 KB Output is correct