oj.uz

답안 #226405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226405 2020-04-23T18:05:56 Z cfalas 쌀 창고 (IOI11_ricehub) C++14
68 / 100
 28 ms 2304 KB 
#include<bits/stdc++.h>
using namespace std;
#include "ricehub.h"
#define ll long long
#define MID ((l+r)/2)


int besthub(int n, int rr, int x[], long long b) {
	int pre[n+1] = {};
	pre[0] = 0;
	for(int i=0;i<n;i++) pre[i+1] = pre[i] + x[i];
	int ans=0;
	for(int i=0;i<n;i++){
		int l=i;
		int r=n-1;
		int m, mm;
		while(l<=r){
			m = MID;
			int mid = (i+m)/2;
			//cout<<"mdian: "<<x[mid]<<endl;
			//cout<<"sum before: "<<pre[mid]-pre[i]<<endl;
			ll c = (mid-i) * x[mid] - pre[mid]+pre[i];
			//cout<<"sum after: "<<pre[m+1]-pre[mid+1]<<endl;
			c+= pre[m+1]-pre[mid+1] - (m-mid) * x[mid];
			//cout<<i<< " "<<m<<" "<<c<<endl;
			if(c>b) r = m-1;
			else mm=m, l=m+1;
		}
		ans = max(ans,mm-i+1);
	}
	return ans;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:29:19: warning: 'mm' may be used uninitialized in this function [-Wmaybe-uninitialized]
   ans = max(ans,mm-i+1);
                 ~~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 640 KB Output is correct
2 Correct 9 ms 640 KB Output is correct
3 Correct 28 ms 2304 KB Output is correct
4 Incorrect 28 ms 2176 KB Output isn't correct
5 Halted 0 ms 0 KB -