Submission #1051811

#TimeUsernameProblemLanguageResultExecution timeMemory
1051811TobSplit the Attractions (IOI19_split)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include "split.h" #define F first #define S second using namespace std; typedef long long ll; const int N = 1e5 + 7; int n; int siz[N]; bool bio[N]; vector <int> no; vector <int> adj[N]; void ldfs(int x) { bio[x] = 1; no.push_back(x); for (auto y : adj[x]) { if (bio[y]) continue; ldfs(y); } } vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { n = a+b+c; vector <int> res(n, 0); for (int i = 0; i < n-1; i++) { adj[p[i]].push_back(q[i]); adj[q[i]].push_back(p[i]); } int mxdeg = 0; for (int i = 0; i < n; i++) mxdeg = max(mxdeg, (int)adj[i].size()); if (mxdeg <= 2) { ldfs(0); for (int i = a; i < a+b; i++) res[no[i]] = 1; for (int i = a+b; i < n; i++) res[no[i]] = 2; return res; } if (a == 1) { ldfs(0); for (int i = 0; i < b; i++) res[no[i]] = 1; for (int i = b; i < n-1; i++) res[no[i]] = 2; 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; }

Compilation message (stderr)

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