# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857680 | vgtcross | Event Hopping (BOI22_events) | C++17 | 1588 ms | 3156 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;
using ll = long long;
using pii = pair<int, int>;
void solve() {
int n, q;
cin >> n >> q;
vector<pii> v(n);
for (pii &p : v) cin >> p.first >> p.second;
while (q--) {
int a, b;
cin >> a >> b;
--a;--b;
queue<pii> bfs;
bfs.push({a, 0});
int ans = -1;
vector<bool> vis(n, 0);
vis[a] = 1;
while (bfs.size()) {
pii p = bfs.front();
bfs.pop();
if (p.first == b) {
ans = p.second;
break;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |