제출 #1251676

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

souvenirs

#include "souvenirs.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

template<typename T>
bool assign_min(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool assign_max(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int n;
vector<bool> seen;
vector<int> p, cnt;

void dfs(vector<int> &v, ll s) {
    for (auto x : v) cnt[x]++;
    if (v.size() == 1) {
        p[v[0]] = s;
        if (seen[v[0]] || v[0] == n - 1) {
            return;
        }
        seen[v[0]] = 1;
        p[v[0]] = s;
        pair<vector<int>, ll> t = transaction(s - 1);
        dfs(t.first, s - 1 - t.second);
        return;
    }
    pair<vector<int>, ll> t = transaction(s / v.size());
    dfs(t.first, s / v.size() - t.second);
}

void buy_souvenirs(int nn, ll p0) {
    n = nn;
    seen.resize(n);
    cnt.resize(n);
    p.resize(n);
    p[0] = p0;
    pair<vector<int>, ll> t = transaction(p0 - 1);
    dfs(t.first, p0 - 1 - t.second);
    for (int i = 0; i < n; ++i) {
        while (cnt[i] < i) {
            transaction(p[i]);
            cnt[i]++;
        }
    }
}

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