# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853479 | nnin | Stations (IOI20_stations) | C++14 | 637 ms | 1512 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>
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[1005], tmp;
int times;
void dfs(int u, int p, int ct) {
tmp[u] = ct;
for(int n:adj[u]) {
if(n==p) continue;
dfs(n, u, ct+times);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
tmp.clear();
tmp.resize(n);
for(int i=0;i<n;i++) adj[i].clear();
for(int i=0;i<n-1;i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int root = 0;
for(int i=0;i<n;i++) {
if(adj[i].size()>2) {
root = i;
break;
}
}
tmp[root] = 0;
times = adj[root].size();
for(int i=0;i<adj[root].size();i++) {
dfs(adj[root][i], root, i+1);
}
for(int i=0;i<n;i++) labels[i] = tmp[i];
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s==0) {
int ret = t%c.size();
if(ret==0) ret += c.size();
return ret;
}
if(c.size()==1) return c[0];
int num = c[1]-s;
if(s%num != t%num || t<s) {
return max(s-num, 0);
}
return s+num;
}
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... |