제출 #1274523

#제출 시각아이디문제언어결과실행 시간메모리
1274523linhhnt11072010Souvenirs (IOI25_souvenirs)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll pp[105]; pair<vector<int>, ll> transaction(ll m); void buy_souvenirs(int n, ll p0){ pair<vector<int>, ll> pr = transaction(p0-1); ll nx = p0-1; if(pr.first.size()>1){ nx-=pr.second; transaction(nx/2); } else{ nx-=pr.second; transaction(nx-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...