oj.uz

Submission #235858

# Submission time Handle Problem Language Result Execution time Memory
235858 2020-05-30T08:00:05 Z Dilshod_Imomov Rice Hub (IOI11_ricehub) C++17
68 / 100
 100 ms 2304 KB 
#include "ricehub.h"	
#include <bits/stdc++.h>
using namespace std;
# define LL long long

long long ps[100100];

int besthub(int n, int mx, int a[], long long b)
{
	for ( LL i = 0; i < n; i++ ) {
		ps[i] = a[i];
		if ( i ) {
			ps[i] += ps[i - 1];
		}
	}
	LL ans = 1;
	for ( LL i = 0; i < n; i++ ) {
		LL x = a[i];
		// cout << x << '\n';
		// for ( auto j: vc ) {
		// 	cout << j << ' ';
		// }
		// cout << "\n";
		LL l = i + 1, r = n - 1, mid;
		while ( l <= r ) {
			mid = (l + r) / 2;
			long long sum = ps[mid] - ps[i];
			sum -= (mid - i) * x;
			long long left = b - sum;
			if ( left < 0 ) {
				r = mid - 1;
			}
			else {
				// cout << mid << '\n';
				ans = max( ans, mid - i + 1 );
				LL ll = 0, rr = i - 1, mid1, ind = i;
				while ( ll <= rr ) {
					mid1 = (ll + rr) / 2;
					long long sum1 = ps[i - 1];
					if ( mid1 ) {
						sum1 -= ps[mid1 - 1];
					}
					sum1 = (i - mid1) * x - sum1;
					if ( sum1 > left ) {
						ll = mid1 + 1;
					}
					else {
						rr = mid1 - 1;
						ind = mid1;
						// ans = max( ans, (mid - i) + (i - ind) + 1 );
					}
				}
				/*
				auto it = upper_bound( vc.begin(), vc.end(), left );
				// it--;
				if ( it != vc.begin() ) {
					it--;
				}
				LL ind = it - vc.begin();*/
				// cout << a[j] << ' ' << pr << ' ' << ind << '\n';
				ans = max( ans, (mid - i) + (i - ind) + 1 );
				l = mid + 1;
			}
		}
		/*
		long long pr = 0;
		for ( LL j = i + 1; j < n; j++ ) {
			pr += a[j] - x;
			LL left = b - pr;
			// cout << a[j] << ' ' << left << '\n';
			if ( left < 0 ) {
				continue;
			}
			ans = max( ans, j - i + 1 );
			auto it = upper_bound( vc.begin(), vc.end(), left );
			// it--;
			if ( it != vc.begin() ) {
				it--;
			}
			LL ind = it - vc.begin();
			// cout << a[j] << ' ' << pr << ' ' << ind << '\n';
			ans = max( ans, j - i + ind + 1 );
		}*/
	}
	return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 512 KB Output is correct
2 Correct 9 ms 640 KB Output is correct
3 Correct 63 ms 1536 KB Output is correct
4 Correct 100 ms 1536 KB Output is correct
5 Correct 20 ms 1280 KB Output is correct
6 Correct 20 ms 1280 KB Output is correct
7 Correct 62 ms 2304 KB Output is correct
8 Correct 85 ms 2304 KB Output is correct
9 Correct 35 ms 1152 KB Output is correct
10 Correct 35 ms 1152 KB Output is correct
11 Correct 65 ms 2304 KB Output is correct
12 Correct 97 ms 2304 KB Output is correct
13 Incorrect 24 ms 1280 KB Output isn't correct
14 Halted 0 ms 0 KB -