oj.uz

답안 #343416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343416 2021-01-03T22:47:26 Z CSQ31 쌀 창고 (IOI11_ricehub) C++14
100 / 100
 21 ms 3052 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 ans = 0;
	int n = R;
	vector<ll>x(n+1);
	for(int i=1;i<=n;i++)x[i] = X[i-1];
	vector<ll>pref(n+1);
	for(int i=1;i<=n;i++)pref[i] = pref[i-1]+x[i];
	//for(int i=0;i<=n;i++)cout<<pref[i]<<" ";
	//cout<<'\n';
	for(int l=1,r=1;r<=n;r++){
		int mid = (l+r)/2;
		ll lf = pref[mid]-pref[l-1];
		ll rg = pref[r]-pref[mid];
		ll cost = (mid-l+1)*x[mid] - lf + rg -(r-mid)*x[mid];
		while(cost > B){
			l++;
		    mid = (l+r)/2;
		    lf = pref[mid]-pref[l-1];
		    rg = pref[r]-pref[mid];
		    cost = (mid-l+1)*x[mid] - lf + rg -(r-mid)*x[mid];	
		}
		//cout<<l<<" "<<r<<" "<<cost<<'\n';
		ans = max(ans,r-l+1);
	}
	return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 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
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 1 ms 492 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 364 KB Output is correct
11 Correct 1 ms 268 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 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 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 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 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 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 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 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 876 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 20 ms 3052 KB Output is correct
4 Correct 21 ms 2924 KB Output is correct
5 Correct 8 ms 1644 KB Output is correct
6 Correct 7 ms 1644 KB Output is correct
7 Correct 15 ms 2924 KB Output is correct
8 Correct 15 ms 3052 KB Output is correct
9 Correct 9 ms 1644 KB Output is correct
10 Correct 7 ms 1644 KB Output is correct
11 Correct 16 ms 2924 KB Output is correct
12 Correct 16 ms 2924 KB Output is correct
13 Correct 8 ms 1644 KB Output is correct
14 Correct 8 ms 1644 KB Output is correct
15 Correct 12 ms 2412 KB Output is correct
16 Correct 12 ms 2412 KB Output is correct
17 Correct 15 ms 2668 KB Output is correct
18 Correct 14 ms 2668 KB Output is correct
19 Correct 16 ms 2796 KB Output is correct
20 Correct 15 ms 2796 KB Output is correct