# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463793 | AlexLuchianov | 007 (CEOI14_007) | C++14 | 376 ms | 24972 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 <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using ll = long long;
int const nmax = 200000;
std::vector<int> bfs(int n, int node, std::vector<std::vector<int>> &g) {
std::vector<int> dist(n, -1);
std::queue<int> q;
q.push(node);
dist[node] = 0;
while(0 < q.size()) {
node = q.front();
q.pop();
for(int h = 0; h < g[node].size(); h++) {
int to = g[node][h];
if(dist[to] == -1) {
dist[to] = dist[node] + 1;
q.push(to);
}
}
}
return dist;
}
int main() {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |