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;
template<typename T>
using V = vector<T>;
using vi = V<int>;
using pi = pair<int,int>;
#define f first
#define s second
#define F0R(i, n) for(int i = 0; i < n;i++)
#define FOR(i,a, n) for(int i = a; i < n;i++)
#define pb push_back
#define all(x) begin(x), end(x)
#define each(x, y) for(auto &x : y)
constexpr int INF = 1e9 + 2;
pi binarySearch(V<pi> &stack, int point) {
auto it = std::upper_bound(stack.begin(), stack.end(), make_pair(point,INF)); // Point to before or at point
if (it == stack.begin()) return {0,0};
it--;
return {it - stack.begin() + 1, it->s};
}
int getImp(V<pi> &stack) {
return (stack.empty() ? 0 : stack.back().s);
}
#define ckmax(a,b) a = max(a,b)
int main() {
int n, q; cin >> n >> q;
V<pi> edges;
F0R(i, n) {
int a, b; cin >> a >> b;
edges.pb({a,b});
}
F0R(i, q) {
int a, b; cin >> a >> b;
a--;
b--;
int point = edges[a].s;
int ans = 0;
while (point < edges[b].f) {
int bestNext = point;
ans++;
F0R(j, n) {
if (edges[j].f <= point && edges[j].s <= edges[b].s) ckmax(bestNext, edges[j].s);
}
if (bestNext == point) break;
point = bestNext;
}
if (a == b) {
cout << "0\n";
continue;
}
if (point < edges[b].f || point > edges[b].s) {
cout << "impossible\n";
continue;
}
cout << ans + 1 << "\n";
}
return 0;
}
# | 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... |