제출 #1256499

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

souvenirs

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

#define lf "\n"
#define ff endl
#define _ << ' ' <<
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)

#define infos(str) do { fprintf(stderr, str"\n"); } while(0)
#define infor(str, ...) do { fprintf(stderr, str, __VA_ARGS__); } while(0)
#define infof(str, ...) do { fprintf(stderr, str"\n", __VA_ARGS__); } while(0)

#ifndef DEBUG

#undef infos
#undef infor
#undef infof

#define infos(str)
#define infor(str, ...)
#define infof(str, ...)

#endif

using ll = long long;

constexpr int LOG = 20;
constexpr int MOD = 1e9+7;
constexpr int MAXN = 1e5+7;

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

void buy_souvenirs(int N, long long P0) {
    vector<ll> p(N); p[0] = P0;
    for(int i = 1; i < N; ++i)
        p[i] = (p[i - 1] + 1) / 2;

    vector<int> cnt(N);
    for(int i = 1; i < N; ++i) {
        ll mx = p[i - 1] - 1;

        while(cnt[i] < i) {
            auto [q, r] = transaction(mx);

            if(q.size() == 1 && p[i] != mx - r) {
                p[i] = mx - r;
                for(int j = i + 1; j < N; ++j)
                    p[j] = (p[j - 1] + 1) / 2;
            }

            for(auto x: q)
                cnt[x]++, mx -= p[x];
            mx += p[i] - r;
        }
    }
}

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