제출 #1256257

#제출 시각아이디문제언어결과실행 시간메모리
1256257bynix선물 (IOI25_souvenirs)C++20
21 / 100
12 ms412 KiB
#include "souvenirs.h" #include "bits/stdc++.h" void buy_souvenirs(int N, long long P0) { long long prev = P0, o = 0; for (long long i = 1; i < N-1; i++){ auto [l, r] = transaction(prev - 1); prev -= r + 1; if (l.size() != 1){ o++; prev--; } for (long long j = 0; j < i-1; j++) transaction(prev); } for (long long j = 0; j < N-1-o; j++) transaction(prev-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...