제출 #1042634

#제출 시각아이디문제언어결과실행 시간메모리
1042634stdfloat자매 도시 (APIO20_swap)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "swap.h" #include "grader.cpp" using namespace std; using ll = long long; #define ff first #define ss second #define pii pair<int, int> int n; vector<vector<pii>> E; void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) { n = N; E.assign(n, {}); for (int i = 0; i < M; i++) { E[U[i]].push_back({V[i], W[i]}); E[V[i]].push_back({U[i], W[i]}); } } int getMinimumFuelCapacity(int X, int Y) { int l = 0, r = (int)1e9 + 1; while (l < r) { int md = (l + r) >> 1; bool tr = false; queue<int> q; vector<bool> visX(n); q.push(X); visX[X] = true; while (!q.empty()) { int x = q.front(); q.pop(); for (auto [i, w] : E[x]) { if (w <= md && !visX[i]) { q.push(i); visX[i] = true; } } } if (!visX[Y]) { l = md + 1; continue; } vector<bool> visY(n); queue<pii> q1; q1.push({Y, -1}); visY[Y] = true; while (!q1.empty() && !tr) { auto [x, p] = q1.front(); q1.pop(); for (auto [i, w] : E[x]) { if (w > md || i == p) continue; if (visY[i]) { if (i == Y || visX[i]) { tr = true; break; } } else { visY[i] = true; q1.push({i, x}); } } } for (int i = 0; i < n && !tr; i++) { if (!visX[i] || !visY[i]) continue; int cnt = 0; for (auto [j, w] : E[i]) { cnt += (w <= md); } tr = (cnt > 2); } if (!tr) l = md + 1; else r = md; } return (l == (int)1e9 + 1 ? -1 : l); }

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

/usr/bin/ld: /tmp/ccJksmJl.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccoUpHxm.o:swap.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status