oj.uz

Submission #297957

# Submission time Handle Problem Language Result Execution time Memory
297957 2020-09-12T08:23:19 Z Hemimor Rice Hub (IOI11_ricehub) C++14
100 / 100
 20 ms 2688 KB 
#include "ricehub.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int n;
ll m;
vl a;

bool f(int x){
	ll res,tmp=0;
	for(int i=0;i<x/2;i++) tmp-=a[i];
	for(int i=x/2+1;i<x;i++) tmp+=a[i];
	res=tmp+(x+1)%2*a[x/2];
//	if(x==2) cout<<tmp+(x+1)%2*a[x/2]<<endl;
	for(int i=x;i<n;i++){
//		if(x==2) cout<<tmp+(x+1)%2*a[i-(x-1)/2]<<endl;
		tmp+=a[i];
		tmp-=a[i-(x-1)/2];
		tmp+=a[i-x];
		tmp-=a[i-x+x/2];
		res=min(res,tmp+(x+1)%2*a[i-(x-1)/2]);
	}
	return res<=m;
}

int besthub(int R, int L, int X[], ll B){
	n=R,m=B;
//	cout<<m<<endl;
	a=vl(n);
	for(int i=0;i<n;i++) a[i]=X[i];
	int l=1,r=n+1;
	while(r-l>1){
		int mid=(l+r)/2;
		if(f(mid)) l=mid;
		else r=mid;
	}
	return l;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 416 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 768 KB Output is correct
3 Correct 19 ms 2560 KB Output is correct
4 Correct 20 ms 2688 KB Output is correct
5 Correct 9 ms 1280 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 17 ms 2304 KB Output is correct
8 Correct 17 ms 2296 KB Output is correct
9 Correct 9 ms 1152 KB Output is correct
10 Correct 9 ms 1152 KB Output is correct
11 Correct 20 ms 2560 KB Output is correct
12 Correct 20 ms 2688 KB Output is correct
13 Correct 10 ms 1280 KB Output is correct
14 Correct 10 ms 1280 KB Output is correct
15 Correct 15 ms 2048 KB Output is correct
16 Correct 15 ms 1920 KB Output is correct
17 Correct 18 ms 2296 KB Output is correct
18 Correct 18 ms 2304 KB Output is correct
19 Correct 20 ms 2432 KB Output is correct
20 Correct 19 ms 2432 KB Output is correct