| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1009198 | bornag | Special graph (IZhO13_specialg) | C++14 | 1044 ms | 1880 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>
using namespace std;
const int maxn = 1e5;
int n, m;
int graph[maxn];
int dis[maxn];
int bfs(int s, int e){
for(int i = 0; i < n; i++)
dis[i] = -1;
queue<pair<int, int>> q;
q.push({s, 0});
while(!q.empty()){
int node = q.front().first;
int d = q.front().second;
q.pop();
if(dis[node] != -1) continue;
dis[node] = d;
if(graph[node] != -1 && dis[graph[node]] == -1) q.push({graph[node], d+1});
}
return dis[e];
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||