Submission #1283361

#TimeUsernameProblemLanguageResultExecution timeMemory
1283361LuvidiSouvenirs (IOI25_souvenirs)C++20
0 / 100
1 ms400 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include <bits/stdc++.h> using namespace std; #define ll long long #define fs first #define sc second void buy_souvenirs(int n, long long p0) { vector<int> vr; ll rr; int a[n]; memset(a,0,sizeof(a)); ll p[n]; p[0]=p0; pair<vector<int>,ll> rs; rs=transaction(p[0]-1); vr=rs.fs,rr=rs.sc; if(vr.size()==1){ transaction(p[0]-2-rr); transaction(p[0]-2-rr); }else{ transaction((p[0]-1)/2); } // for(int i=1;i<n;i++){ // for(;a[i]<i;){ // transaction(p[i]); // a[i]++; // } // } }
#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...