# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064724 | 2024-08-18T17:11:14 Z | Osplei | Stations (IOI20_stations) | C++17 | 588 ms | 684 KB |
#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 (t > s) return max(c[0], c[1]); else return min(c[0], c[1]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 383 ms | 684 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 299 ms | 684 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 351 ms | 684 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 588 ms | 684 KB | Output is correct |
2 | Incorrect | 413 ms | 684 KB | Wrong query response. |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 373 ms | 684 KB | Wrong query response. |
2 | Halted | 0 ms | 0 KB | - |