Submission #1250198

#TimeUsernameProblemLanguageResultExecution timeMemory
1250198omar1312Souvenirs (IOI25_souvenirs)C++20
0 / 100
6 ms420 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <bits/stdc++.h> using namespace std; #define ll long long const int mod = 1000000007, N = 200005; int p[N+2]; void buy_souvenirs(int n, long long p0) { int ask = p0 - 1; for(int i = 1; i < n; i++){ for(int j = 0; j < i - p[i]; j++){ pair<vector<int>, long long> res = transaction(ask); for(auto &k : res.first){ p[k]++; } ask = ask - res.second; } ask--; } } // int main(){ // cin.tie(0)->sync_with_stdio(0); // }
#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...