# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604333 | Plurm | Event Hopping (BOI22_events) | C++11 | 1596 ms | 99488 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;
int dist[5005][5005];
int main() {
memset(dist, 0x3F, sizeof(dist));
int n, q;
scanf("%d%d", &n, &q);
vector<pair<int, int>> events;
for (int i = 1; i <= n; i++) {
int s, e;
scanf("%d%d", &s, &e);
events.push_back({s, e});
}
queue<int> pq;
for (int i = 0; i < n; i++) {
dist[i][i] = 0;
pq.push(i);
while (!pq.empty()) {
int u = pq.front();
pq.pop();
for (int v = 0; v < n; v++) {
if (u == v)
continue;
if (events[v].first <= events[u].second &&
events[u].second <= events[v].second) {
if (dist[i][v] > n) {
dist[i][v] = dist[i][u] + 1;
pq.push(v);
}
}
}
}
}
for (int i = 0; i < q; i++) {
int s, e;
scanf("%d%d", &s, &e);
if (dist[s - 1][e - 1] > n)
printf("impossible\n");
else
printf("%d\n", dist[s - 1][e - 1]);
// can e be reached by s?, if yes, what is the shortest path?
}
return 0;
}
Compilation message (stderr)
# | 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... |