Submission #1250014

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250014		kaloyan	선물 (IOI25_souvenirs)	C++20	4 / 100	12 ms	412 KiB

souvenirs

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100 + 10;

int counter[MAXN];

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

void buy_souvenirs(int N, long long P0){
    
    if(N == 2) {
        auto [L, R] = transaction(P0 - 1);
        return;
    }
    
    for(int i = 1 ; i < N ; ++i){
        while(counter[i] < i){
            auto [L, R] = transaction(N - i);
        }
    }

}

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