oj.uz

Submission #120039

# Submission time Handle Problem Language Result Execution time Memory
120039 2019-06-23T05:46:31 Z turbat Rice Hub (IOI11_ricehub) C++14
0 / 100
 5 ms 640 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
#define N 100005

long long s[N];

bool can(int l, int r, long long cost, int X[]){
	int mid = (l + r) / 2;
	return cost >= s[r] - s[mid] - ((r - l) % 2 == 0 ? X[mid] : 0);
}

int besthub(int R, int L, int X[], long long B){
	int ans = 0;
	for (int i = 1;i <= R;i++) s[i] = s[i - 1] + X[i - 1];
	for (int i = 1;i <= R;i++){
		int l = i, r = R, mid;
		while (l != r){
			mid = (l + r + 1) / 2;
			if (can(l, mid, B, X)) l = mid;
			else r = mid - 1;
		}
		ans = max(ans, l - i + 1);
	}
  return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -