oj.uz

답안 #921904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921904 2024-02-04T13:31:45 Z thunopro 쌀 창고 (IOI11_ricehub) C++14
100 / 100
 15 ms 7940 KB 
#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std ; 
#define ll long long 
#define maxn 500009 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1 
#define re exit(0); 
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1  
 
const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 
 
typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<ll> vl ; 
typedef vector<pii> vii ; 
 
void add ( int &a , int b ) 
{
	a += b ;
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}
 
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 
 
void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
}
 
int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n , m ; 
int a [maxn] ; 
ll budget ; 

ll sum [maxn] ; 

void prepare () 
{
	for ( int i = 1 ; i <= n ; i ++ ) sum [i] = sum [i-1] + a [i] ; 
}

ll get ( int l , int r ) 
{
	return sum [r] - sum [l-1] ; 
}
ll calc ( int l , int r ) 
{
	int mid = (l+r)/2 ; 
	return 1ll*a[mid]*(mid-l+1)-get(l,mid)+get(mid+1,r)-1ll*(r-mid)*a[mid] ; 
}

int solve () 
{
	prepare () ; 
	
	int res = 0 ; 
	
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		int l = i , r = n ;
		int pos = - 1;  
		while ( l <= r ) 
		{
			int mid = (l+r)/2 ; 
			if ( calc (i,mid) <= budget ) l = mid + 1 , pos = mid ; 
			else r = mid - 1 ; 
		}
		chkmax (res,pos-i+1) ; 
	}
	
	return res ; 
	
}

int _R , _L , _X [maxn] ; 
ll _B ; 

int besthub ( int R , int L , int X [] , ll B ) 
{
	n = R , m = L ; 
	for ( int i = 1 ; i <= n ; i ++ ) a [i] = X [i-1] ; 
	budget = B ; 
	return solve () ; 
}
//int main () 
//{
//	ios_base::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
//	rf () ;
//	
//	cin >> _R >> _L >> _B ; 
//	for ( int i = 0 ; i < _R ; i ++ ) cin >> _X [i] ; 
//	
//	cout << best_hub (_R,_L,_X,_B) ; 	
//	
//}

Compilation message

ricehub.cpp: In function 'void rf()':
ricehub.cpp:35:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4544 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4540 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4540 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4548 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4536 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4448 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4472 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4640 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 2 ms 4444 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 2 ms 4444 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 15 ms 7772 KB Output is correct
4 Correct 15 ms 7940 KB Output is correct
5 Correct 8 ms 7004 KB Output is correct
6 Correct 9 ms 7180 KB Output is correct
7 Correct 13 ms 7472 KB Output is correct
8 Correct 13 ms 7516 KB Output is correct
9 Correct 8 ms 7000 KB Output is correct
10 Correct 7 ms 7004 KB Output is correct
11 Correct 14 ms 7772 KB Output is correct
12 Correct 15 ms 7724 KB Output is correct
13 Correct 8 ms 7260 KB Output is correct
14 Correct 7 ms 7052 KB Output is correct
15 Correct 11 ms 7516 KB Output is correct
16 Correct 11 ms 7636 KB Output is correct
17 Correct 13 ms 7772 KB Output is correct
18 Correct 13 ms 7772 KB Output is correct
19 Correct 14 ms 7768 KB Output is correct
20 Correct 13 ms 7772 KB Output is correct