제출 #1302452

#제출 시각아이디문제언어결과실행 시간메모리
1302452aaaaaaaaSouvenirs (IOI25_souvenirs)C++20
22 / 100
1 ms336 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; void buy_souvenirs(int N, long long P0) { //pair<vector<int>, long long> res = transaction(P0 - 1); // N, N - 1, N - 2, N - 3, N - 4, .. 1 if(N == 2){ transaction(P0 - 1); return; } pair<vector<int>, long long> res = transaction(P0 - 1); if(res.first.size() == 1){ long long price = (P0 - 1) - res.second; transaction(price - 1); transaction(price - 1); }else{ long long both = (P0 - 1) - res.second; transaction(both / 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...