Submission #468847

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
468847	2021-08-29T20:38:45 Z	pere_gil	Rice Hub (IOI11_ricehub)	C++14	68 / 100	21 ms	2124 KB

ricehub

#include "ricehub.h"
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

ll get_sum(int l, int r, vector<int> &sum){
	return (l==0) ? sum[r] : sum[r]-sum[l-1];
}

bool check(int l, int r, ll b, int v[], vector<int> &sum){
	int med=(l+r)>>1;
	ll act=v[med]*(med-l+1)-get_sum(l,med,sum);
	act+=get_sum(med,r,sum)-v[med]*(r-med+1);
	return act<=b;
}

int besthub(int n, int dist, int v[], ll b){
	vector<int> sum(n);
	sum[0]=v[0];
	for(int i=1;i<n;i++)
		sum[i]=sum[i-1]+v[i];

	int res=0;
	for(int i=0;i<n;i++){
		int l=i,r=n-1,act=0;
		while(l<=r){
			int med=(l+r)>>1;
			if(check(i,med,b,v,sum)){
				act=med;
				l=med+1;
			}
			else r=med-1;
		}
		res=max(res,r-i+1);
	}
	return res;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, ll)':
ricehub.cpp:26:17: warning: variable 'act' set but not used [-Wunused-but-set-variable]
   26 |   int l=i,r=n-1,act=0;
      |                 ^~~

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	304 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 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	0 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	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	284 KB	Output is correct
21	Correct	1 ms	204 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	308 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	1 ms	204 KB	Output is correct

Subtask #3

26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 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	1 ms	204 KB	Output is correct
16	Correct	1 ms	304 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 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	2 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	320 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	460 KB	Output is correct
2	Correct	4 ms	588 KB	Output is correct
3	Correct	21 ms	2048 KB	Output is correct
4	Incorrect	21 ms	2124 KB	Output isn't correct
5	Halted	0 ms	0 KB	-