Submission #1251379

#TimeUsernameProblemLanguageResultExecution timeMemory
1251379InternetPerson10Souvenirs (IOI25_souvenirs)C++20
21 / 100
13 ms424 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);
    for(int i = 1; i < N; i++) {
        auto p = make_transaction(costs[i-1]-1);
        if(p.first.size() == 1 && p.second == 0) {
            costs[i] = costs[i-1] - 1;
        }
        else {
            costs[i] = costs[i-1] - 2;
        }
        while(counts[i] != i) make_transaction(costs[i]);
    }
}
#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...