| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1352571 | vahagng | Event Hopping (BOI22_events) | C++20 | 107 ms | 2132 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 +10;
int n, q, s[N], e[N];
// long long dist[N][N];
vector<int> adj[N];
bool visited[N];
int comp[N], id[N];
int main() {
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> s[i] >> e[i];
}
while(q--){
int u, v;
cin >> u >> v;
if(s[v] <= e[u] && e[u] <= e[v]){
cout << (u != v) << endl;
}else{
cout << "impossible\n";
}
}
}| # | 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... | ||||
