Submission #604347

#TimeUsernameProblemLanguageResultExecution timeMemory
604347PlurmEvent Hopping (BOI22_events)C++11
0 / 100
1584 ms101828 KiB
#include <bits/stdc++.h> using namespace std; vector<int> g[100005]; int dist[5005][5005]; int main() { memset(dist, 0x3F, sizeof(dist)); int n, q; scanf("%d%d", &n, &q); vector<pair<int, int>> events; int k = sqrt(n); 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) { tmp.push_back(j); } } sort(tmp.begin(), tmp.end(), [&events](int i, int j) { return events[i].second > events[j].second; }); for (int j = 0; j < min((int)tmp.size(), k); j++) { g[i].push_back(tmp[j]); } } 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 : g[u]) { if (dist[i][v] > dist[i][u] + 1) { 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] > 1e9) 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)

events.cpp: In function 'int main()':
events.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d", &n, &q);
      |   ~~~~~^~~~~~~~~~~~~~~~
events.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~
events.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     scanf("%d%d", &s, &e);
      |     ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...