제출 #233125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
233125		crossing0ver	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	22 ms	2432 KiB

ricehub

#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int n, int L, int X[], long long B){ 
	long long sum = 0,tot = 0;
	int num = 0;
	int last = 0;
	vector<long long> PR(n);
	int ans = 0,ps = 0;
	for (int i = 0 ; i < n; i++) {
		sum += X[i];
		tot += X[i];
		PR[i] = sum;         
		num++;                   
		while (true) {
		long long  e = tot/num;
		int pos = (last + i + 1)/2;
		long long D = 0; 
		long long s = 1ll*X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -1ll*X[pos]*( i - pos);
		if (s <= B)
		if (ans < i - last + 1) 
			ans = i - last + 1, ps = X[pos];
		if (pos > last) pos--;
		
		D = s; 
		/*                                  
		pos = upper_bound(X + last, X + i+1, e) - X - 1;
		if (pos <= i && pos >= last) {
		s =X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -X[pos]*( i - pos);
		D = min(D,s);
			if (s <= B)
		if (ans < i - last + 1)        
			ans = i - last + 1, ps = X[pos];
		}      */
		if (D > B) {
			tot-=X[last];
			last++;
			num--;
			continue;
		}                      
		else break;
		}
	}
	return ans;
}         /*
main() {
	int n,L;
	long long B;
	cin >> n >> L >> B;   int X[n];
	for (int i = 0; i < n ; i++) cin >> X[i];
	 cout << besthub(n,L,X,B);
}          */
					              

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:16:14: warning: unused variable 'e' [-Wunused-variable]
   long long  e = tot/num;
              ^
ricehub.cpp:9:14: warning: variable 'ps' set but not used [-Wunused-but-set-variable]
  int ans = 0,ps = 0;
              ^~

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32