제출 #1345302

#제출 시각아이디문제언어결과실행 시간메모리
1345302Jer선물 (IOI25_souvenirs)C++20
21 / 100
8 ms344 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void buy_souvenirs(int n, long long p0)
{
	ll curr = p0;
	pair<vector<int>, ll> res;

	vector<int> done(n + 1, 0);
	for (int i = 1; i < n; i++)
	{
		if (i == n - 1)
			curr++;
		res = transaction(curr - 2);

		if (res.first[0] == i)
			curr -= 2;
		else
			curr--;

		for (auto i : res.first)
			done[i]++;

		while (done[i] < i)
			transaction(curr), done[i]++;
	}

	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...