oj.uz

답안 #660287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660287 2022-11-21T13:12:57 Z Trisanu_Das 쌀 창고 (IOI11_ricehub) C++17
100 / 100
 13 ms 1752 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
 
int besthub(int n, int L, int x[], long long b){
	int ans = 0; long long curr_cost = 0;
	for(int l = 0, r = 0; l < n; l++){
		while(r + 1 < n && curr_cost + x[r + 1] - x[(l + r + 1) / 2] <= b){
			curr_cost += x[r + 1] - x[(l + r + 1) / 2]; r++; ans = max(ans, r - l + 1);
		}
		curr_cost += x[l] - x[(r + l + 1) / 2];
	}
	return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 312 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 0 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 224 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 316 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 312 KB Output is correct
8 Correct 1 ms 220 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 220 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 0 ms 312 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 312 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 12 ms 1752 KB Output is correct
4 Correct 13 ms 1748 KB Output is correct
5 Correct 5 ms 828 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 9 ms 1396 KB Output is correct
8 Correct 12 ms 1372 KB Output is correct
9 Correct 4 ms 804 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 11 ms 1700 KB Output is correct
12 Correct 12 ms 1744 KB Output is correct
13 Correct 5 ms 812 KB Output is correct
14 Correct 5 ms 828 KB Output is correct
15 Correct 9 ms 1328 KB Output is correct
16 Correct 8 ms 1356 KB Output is correct
17 Correct 10 ms 1620 KB Output is correct
18 Correct 10 ms 1584 KB Output is correct
19 Correct 10 ms 1680 KB Output is correct
20 Correct 10 ms 1620 KB Output is correct