Submission #1328597

#	Time	Username	Problem	Language	Result	Execution time	Memory
1328597		zeta314	선물 (IOI25_souvenirs)	C++20	0 / 100	13 ms	344 KiB

souvenirs

#include <iostream>
#include <vector>
#include "souvenirs.h"

using namespace std;

void buy_souvenirs(int n, long long p0){
    vector<long long> p(n, -1), b(n, 0);
    p[0] = p0;
    
    vector<int> a;
    long long r;
    
    long long idx = 1, nxt = p[0] - 1;
    while(true){
        if(p[idx] == -1){
            tie(a, r) = transaction(nxt);
            for(int i = 0; i < a.size(); i++)
                b[a[i]]++;  
                
            if(a.size() == 1){
                p[idx] = (p[idx - 1] - 1 - r);
                continue;
            } else{
                while(b[idx] < idx){
                    tie(a, r) = transaction(nxt);
                    for(int i = 0; i < a.size(); i++)
                        b[a[i]]++;
                }
                
                nxt = (p[idx - 1] - 1 - r) / a.size();
            }
            
            idx++;
        } else{
            while(b[idx] < idx){
                tie(a, r) = transaction(p[idx]);
                b[idx]++;
            }
            
            idx++;
        }
    }
}

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