제출 #1319329

#제출 시각아이디문제언어결과실행 시간메모리
1319329Trisanu_Das선물 (IOI25_souvenirs)C++20
컴파일 에러
0 ms0 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; int N; long long P0; 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; } // Provided by the judge vector<int> transaction(long long M, long long &R); int main() { cin >> N >> P0; vector<long long> suffix_sum(N, -1); suffix_sum[0] = -1; // unused vector<bool> known(N, false); int known_cnt = 0; // 1) Literal scanning 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; // we don't need suffix starting at 0 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); } } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

/usr/bin/ld: /tmp/ccW0TFDz.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccgcrJVf.o:souvenirs.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccgcrJVf.o: in function `main':
souvenirs.cpp:(.text.startup+0x120): undefined reference to `transaction(long long, long long&)'
/usr/bin/ld: souvenirs.cpp:(.text.startup+0x28b): undefined reference to `transaction(long long, long long&)'
/usr/bin/ld: /tmp/ccW0TFDz.o: in function `main':
stub.cpp:(.text.startup+0x99): undefined reference to `buy_souvenirs(int, long long)'
collect2: error: ld returned 1 exit status