답안 #971765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971765 2024-04-29T09:04:30 Z batsukh2006 쌀 창고 (IOI11_ricehub) C++17
100 / 100
11 ms 2672 KB
#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define ss second
#define ff first
#define endl '\n'
int besthub(int r, int l, int x[], long long b){
	int ans=0,m=0;
	long long cost=0;
	for(int i=0,j=0; i<r; i++){
		cost+=x[i]-x[m];
		int mid=(i+j)/2;
		cost+=(x[mid]-x[m])*(mid-j);
		cost-=(x[mid]-x[m])*(i-mid+1);
		m=mid;
		while(cost>b){
			cost-=x[m]-x[j];
			int mid=(i+j+1)/2;
			cost+=(x[mid]-x[m])*(mid-j-1);
			cost-=(x[mid]-x[m])*(i-mid+1);
			m=mid;
			j++;
		}
		ans=max(ans,i-j+1);
	}
	return ans;
}
# 결과 실행 시간 메모리 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
# 결과 실행 시간 메모리 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 1 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 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 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 344 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 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 0 ms 356 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 356 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 552 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 600 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 348 KB Output is correct
24 Correct 1 ms 348 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 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 9 ms 2652 KB Output is correct
4 Correct 11 ms 2592 KB Output is correct
5 Correct 4 ms 2652 KB Output is correct
6 Correct 4 ms 2648 KB Output is correct
7 Correct 10 ms 2620 KB Output is correct
8 Correct 10 ms 2652 KB Output is correct
9 Correct 4 ms 2652 KB Output is correct
10 Correct 4 ms 2652 KB Output is correct
11 Correct 9 ms 2652 KB Output is correct
12 Correct 9 ms 2672 KB Output is correct
13 Correct 4 ms 2652 KB Output is correct
14 Correct 4 ms 2652 KB Output is correct
15 Correct 7 ms 2648 KB Output is correct
16 Correct 8 ms 2652 KB Output is correct
17 Correct 8 ms 2648 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 8 ms 2652 KB Output is correct
20 Correct 8 ms 2600 KB Output is correct