Submission #1311935

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311935		Cyanberry	선물 (IOI25_souvenirs)	C++20	39 / 100	13 ms	400 KiB

souvenirs

#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long

void buy_souvenirs(int N, long long P0) {
	pair<vector<int>, long long> res;
	if (N == 2) {
		res = transaction(P0-1);
		return;
	} else if (N == 3) {
		res = transaction(P0-1);
		if (res.first.size() == 1) {
			ll a = P0 - res.second;
			transaction(a-2);
			transaction(a-2);
		} else {
			ll a = P0 - res.second-1;
			transaction(a/2);
		}
		return;
	}
	vector<int> ret(N, 0);
	vector<ll> prices(N, -1);
	prices[0] = P0;
	for (int i = 1; i < N; ++i) {
		res = transaction(prices[i-1]-1);
		if (res.first.size() == 1 && res.second == 0) {
			prices[i] = prices[i-1]-1;
		} else {
			prices[i] = prices[i-1]-2;
		}
		for (int j : res.first) {
			++ret[j];
		}
		while (ret[i] < i)
		{
			transaction(prices[i]);
			++ret[i];
		}	
	}
	return;
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 14 / 14
• Subtask 4: 18 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33