oj.uz

Submission #263341

# Submission time Handle Problem Language Result Execution time Memory
263341 2020-08-13T15:49:56 Z Berted Rice Hub (IOI11_ricehub) C++14
100 / 100
 22 ms 2560 KB 
#include "ricehub.h"
#include <iostream>
#define ll long long

using namespace std;

ll pref[100001];

int besthub(int R, int L, int X[], ll B)
{
	int ret = 0;
	for (int i = 1; i <= R; i++) pref[i] = pref[i - 1] + X[i - 1];
	int rg = 0; ll s = 0;
	for (int lf = 1; lf <= R; lf++)
	{
		rg = max(lf, rg);
		int md = lf + rg >> 1;
		s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]);
		while (rg <= R && s <= B)
		{
			rg++; md = lf + rg >> 1;
			s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]);
		}
		ret = max(ret, rg - lf);
	}	
	return ret;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:17:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   17 |   int md = lf + rg >> 1;
      |            ~~~^~~~
ricehub.cpp:21:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |    rg++; md = lf + rg >> 1;
      |               ~~~^~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 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 384 KB Output is correct
8 Correct 1 ms 380 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 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 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 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 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 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 384 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 2 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 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 3 ms 768 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 20 ms 2552 KB Output is correct
4 Correct 19 ms 2552 KB Output is correct
5 Correct 9 ms 1280 KB Output is correct
6 Correct 7 ms 1280 KB Output is correct
7 Correct 14 ms 2268 KB Output is correct
8 Correct 15 ms 2304 KB Output is correct
9 Correct 7 ms 1280 KB Output is correct
10 Correct 7 ms 1152 KB Output is correct
11 Correct 18 ms 2560 KB Output is correct
12 Correct 22 ms 2560 KB Output is correct
13 Correct 8 ms 1280 KB Output is correct
14 Correct 11 ms 1280 KB Output is correct
15 Correct 16 ms 2048 KB Output is correct
16 Correct 14 ms 2048 KB Output is correct
17 Correct 17 ms 2304 KB Output is correct
18 Correct 17 ms 2296 KB Output is correct
19 Correct 17 ms 2432 KB Output is correct
20 Correct 17 ms 2432 KB Output is correct