oj.uz

Submission #436960

# Submission time Handle Problem Language Result Execution time Memory
436960 2021-06-25T11:41:41 Z adamjinwei Rice Hub (IOI11_ricehub) C++14
100 / 100
 18 ms 1740 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
#define inf 1000000007
#define mod 1000000007
#define rnd() dist(rand_num)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#define int long long
using namespace std;
unsigned seed=std::chrono::system_clock::now().time_since_epoch().count();
mt19937 rand_num(seed);
uniform_int_distribution<int> dist(0,inf);
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n,m,b;
int x[100005];
bool check(int mid)
{
	if(mid==1) return b>=0;
	for(int l=1;l+mid-1<=n;++l)
	{
		int r=l+mid-1;
		if(mid%2==0)
		{
			int x1=(r+l-1)/2,x2=(r+l+1)/2;
			if(x[r]-x[x2-1]-x[x1]+x[l-1]<=b) return true;
		}
		else
		{
			int x1=(l+r)/2-1,x2=(l+r)/2+1;
			if(x[r]-x[x2-1]-x[x1]+x[l-1]<=b) return true;
		}
	}
	return false;
}
signed besthub(signed R,signed L,signed X[],int B)
{
	n=R;
	m=L;
	b=B;
	for(int i=1;i<=n;++i)
	{
		x[i]=X[i-1];
		x[i]+=x[i-1];
	}
	int l=1,r=n;
	while(l<r)
	{
		int mid=l+r+1>>1;
		if(check(mid)) l=mid;
		else
			r=mid-1;
	}
	return l;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:62:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   62 |   int mid=l+r+1>>1;
      |           ~~~^~

Subtask #1
17.0 / 17.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 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

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 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 312 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 312 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 312 KB Output is correct
17 Correct 1 ms 308 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 308 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 204 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 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 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 332 KB Output is correct
8 Correct 1 ms 332 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 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 316 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 332 KB Output is correct
21 Correct 2 ms 324 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 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 356 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 580 KB Output is correct
2 Correct 4 ms 580 KB Output is correct
3 Correct 16 ms 1612 KB Output is correct
4 Correct 18 ms 1740 KB Output is correct
5 Correct 8 ms 1100 KB Output is correct
6 Correct 8 ms 1100 KB Output is correct
7 Correct 13 ms 1680 KB Output is correct
8 Correct 14 ms 1712 KB Output is correct
9 Correct 7 ms 1100 KB Output is correct
10 Correct 7 ms 1156 KB Output is correct
11 Correct 16 ms 1684 KB Output is correct
12 Correct 17 ms 1604 KB Output is correct
13 Correct 12 ms 1072 KB Output is correct
14 Correct 12 ms 1140 KB Output is correct
15 Correct 12 ms 1356 KB Output is correct
16 Correct 13 ms 1420 KB Output is correct
17 Correct 14 ms 1588 KB Output is correct
18 Correct 15 ms 1484 KB Output is correct
19 Correct 15 ms 1612 KB Output is correct
20 Correct 15 ms 1572 KB Output is correct