Submission #1252236

#TimeUsernameProblemLanguageResultExecution timeMemory
1252236ginkgobilobaSouvenirs (IOI25_souvenirs)C++20
4 / 100
0 ms412 KiB
#include <iostream>
#include <vector>
#include <utility>
using namespace std;

std::pair<std::vector<int>, long long> transaction(long long M);

void solve_2(int N, long long P0) {
    transaction(P0 - 1);
    
}

void buy_souvenirs(int N, long long P0) {
    if (N != 2) {
        return;
    }
    solve_2(N, P0);
}
#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...