oj.uz

Submission #335796

# Submission time Handle Problem Language Result Execution time Memory
335796 2020-12-14T03:08:22 Z sumit_kk10 Rice Hub (IOI11_ricehub) C++14
43 / 100
 1000 ms 748 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;


long long int besthub(int r, int l, int a[], long long int b){
	long long int ans = 0;
	for(int i = 0; i < r; ++i){
		int j = i - 1, k = i + 1;
		long long int budget = b, how_many = 1;
		while(budget){
			if(j < 0 and k >= r) break;
			if(abs(a[j] - a[i]) <= abs(a[k] - a[i]) and abs(a[j] - a[i]) <= budget and j >= 0){
				// if(i == 3)
					// cout << a[j] << ' ';
				budget -= abs(a[j] - a[i]);
				++how_many;
				--j;
			}
			else if(abs(a[k] - a[i]) <= abs(a[j] - a[i]) and abs(a[k] - a[i]) <= budget and k < r){
				budget -= abs(a[k] - a[i]);
				++how_many;
				++k;
			}
			else
				break;
		}
		// cout << how_many << ' ';
		ans = max(ans, how_many);
	}
	return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 1 ms 364 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 492 KB Output is correct
2 Correct 7 ms 492 KB Output is correct
3 Execution timed out 1090 ms 748 KB Time limit exceeded
4 Halted 0 ms 0 KB -