oj.uz

Submission #787530

# Submission time Handle Problem Language Result Execution time Memory
787530 2023-07-19T09:11:20 Z Blagoj Rice Hub (IOI11_ricehub) C++17
0 / 100
 2 ms 468 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

#define ll long long

int besthub(int R, int L, int X[], ll B) {
	ll ans = 1, cntL = 1, sum = 0, l = 0;
	for (int i = 1; i < R; i++) {
		sum += cntL * (X[i] - X[i - 1]);
		while (sum > B) {
			sum -= X[i] - X[l];
			l++;
			cntL--;
		}
		cntL++;
		ans = max(ans, cntL);
	}
	return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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