Submission #434220

#TimeUsernameProblemLanguageResultExecution timeMemory
434220KanaifuStations (IOI20_stations)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include "stations.h" #include "stub.cpp" using namespace std; #define pb push_back vector<vector<int>> adj; vector <int> in; vector <int> out; int cnt = -1; void dfs (int node, int last) { cnt++; in[node] = cnt; for (int next : adj[node]) { if (next==last) { continue; } dfs(next, node); } out[node] = cnt; } bool check(int lab1, int lab2) { int cur_in = lab1/1000; int cur_out = lab1%1000; int des_in = lab2/1000; int des_out = lab2%1000; if (cur_in < des_in and des_in <= cur_out) { return true; } else { return false; } } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { in.resize(n+1); out.resize(n+1); adj.resize(n+1); vector <int> labels; for (int i = 0; i < n-1; i++) { adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]); } dfs(0, -1); for (int i=0; i<n; i++) { labels.pb(in[i]*1000 + out[i]); } return labels; } int find_next_station(int s, int t, std::vector<int> c) { if (check(s, t)) { for (int child : c) { if (child==t) { return child; } if (check(child, s)) { continue; } if (check(child, t)) { return child; } } } else { for (int child : c) { if (child==t) { return child; } if (check(child, s)) { return child; } } } return c[0]; } /* 1 5 10000000 0 1 1 2 1 3 2 4 2 2 0 1 1 3 3 */

Compilation message (stderr)

stations.cpp: In function 'bool check(int, int)':
stations.cpp:33:9: warning: unused variable 'des_out' [-Wunused-variable]
   33 |     int des_out = lab2%1000;
      |         ^~~~~~~
/usr/bin/ld: /tmp/ccoaXItP.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccvqchqR.o:stations.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status