제출 #1249868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1249868		canadavid1	Souvenirs (IOI25_souvenirs)	C++20	0 / 100	0 ms	400 KiB

souvenirs

#include "souvenirs.h"
/*
    have to query > P0-N for first
    

    N=3:
        query p-1
            only 1:
                know price, ans that-1 twice
            both:
                know sum, ans half (round down)
*/

void buy_souvenirs(int N, long long P0) {
    std::vector<long long> P(N,-1);
    std::vector<int> ct(N,0);

    P[0] = P0;
    // auto test = [&](long long M){
    //     auto[o,r] = transaction(M);
    //     for(auto i : o) ct[i]++;
    //     return std::pair{o,r};
    // };
    auto[o,r] = transaction(P0-1);
    if (o.size() == 1) {
        int P1 = P0-1-r;
        transaction(P1-1);
        transaction(P1-1);
    }
    else {
        int P12 = P0-1-r;
        transaction(P12/2);
    }
    
}

• 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