Submission #199792

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
199792	2020-02-03T12:24:52 Z	aer0park	Rice Hub (IOI11_ricehub)	C++14	32 / 100	27 ms	2680 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
#define f first
#define s second
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> pi;
 
ll sum,anw,cnt=1;
queue<ll> st,ed;

int besthub(int r,int l,int x[],ll b)
{
	for(int i=r;i>=1;i--)
		x[i]=x[i-1];
	x[r+1]=l+1;
	for(int i=1;i<=r;i++)
	{
		sum+=(st.size()-ed.size())*(x[i]-x[i-1]);
		if(!ed.empty()) st.push(ed.front()),ed.pop();
		else st.push(cnt),cnt++;
		if(sum<=b) anw=max(anw,(ll)st.size()+(ll)ed.size());
		while(st.size()>=2&&(sum>b||x[i]-x[st.front()]>=x[cnt]-x[i]))
			sum-=x[i]-x[st.front()],st.pop();
		while(cnt<=r&&sum+x[cnt]-x[i]<=b)
			ed.push(cnt),sum+=x[cnt]-x[i],cnt++;
		anw=max(anw,(ll)st.size()+(ll)ed.size());
	}
	return anw;
}

Subtask #1

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Incorrect	5 ms	256 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	5 ms	376 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Incorrect	5 ms	376 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Incorrect	5 ms	376 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #4

32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	376 KB	Output is correct
2	Correct	8 ms	504 KB	Output is correct
3	Correct	24 ms	2680 KB	Output is correct
4	Correct	23 ms	2552 KB	Output is correct
5	Correct	13 ms	888 KB	Output is correct
6	Correct	14 ms	888 KB	Output is correct
7	Correct	23 ms	2296 KB	Output is correct
8	Correct	25 ms	2296 KB	Output is correct
9	Correct	14 ms	888 KB	Output is correct
10	Correct	15 ms	888 KB	Output is correct
11	Correct	26 ms	2680 KB	Output is correct
12	Correct	26 ms	2552 KB	Output is correct
13	Correct	15 ms	1016 KB	Output is correct
14	Correct	16 ms	1016 KB	Output is correct
15	Correct	21 ms	2040 KB	Output is correct
16	Correct	21 ms	2040 KB	Output is correct
17	Correct	25 ms	2424 KB	Output is correct
18	Correct	25 ms	2424 KB	Output is correct
19	Correct	27 ms	2552 KB	Output is correct
20	Correct	25 ms	2552 KB	Output is correct