Submission #1250846

#TimeUsernameProblemLanguageResultExecution timeMemory
1250846JoksimKaktusSouvenirs (IOI25_souvenirs)C++20
4 / 100
12 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long p) { long long bet = p-1; vector<long long> bought(N*100); for(int i = N-1;i >= 1;i--){ while(bought[N-i] < N-i){ pair<vector<int>,long long> k = transaction(bet); for(int ind : k.first){ bought[ind]++; } } bet /=2; } 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...