Submission #1242601

#TimeUsernameProblemLanguageResultExecution timeMemory
1242601haithamcoderSplit the Attractions (IOI19_split)C++20
Compilation error
0 ms0 KiB
#include <cstdio> #include <cassert> #include "split.h" #include<bits/stdc++.h> using namespace std; #define ll int vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { // vector<ll> res; vector<vector<ll>> adj(n); ll m = p.size(); for (ll i = 0; i < m; i++) { adj[p[i]].push_back(q[i]); adj[q[i]].push_back(p[i]); } ll root = 0; for (ll i = 0; i < n; i++) { if (adj[i].size() == 1) { root = i; break; } } ll par = -1, u = root; vector<ll> res; ll num = 1; ll cnt = 0; while (num < 4) { res[u] = num; cnt++; for (auto c : adj[u]) { if (c != par) { par = u; u = c; } } if ((num == 1 && cnt > a) || (num == 2 && cnt > b) || (num == 3 && cnt > c)) { num++; cnt = 0; } if (num == 4) 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/ccMeBA87.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccoWUOQS.o:split.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status