# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591787 | APROHACK | Stations (IOI20_stations) | C++14 | 804 ms | 532 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 <bits/stdc++.h>
#include <vector>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
const int N = 1005;
vector<int>adj[N];
bool vis[N];
int cur = 0;
int labeled[N];
void dfs(int node){
vis[node]=true;
labeled[node]=cur;
cur++;
for(int i = 0 ;i < adj[node].size() ; i++){
if(!vis[adj[node][i]])dfs(adj[node][i]);
}
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> labels(n);
for(int i = 0 ; i < n-1 ; i ++){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[i]);
}
dfs(0);
for(int i = 0 ; i < n ; i ++){
labels[i]=labeled[i];
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(t<s)return c[0];
else{
int lastmenor=0;
for(int i = 0 ; i < c.size() ; i++){
if(c[i]<=t)lastmenor=i;
}
return c[lastmenor];
}
}
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... |