Submission #1251381

#TimeUsernameProblemLanguageResultExecution timeMemory
1251381InternetPerson10선물 (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll counts[2001];
ll costs[2001];

void try_buy(int k, int n, ll p) {
}

pair<vector<int>, ll> make_transaction(ll P) {
    vector<int> v;
    ll x;
    tie(v, x) = transaction(P);
    for(int g : v) counts[g]++;
    return {v, x};
}

void buy_souvenirs(int N, long long P0) {
    for(int i = 0; i < N; i++) {
        costs[i] = -1;
    }
    costs[0] = P0;
    // pair<vector<int>, ll> res = transaction(3);
    auto p = make_transaction(P0-1);
    if(counts[2] == 0) {
        costs[1] = P0 - 1 - p.second;
        make_transaction(costs[1] - 1);
        make_transaction(costs[1] - 1);
    }
    else {
        make_transaction((P0-1-p.second)/2);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...