제출 #1250269

#제출 시각아이디문제언어결과실행 시간메모리
1250269guymmk선물 (IOI25_souvenirs)C++20
7 / 100
12 ms412 KiB
#include <bits/stdc++.h> #include "souvenirs.h" using namespace std; void buy_souvenirs(int n, long long p0){ long long cur=p0-1; long long a[n+5]={}; for(int i=1;i<n;i++){ int g=1; while(1){ if(a[i]<i){ pair<vector<int>,long long> d=transaction(cur); for(auto k:d.first)a[k]++; if(d.second==1||d.first.size()!=1){ g=2; } }else break; }cur-=g; } }
#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...