답안 #672119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672119	2022-12-14T19:31:16 Z	Hacv16	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	12 ms	2600 KB

ricehub

#include<bits/stdc++.h>
#include "ricehub.h"
 
using namespace std;
 
typedef long long ll;
const int MAX = 2e6 + 15;
const ll INF = 5e18 + 15;

int n, x[MAX], px[MAX], L;
ll b;

ll sum(int l, int r){
	return px[r] - (l == 0 ? 0 : px[l - 1]);
}

bool f(ll s){
	for(int l = 0, r = s - 1; r < n; l++, r++){
		int m = (l + r) >> 1; 
		ll cost = 0;

		cost += sum(m + 1, r) - (r - m) * x[m];
		cost += (m - l) * x[m] - sum(l, m - 1);

		if(cost <= b) return true; 
	}

	return false;
}

int besthub(int _n, int _L, int _x[], ll _b){
	n = _n, L = _L, b = _b;

	for(int i = 0; i < n; i++)
		x[i] = _x[i];

	for(int i = 1; i < n; i++)
		px[i] = x[i] + px[i - 1];

	int l = 0, r = n, ans = 0;
 
	while(l <= r){ //bbin na resposta
		int m = (l + r) >> 1;
		if(f(m)) l = m + 1, ans = m;
		else r = m - 1;
	}

	return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 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	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	308 KB	Output is correct
18	Correct	0 ms	312 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	212 KB	Output is correct
23	Correct	0 ms	308 KB	Output is correct
24	Correct	0 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	1 ms	212 KB	Output is correct
28	Correct	1 ms	308 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 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	340 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	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	468 KB	Output is correct
2	Correct	2 ms	444 KB	Output is correct
3	Correct	11 ms	1492 KB	Output is correct
4	Incorrect	12 ms	2600 KB	Output isn't correct
5	Halted	0 ms	0 KB	-