# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541582 | Vladth11 | Stations (IOI20_stations) | C++14 | 3034 ms | 2097152 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 <bits/stdc++.h>
#include "stations.h"
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <long double, pii> muchie;
const ll NMAX = 1001;
const ll VMAX = 1000001;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 1000000;
const ll nr_of_bits = 16;
vector <int> sol;
vector <int> g[NMAX];
int stamp;
void DFS(int node, int p){
for(auto x : g[node]){
if(x == p)
continue;
DFS(x, node);
}
sol[node] = stamp++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
sol.resize(n);
for (int i = 0; i < n - 1; i++) {
int a = u[i];
int b = v[i];
g[a].push_back(b);
g[b].push_back(a);
}
DFS(0, -1);
return sol;
}
int find_next_station(int s, int t, vector<int> c) {
sort(c.begin(), c.end());
for(int i = 0; i < c.size() - 1; i++){
if(t <= c[i]){
return c[i];
}
}
return c.back();
}
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... |