제출 #1278411

#제출 시각아이디문제언어결과실행 시간메모리
1278411dang_minh_duc선물 (IOI25_souvenirs)C++20
3 / 100
13 ms400 KiB
#include <bits/stdc++.h> #include "souvenirs.h" using namespace std; void buy_souvenirs(int n, long long P0) { vector<int>cnt(n, 0), p(n, 0); p[0]=P0; for (int i=0;i<n-1;i++) { auto [l, u]=transaction(p[i]-1); if (l.size()==1) { p[i+1]=p[i]-1-u; } else p[i+1]=p[i]-2; for (int x:l) cnt[x]++; } for (int i=1;i<n;i++) { for (int j=cnt[i]+1;j<=i;j++) transaction(p[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...