| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1257233 | stapanulocu1 | Souvenirs (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB | 
#include <bits/stdc++.h>
using namespace std;
const int N = 100;
pair<vector<int>, long long> transaction(long long M);
int n;
struct el
{
    vector<int> s;
    long long b, r;
};
vector<el> q;
long long value[N];
int number[N];
void update_data(el &r)
{
    for (int i = 0; i < r.s.length(); ++i)
    {
        if (value[r.s[i]])
        {
            r.b -= value[r.s[i]];
            r.erase(r.begin() + i);
            --i;
        }
    }
}
void do_q(long long a)
{
    pair<vector<int>, long long> result = transaction(a);
    el b;
    b.s = result.first;
    b.b = a;
    b.r = result.second;
    for (int i = 0; i < b.s.length(); ++i)
    {
        number[b.s[i]]++;
    }
    update_data(b);
    q.push_back(b);
}
void figure_smallest(el q)
{
    if (q.s.length() == 1)
    {
        velue[q.s[0]] = q.b - q.r;
        for (int i = 0; i < q.size(); ++i)
            update_data(q[i]);
        return;
    }
    long long avg = (q.b - q.r) / q.s.length();
    do_q(avg);
    figure_smallest(q.back());
}
void finish_all()
{
    for (int i = 0; i < n; ++i)
    {
        while (number[i] < i)
        {
            do_q(value[i]);
        }
    }
}
void buy_souvenirs(int nu, long long P0)
{
    n = nu;
    value[0] = P0;
    do_q(P0 - 1);
    figure_smallest(*q.being());
    finish_all();
}
