# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064737 | Osplei | Stations (IOI20_stations) | C++17 | 622 ms | 948 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>
using namespace std;
#define pb push_back
vector <int> bfs (int n, int nodo, vector <int> grafo[1005]){
vector <int> aux(n);
bool visto[1005] = {false};
queue <int> q;
int pos = 0;
q.push(nodo);
while (!q.empty()){
int act = q.front();
q.pop();
if (visto[act] == true) continue;
visto[act] = true;
for (auto i : grafo[act]) q.push(i);
aux[act] = pos;
pos++;
}
return aux;
}
vector <int> label(int n, int k, vector <int> u, vector <int> v) {
vector <int> grafo[1005];
map <int, int> entra;
for (int i = 0; i < u.size(); i++) {
int a = u[i], b = v[i];
if (b < a) swap(a, b);
entra[b]++;
grafo[a].pb(b);
grafo[b].pb(a);
}
for (auto i : entra) {
vector <int> labels = bfs(n, i.first, grafo);
return labels;
}
}
int find_next_station(int s, int t, vector <int> c) {
if (c.size() == 1) return c[0];
if (t < s) return max(c[0], c[1]);
else return min(c[0], c[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... |