oj.uz

Submission #744638

# Submission time Handle Problem Language Result Execution time Memory
744638 2023-05-18T21:32:35 Z CSQ31 Rice Hub (IOI11_ricehub) C++17
100 / 100
 24 ms 2492 KB 
#pragma GCC optimize("Ofast") 
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int besthub(int R, int L, int X[], long long B)
{
	int n = R;
	vector<ll>p(n,0);
	for(int i=0;i<n;i++){
		p[i] = X[i];
		if(i)p[i]+=p[i-1];
	}
	int ans = 0;
	for(int i=0;i<n;i++){
		int l = 1,r = min(i+1,n-i-1);
		while(r>=l){
			int mid = (l+r)/2;
			ll a = p[i+mid] - p[i];
			ll b = p[i] - (i-mid>=0?p[i-mid]:0);
			if(a-b > B)r = mid-1;
			else l = mid+1;
		}
	    ans = max(ans,2*r);
	    l = 1,r = min(i+1,n-i);
	    while(r>=l){
			int mid = (l+r)/2;
			ll a = p[i+mid-1] - p[i];
			ll b = p[i] - (i-mid>=0?p[i-mid]:0);
			if(a-b+X[i] > B)r = mid-1;
			else l = mid+1;
		}
		ans = max(ans,2*r-1);
	}
	return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 680 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 18 ms 2424 KB Output is correct
4 Correct 18 ms 2476 KB Output is correct
5 Correct 9 ms 1236 KB Output is correct
6 Correct 8 ms 1236 KB Output is correct
7 Correct 16 ms 2228 KB Output is correct
8 Correct 16 ms 2260 KB Output is correct
9 Correct 12 ms 1108 KB Output is correct
10 Correct 13 ms 1140 KB Output is correct
11 Correct 24 ms 2468 KB Output is correct
12 Correct 23 ms 2492 KB Output is correct
13 Correct 9 ms 1236 KB Output is correct
14 Correct 9 ms 1248 KB Output is correct
15 Correct 13 ms 1960 KB Output is correct
16 Correct 13 ms 1876 KB Output is correct
17 Correct 15 ms 2252 KB Output is correct
18 Correct 17 ms 2260 KB Output is correct
19 Correct 22 ms 2464 KB Output is correct
20 Correct 21 ms 2324 KB Output is correct