제출 #1250071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250071		kaloyan	Souvenirs (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) 
    {
        transaction(P0 - 1);
    }
    else if(N == 3)
    {
        
        pair<vector<int>, long long> p = transaction(P0 - 1);
        
        if(p.first.size() == 1)
        {
            int first_val = (P0 - 1) - p.second;
            transaction(first_val - 1);
            transaction(first_val - 1);
        }
        else
        {
            int total_sum = (P0 - 1) - p.second;
            transaction(total_sum / 2);
        }
    
    
    }
    else
    {
        
        for(int i = 0 ; i < N ; ++i)
        {
            while(counter[i] < i)
            {
                transaction(N - 1);
                counter[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