제출 #1250055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250055		tranvinhhuy2010	선물 (IOI25_souvenirs)	C++20	25 / 100	12 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n, cnt[105], p[105];

ll adu_calculate(ll s, ll k) {
    s += k*(k-1)/2;
    return s/k;
}

void adu_build(ll money) {
    auto [a, remain] = transaction(money);
    ll k = a.size();
    ll sum = money - remain;
    if (k==0) return;

    for (ll i : a)
        cnt[i]++;

    if (k==1) {
        p[a[0]] = sum;
        if (a[0]<n-1 && p[a[0]+1]==0) adu_build(sum-1);
    }
    else {
        ll x = adu_calculate(sum, k);
        if (p[a[0]+1]==0) adu_build(x-1);

        while (a.size()>1) {
            sum -= a.back();
            a.pop_back();
        }

        p[a[0]] = sum;
    }
}

void adu_complete() {
    for (ll i=1; i<n; i++) {
        while (cnt[i]<i) {
            transaction(p[i]);
            cnt[i]++;
        }
    }
}

void buy_souvenirs(int N, ll P0) {
    n = N;
    adu_build(P0-1);
    adu_complete();
}

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