| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1355562 | ramzialoulou | Event Hopping (BOI22_events) | C++20 | 20 ms | 2244 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 5009;
int dist[N][N];
vector<int> g[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> s(n), e(n);
for (int i = 0; i < n; i++) {
cin >> s[i] >> e[i];
}
while (q--) {
int x, y;
cin >> x >> y;
--x, --y;
if (s[y] <= e[x] && e[x] <= e[y]) {
cout << (x != y) << '\n';
} else {
cout << "impossible" << '\n';
}
}
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
