| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1319332 | Trisanu_Das | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 0 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
bool is_full_suffix(const vector<int>& L, int N) {
if (L.empty()) return false;
for (int i = 0; i < (int)L.size(); i++) {
if (L[i] != L[0] + i) return false;
}
return L.back() == N - 1;
}
void buy_souvenirs(int N, long long P0) {
vector<long long> suffix_sum(N, -1);
vector<bool> known(N, false);
int known_cnt = 0;
// 1) Literal scanning over M
for (long long M = 1; M < P0 && known_cnt < N - 1; M++) {
long long R;
vector<int> L = transaction(M, R);
if (L.empty()) continue;
if (!is_full_suffix(L, N)) continue;
int k = L[0];
if (k == 0) continue;
if (!known[k]) {
suffix_sum[k] = M - R;
known[k] = true;
known_cnt++;
}
}
// 2) Recover prices
vector<long long> P(N);
P[0] = P0;
for (int i = N - 1; i >= 1; i--) {
if (i == N - 1) {
P[i] = suffix_sum[i];
} else {
P[i] = suffix_sum[i] - suffix_sum[i + 1];
}
}
// 3) Buy souvenirs
for (int i = 1; i < N; i++) {
for (int cnt = 0; cnt < i; cnt++) {
long long R;
transaction(P[i], R);
}
}
}
