# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887978 | qrno | Event Hopping (BOI22_events) | C++17 | 1593 ms | 55072 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;
#define int long long
vector<int> bfs(int source, vector<vector<int>> const& G) {
vector<int> dist(G.size(), -1);
queue<int> Q;
dist[source] = 0;
Q.push(source);
while (!Q.empty()) {
int v = Q.front(); Q.pop();
for (auto u : G[v]) {
if (dist[u] == -1) {
Q.push(u);
dist[u] = dist[v]+1;
}
}
}
return dist;
}
signed main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int N, Q;
cin >> N >> Q;
# | 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... |