Submission #1250390

#TimeUsernameProblemLanguageResultExecution timeMemory
1250390enerelt14Souvenirs (IOI25_souvenirs)C++20
18 / 100
0 ms412 KiB
#include "souvenirs.h"
#include <utility>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;

void buy_souvenirs(int N, long long P0) {
    pair<vector<int>, long long> res = transaction(P0 - 1);
    if(res.first.size() == 2) {
        long long sum = P0 - 1 - res.second;
        transaction(sum / 2);
        return;
    }
    long long P1 = P0 - 1 - res.second;
    transaction(P1 - 1);
    transaction(P1 - 1);
    return;
}
#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...