# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721674 | kas_s | Event Hopping (BOI22_events) | C++17 | 1577 ms | 366848 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>
#pragma GCC optimize("Ofast")
using namespace std;
int N;
vector<vector<int>> adj;
int bfs(int start, int end) {
vector<int> dist(N + 1);
queue<int> q;
q.push(start);
while (!q.empty()) {
int curr = q.front(); q.pop();
for (int &v: adj[curr]) {
if (dist[v]) continue;
dist[v] = dist[curr] + 1;
q.push(v);
}
}
return dist[end];
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int Q;
cin >> N >> Q;
adj.resize(N + 1);
vector<pair<int, int>> ranges(N);
set<int> unique;
# | 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... |