Submission #1250541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250541		amongus_pvp	선물 (IOI25_souvenirs)	C++20	0 / 100	12 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;

void buy_souvenirs(int N, long long P0) {
    // N == 2 in this subtask
    // We know P[0] = P0, need to find P[1]
    // Condition: P[0] > M >= P[1]

    // Try smallest possible M = 1, increment until we find P[1]
    long long P1 = -1;
    for (long long m = 1; m < P0; m++) {
        auto [souvs, change] = transaction(m);
        if (!souvs.empty() && souvs[0] == 1) {
            // If we can buy type 1 with m coins, then P[1] <= m
            P1 = m;
            break;
        }
    }
}

• 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