| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1321054 | sadix | 선물 (IOI25_souvenirs) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
pair<vector<int>, long long> transaction(long long M);
void buy_souvenirs(int N, long long P0) {
std::vector<int32_t> bought(N, 0);
int32_t balance = 0u;
for(int32_t typeIdx = 1; typeIdx < N; typeIdx++) {
while(std::find_if(bought.begin(), bought.end(), [typeIdx] (int32_t num ){
return num && num != typeIdx;
}) != bought.end()) {
auto transactionResult = transaction(balance);
const auto& souvenirs = transactionResult.first;
balance = transactionResult.second;
if(souvenirs.empty()) {
balance += M;
continue;
}
for(uint32_t i = 0; i < souvenirs.size(); i++) {
bought[souvenirs[i]]++;
}
}
}
return;
}