제출 #1185950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185950		trvhung	쌀 창고 (IOI11_ricehub)	C++20	68 / 100	1093 ms	584 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;
ll buds;

void solve() {
	vector<int> v;
	for (int i = 1; i <= n; ++i) {
		v.clear();
		for (int j = 1; j <= n; ++j)
			v.push_back(abs(x[i] - x[j]));

		sort(v.begin(), v.end());
		ll sum = 0; int cnt = 0;

		for (int x: v) {
			if (sum + x > buds) break;
			sum += x; cnt++;
		}

		maximize(res, cnt);
	}
}

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: 0 / 32