제출 #1258102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258102		chr34	선물 (IOI25_souvenirs)	C++20	0 / 100	0 ms	412 KiB

souvenirs

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

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

void buy_souvenirs(int N, long long P0) {
    vector<long long> P(N);
    P[0] = P0;

    for (int i = 1; i < N; i++) {
        long long lo = 1, hi = P[i-1] - 1, found = -1;
        while (lo <= hi) {
            long long mid = (lo + hi) / 2;
            auto res = transaction(mid);
            if (res.first.empty()) {
                lo = mid + 1;
            } else {
                int type = res.first[0];
                if (type == i) {
                    found = mid;
                    hi = mid - 1; 
                } else if (type < i) {
                    lo = mid + 1;
                } else {
                    hi = mid - 1;
                }
            }
        }
        P[i] = found;
    }

    for (int i = 1; i < N; i++) {
        for (int k = 0; k < i; k++) {
            transaction(P[i]);
        }
    }
}

• 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