# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
612467 | Plurm | Event Hopping (BOI22_events) | C++11 | 1594 ms | 58408 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>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
vector<short> g[100005];
vector<short> rg[100005];
short dist[5005][5005];
short fastqueue[8 * 1048576];
int hidx = 0;
int tidx = 0;
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});
}
for (int i = 0; i < n; i++) {
vector<int> tmp;
for (int j = 0; j < n; j++) {
if (i == j)
continue;
if (events[j].first <= events[i].second &&
events[i].second <= events[j].second) {
rg[i].push_back((short)j);
}
}
}
for (int i = 0; i < n; i++) {
__gnu_pbds::gp_hash_table<int, short> mp;
for (short j : rg[i]) {
int hsh = 0;
for (short k : rg[j]) {
hsh *= 53;
hsh += k;
}
mp[hsh] = j;
}
for (auto p : mp) {
g[i].push_back(p.second);
}
}
for (int i = 0; i < n; i++) {
dist[i][i] = 0;
fastqueue[tidx++] = i;
while (hidx != tidx) {
short u = fastqueue[hidx++];
for (short v : g[u]) {
if (dist[i][v] > dist[i][u] + 1) {
dist[i][v] = dist[i][u] + 1;
fastqueue[tidx++] = 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("%hd\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... |