제출 #477737

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

ricehub

#include "ricehub.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
using namespace std;

int besthub(int n, int l, int x[], long long tmp_b)
{
	multiset<int> tmp;
	vector<int> vec;
	for (int i = 0; i < n; i++) vec.push_back(x[i]), tmp.insert(x[i]);
	int mx = 0;
	for (int& i : vec)
	{
		int ans = 0;
		multiset<int> ms = tmp;
		long long b = tmp_b;
		while (b)
		{
			auto it1 = ms.lower_bound(i);
			auto it2 = ms.upper_bound(i);
			int num1 = -1, num2 = -1;
			if (it1 != ms.end()) num1 = *it1;
			if (it2 != ms.begin()) it2--, num2 = *it2;
			if (num1 == -1 && num2 == -1) continue;
			if (num1 == -1)
			{
				if (i - num2 <= b) b -= i - num2, ans++, ms.erase(ms.find(num2));
				else break;
			}
			else if (num2 == -1)
			{
				if (num1 - i <= b) b -= num1 - i, ans++, ms.erase(ms.find(num1));
				else break;
			}
			else
			{
				if (min(num1 - i, i - num2) <= b)
				{
					if (num1 - i <= i - num2) b -= num1 - i, ans++, ms.erase(ms.find(num1));
					else b -= i - num2, ans++, ms.erase(ms.find(num2));
				}
				else break;
			}
		}
		mx = max(mx, ans);
	}
	return mx;
}

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