제출 #1252465

#제출 시각아이디문제언어결과실행 시간메모리
1252465ollelapSouvenirs (IOI25_souvenirs)C++20
4 / 100
0 ms412 KiB
#include "souvenirs.h" #include <utility> #include <vector> using namespace std; #include<bits/stdc++.h> typedef long long ll; #define rep(i,a,b) for(int i = a; i < b; i++) void buy_souvenirs(int N, long long P0) { if (N == 2) { pair<vector<int>, ll> res = transaction(P0-1); return; } if (N == 3) { pair<vector<int>, ll> res = transaction(P0-1); if (res.first.size() == 2) { res = transaction((P0-1)/2); } else { ll A = P0-1 - res.second; res = transaction(A-1); res = transaction(A-1); } } }
#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...