Submission #1255502

#TimeUsernameProblemLanguageResultExecution timeMemory
1255502AvianshSouvenirs (IOI25_souvenirs)C++20
25 / 100
12 ms412 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int n, long long P0) { //pair<vector<int>, long long> res = transaction(3); if(n==2){ transaction(P0-1); return; } else if(n==3){ pair<vector<int>,long long>res = transaction(P0-1); if(res.first.size()==1){ long long req = P0-1-res.second-1; transaction(req); transaction(req); } else{ long long req = (P0-1-res.second)/2; transaction(req); } return; } else{ //cas 2 for(int i = 1;i<n;i++){ for(int j = 0;j<i;j++){ transaction(n-i); } } 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...