# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123547 | Noam527 | 007 (CEOI14_007) | C++17 | 302 ms | 22268 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>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 1e18;
const int OO = 1;
const int OOO = 1;
using namespace std;
int n, m;
int st7, stn, a, b;
vector<vector<int>> g;
vector<int> d;
void bfs(int st) {
for (auto &i : d) i = -1;
d[st] = 0;
queue<int> q;
q.push(st);
while (q.size()) {
int x = q.front();
q.pop();
for (const auto &i : g[x])
if (d[i] == -1) {
d[i] = 1 + d[x];
q.push(i);
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |