Submission #1250741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250741		starnightsnow	Souvenirs (IOI25_souvenirs)	C++20	22 / 100	0 ms	412 KiB

souvenirs

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

extern pair<vector<int>, long long> transaction(long long M);

void buy_souvenirs(int N, long long P0) {
    long long expless1 = P0 - 1;
    if (N == 2) {
        auto [gotten, change] = transaction(expless1);
        return;
    }
    if(N == 3){
        auto [gotten1, change1] = transaction(expless1);
        ll use;
        if(gotten1.size() == 1){
            use = (expless1) - change1 - 1;
            auto [gotten2, change2] = transaction(use);
            auto [gotten3, change3] = transaction(use);
        }
        else{
            use = (expless1 - change1 - 1) / 2;
            auto [gotten2, change2] = transaction(use);
        }
        return;
    }

    vector<ll> prices(N);
    vector<int> bought(N, 0);
    prices[0] = P0;
    
    for (int i = 1; i < N; ++i) {
        auto [gotten, change] = transaction(prices[i - 1] - 1);
        for (auto item : gotten)
            bought[item]++;
        if (gotten.size() == 1) 
            prices[i] = max(1LL, prices[i - 1] - change - 1);
        else 
            prices[i] = max(1LL, prices[i - 1] / 2);
        if (i >= 2) 
            prices[i] = min(prices[i], prices[i - 2] - prices[i - 1]);
    }

    for (int i = 1; i < N; ++i) {
        while (bought[i] < i) {
            auto [gotten, change] = transaction(prices[i]);
            for (int item : gotten)
                bought[item]++;
        }
    }

}

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