# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605847 | polya | Stations (IOI20_stations) | C++14 | 891 ms | 516 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <vector>
using namespace std;
vector<int> adj[1004];
vector<int> labels;
bool vis[1004];
int cnt = 0;
void dfs(int n) {
if (vis[n]) return;
labels[n] = cnt++, vis[n] = true;
for (auto &i : adj[n]) dfs(i);
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.resize(n);
for (int i=0; i<u.size(); i++) {
adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
}
for (int i=0; i<n; i++) {
if (adj[i].size() == 1) dfs(i);
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (s < t) return s+1;
else return s-1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |