Submission #1072873

#TimeUsernameProblemLanguageResultExecution timeMemory
1072873IgnutStations (IOI20_stations)C++17
0 / 100
582 ms800 KiB
// Ignut #include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1111; vector<int> tree[N]; vector<int> euler; int root; void dfs(int v, int par) { euler.push_back(v); for (int to : tree[v]) { if (to != par) { dfs(to, v); if (v == root) euler.push_back(v); } } } vector<int> label(int n, int k, vector<int> u, vector<int> v) { euler.clear(); for (int i = 0; i < n; i ++) { tree[i].clear(); } for (int i = 0; i < n - 1; i ++) { tree[u[i]].push_back(v[i]); tree[v[i]].push_back(u[i]); } root = 0; for (int i = 0; i < n; i ++) if (tree[i].size() > 2) root = i; dfs(root, -1); vector<int> lbl(n); lbl[root] = 0; int number = 1; for (int v : euler) { if (v == root) { number = (number / 1000 + 1) * 1000; number ++; continue; } lbl[v] = number ++; } return lbl; } int find_next_station(int s, int t, vector<int> c) { if (c.size() > 2) { for (int v : c) { if (v / 1000 == t / 1000) return v; } t /= 0; return t; } if (c.size() == 1) return c[0]; int mn = min(c[0], c[1]); int mx = max(c[0], c[1]); if (mx / 1000 == s / 1000) return mn; return mx; }

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:65:11: warning: division by zero [-Wdiv-by-zero]
   65 |         t /= 0;
      |         ~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...