제출 #1109875

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109875		santi3223	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	15 ms	4512 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define ff(i, p, x) for (ll i = p; i < x; i++)
#define ed "\n"

int besthub(int r, int l, int x[], ll b){
	vl psum(r+1, 0);
	ff(i, 0, r){
		psum[i+1] = psum[i]+x[i];
	}
	ll ri = 0, c = 0;
	ff(le, 0, r){
		while(ri < r){
			ll mid = (le+ri+1)/2;
			ll q = 0;
			if((le+ri+1) % 2 != 0){
				q -= x[mid];
			}
			q -= psum[mid]-psum[le];
			q += psum[ri+1] - psum[mid];
			if(q > b){
				break;
			}
			ri++;
		}
		c = max(c, ri-le);
		if(ri == r){
			break;
		}
	}
	return c;
}

//cambio de valores

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