제출 #1256841

#제출 시각아이디문제언어결과실행 시간메모리
1256841rhm_ganSplit the Attractions (IOI19_split)C++20
컴파일 에러
0 ms0 KiB
#include "split.h" #include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; vector<int> g[N]; vector<int> res; bool vis[N]; int A, B, C; vector<int> path; void dfs(int u, int c) { int mx = N; if (c == 1) mx = A; if (c == 2) mx = B; if (c == 3) mx = C; if (path.size() == mx) { return; } vis[u] = true; path.push_back(u); for (auto v : g[u]) { if (!vis[v]) { dfs(v, c); } } } vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { pair<int, int> aa = {a, 1}; pair<int, int> bb = {b, 2}; pair<int, int> cc = {c, 3}; if (aa > cc) swap(aa, cc); if (aa > bb) swap(aa, bb); if (bb > cc) swap(bb, cc); A = aa.first, B = bb.first, C = cc.first; int color_a = aa.second, color_b = bb.second, color_c = cc.second; // cout << color_a << ' ' << color_b << ' ' << color_c << '\n'; int m = p.size(); res.resize(n, 0); for (int i = 0; i < m; i++) { g[p[i]].push_back(q[i]); g[q[i]].push_back(p[i]); } int u = 0; for (int i = 0; i < n; i++) { if (g[i].size() == 1) { u = i; break; } } dfs(u, color_a); for (int i = 0; i < n; i++) { if (!vis[i]) { for (auto u : path) { res[u] = color_a; } path.clear(); dfs(i, color_b); if (path.size() == b) { for (auto u : path) { res[u] = color_b; } for (int i = 0; i < n; i++) { if (res[i] == 0) { res[i] = color_c; } } return res; } } } return res; } int main() { int n, m, a, b, c; assert(5 == scanf("%d%d%d%d%d", &n, &m, &a, &b, &c)); vector<int> p(m), q(m); for (int i=0; i<m; i++) assert(2 == scanf("%d%d", &p[i], &q[i])); // fclose(stdin); vector<int> result = find_split(n, a, b, c, p, q); for (int i=0; i<(int)result.size(); i++) printf("%s%d", ((i>0)?" ":""), result[i]); printf("\n"); // fclose(stdout); return 0; }

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

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