제출 #750063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
750063		TheOpChicken	Sparklers (JOI17_sparklers)	C++17	0 / 100	1 ms	312 KiB

sparklers

#include <iostream>
#include <algorithm>
using namespace std;

const long long maxN = 1e5 + 5, inf = 1e9;
long long arr[maxN];

int main(){
	long long n, k, t;
	cin >> n >> k >> t;

	for (int i = 0; i < n; i++) cin >> arr[i];
	k--;

	long long l = 1, r = inf, ans = inf;
	while(l <= r){
		long long mid = (l+r)/2, left_margin = 0, right_margin = 0, went_left = 0, went_right = 0;
		if(mid*t > inf){
			ans = mid;
			r = mid-1;
			continue;
		}

		int left = k, right = k, pos = 1;
		while(pos){
			pos = 0;
			while(left >= 1){
				long long last = arr[k] - 2*(k-(left-1))*mid*t + went_right - went_left;
				long long diff = arr[left-1] - last;
				
				if (last - left_margin <= arr[left-1]){
					pos = 1;
					left--;

					went_left += max(0ll, -diff);
					right_margin = max(0ll, diff);
					
					left_margin += min(0ll, diff);
				}
				else break;
			}

			while(right < n-1){
				long long last = arr[k] + 2*(right+1-k)*mid*t + went_right - went_left;
				long long diff = last - arr[right+1];
				if (last + right_margin >= arr[right+1]){
					pos = 1;
					right++;

					went_right += max(0ll, -diff);
					left_margin = max(0ll, diff);

					right_margin += min(0ll, diff);
				}
				else break;
			}
		}

		if (left == 0 && right == n-1){
			ans = mid;
			r = mid-1;
		}

		else l = mid+1;
	}

	cout << ans << endl;
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 20
• Subtask 3: 0 / 50