Submission #1277185

#TimeUsernameProblemLanguageResultExecution timeMemory
1277185stephitSouvenirs (IOI25_souvenirs)C++20
21 / 100
13 ms400 KiB
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int cnt[101];
ll p[101];

void buy_souvenirs(int n, long long p0) {
    p[0] = p0;
    for (int i = 1; i <= n - 1; i++) {
        auto [v, r] = transaction(p[i - 1] - 1);
        if (r == 1 || v.size() == 2) {
            if (v.size() == 2) cnt[n - 1]++;
            p[i] = p[i - 1] - 2;
        } else {
            p[i] = p[i - 1] - 1;
        }
        cnt[i]++;
    }

    for (int i = 1; i <= n - 1; i++) {
        for (int j = cnt[i] + 1; j <= i; j++) transaction(p[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...