Submission #1316759

#TimeUsernameProblemLanguageResultExecution timeMemory
1316759ezzzaySouvenirs (IOI25_souvenirs)C++20
7 / 100
12 ms400 KiB
#include "souvenirs.h" #include <utility> #include <vector> #include<bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second #define pb push_back void buy_souvenirs(int N, long long P0) { vector<ll>prices; prices.pb(P0); int cnt=0; for(int i=1;i<N;i++){ std::pair<std::vector<int>, long long> p = transaction(P0-1); if(p.ff.size()==2){ // suuliin neg chn dahin dahin avagdd bga cnt++; prices.pb(P0-2); P0-=2; break; } else if(p.ss==0){ P0--; } else{ P0-=2; } prices.pb(P0); } for(int i=2;i<N;i++){ for(int j=1;j<i- (i==N-1)*cnt;j++){ std::pair<std::vector<int>, long long> p = transaction(prices[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...