Submission #235846

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
235846	2020-05-30T07:23:39 Z	Dilshod_Imomov	Rice Hub (IOI11_ricehub)	C++17	68 / 100	1000 ms	1036 KB

ricehub

#include "ricehub.h"	
#include <bits/stdc++.h>
using namespace std;
// # define int long long

long long ps[100100];

int besthub(int n, int mx, int a[], long long b)
{
	for ( int i = 0; i < n; i++ ) {
		ps[i] = a[i];
		if ( i ) {
			ps[i] += ps[i - 1];
		}
	}
	int ans = 1;
	for ( int i = 0; i < n; i++ ) {
		int x = a[i];
		vector < int > vc;
		vc.push_back( 0 );
		for ( int j = i - 1; j >= 0; j-- ) {
			vc.push_back( vc.back() + (x - a[j]) );
		}
		// cout << x << '\n';
		// for ( auto j: vc ) {
		// 	cout << j << ' ';
		// }
		// cout << "\n";
		int l = i + 1, r = n - 1, mid;
		while ( l <= r ) {
			mid = (l + r) / 2;
			int sum = ps[mid] - ps[i];
			sum -= (mid - i) * x;
			int left = b - sum;
			if ( left < 0 ) {
				r = mid - 1;
			}
			else {
				// cout << mid << '\n';
				ans = max( ans, mid - i + 1 );
				auto it = upper_bound( vc.begin(), vc.end(), left );
				// it--;
				if ( it != vc.begin() ) {
					it--;
				}
				int ind = it - vc.begin();
				// cout << a[j] << ' ' << pr << ' ' << ind << '\n';
				ans = max( ans, mid - i + ind + 1 );
				l = mid + 1;
			}
		}
		/*
		long long pr = 0;
		for ( int j = i + 1; j < n; j++ ) {
			pr += a[j] - x;
			int 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--;
			}
			int 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	5 ms	384 KB	Output is correct
2	Correct	5 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	5 ms	384 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	6 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	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 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	5 ms	384 KB	Output is correct
17	Correct	4 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	4 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	6 ms	384 KB	Output is correct
24	Correct	6 ms	384 KB	Output is correct
25	Correct	6 ms	384 KB	Output is correct
26	Correct	6 ms	384 KB	Output is correct
27	Correct	6 ms	384 KB	Output is correct
28	Correct	6 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	8 ms	384 KB	Output is correct
4	Correct	8 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	6 ms	384 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct
8	Correct	8 ms	384 KB	Output is correct
9	Correct	6 ms	384 KB	Output is correct
10	Correct	6 ms	384 KB	Output is correct
11	Correct	7 ms	384 KB	Output is correct
12	Correct	7 ms	384 KB	Output is correct
13	Correct	8 ms	512 KB	Output is correct
14	Correct	9 ms	384 KB	Output is correct
15	Correct	6 ms	384 KB	Output is correct
16	Correct	6 ms	384 KB	Output is correct
17	Correct	7 ms	384 KB	Output is correct
18	Correct	7 ms	384 KB	Output is correct
19	Correct	8 ms	384 KB	Output is correct
20	Correct	9 ms	384 KB	Output is correct
21	Correct	84 ms	504 KB	Output is correct
22	Correct	85 ms	512 KB	Output is correct
23	Correct	84 ms	504 KB	Output is correct
24	Correct	85 ms	504 KB	Output is correct
25	Correct	86 ms	504 KB	Output is correct
26	Correct	85 ms	504 KB	Output is correct
27	Correct	85 ms	512 KB	Output is correct
28	Correct	85 ms	508 KB	Output is correct

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1093 ms	1036 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-