# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099388 | mihaihvh | Circle Passing (EGOI24_circlepassing) | C++14 | 2078 ms | 95572 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 <set>
#include <queue>
#include <vector>
using namespace std;
vector<set<int>> v(1000000);
int n, m, q;
int M;
void bf(int k, int l) {
//int viz[20001]{0};
vector<int> viz(2*n);
queue<int> q;
viz[k] = 1;
q.push(k);
bool E = 1;
while (!q.empty() && E) {
for (auto m : v[q.front()]) {
if (!viz[m]) {
q.push(m);
viz[m] = viz[q.front()] + 1;
if (m == l)
E = 0;
}
}
q.pop();
}
# | 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... |