Submission #1185957

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185957		trvhung	쌀 창고 (IOI11_ricehub)	C++20	100 / 100	9 ms	1096 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int N = 1e5 + 5;
int n, x[N], res = 1;
ll buds;

void solve() {
	int ptl = 1, ptr = 0;
	ll sum = 0;

	for (int i = 1; i <= n; ++i)
		if (sum + x[i] - x[1] <= buds) {
			sum += x[i] - x[1];
			ptr = i;
		}

// 	cout << 1 << ' ' << ptl << ' ' << ptr << el; 

	res = ptr;
	for (int i = 2; i <= n; ++i) {
		sum -= 1LL * (ptr - i + 1) * (x[i] - x[i - 1]);
		sum += 1LL * (i - ptl) * (x[i] - x[i - 1]);
		if (ptr < i) ptr = i;

		while (sum > buds)
			if (x[i] - x[ptl] > x[ptr] - x[i])
				sum -= x[i] - x[ptl++];
			else 
				sum -= x[ptr--] - x[i];

		while (ptl > 1 && ptr < n) {
			int distL = x[i] - x[ptl - 1];
			int distR = x[ptr + 1] - x[i];
			if (sum + min(distL, distR) > buds) break;
			if (distL < distR)
				sum += distL, ptl--;
			else
				sum += distR, ptr++;
		}

		while (ptl > 1 && ptr > i) {
			int distL = x[i] - x[ptl - 1];
			int distR = x[ptr] - x[i];
			if (distR > distL)
				sum += distL, sum -= distR, ptl--, ptr--;
			else 
				break;
		}

		while (ptl < i && ptr < n) {
			int distL = x[i] - x[ptl];
			int distR = x[ptr + 1] - x[i];
			if (distL > distR)
				sum += distR, sum -= distL, ptl++, ptr++;
			else
				break;
		}

		while (ptl > 1 && sum + x[i] - x[ptl - 1] <= buds)
			sum += x[i] - x[--ptl];
		while (ptr < n && sum + x[ptr + 1] - x[i] <= buds)
			sum += x[++ptr] - x[i];

		// cout << i << ' ' << ptl << ' ' << ptr << el;
		maximize(res, ptr - ptl + 1);
	}
}

int besthub(int R, int L, int X[], long long B) {
	n = R; buds = B;
	for (int i = 1; i <= n; ++i)
		x[i] = X[i - 1];

	solve();

	return res;
}

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