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>
#define int long long
using namespace std;
signed main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
/*#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif*/ //fast IO
//for each time t, compute latest[t] = latest time you can get to with at most 1 switch starting at t
//then binary lifting
int n,q;
cin >> n >> q;
vector<pair<int,int>> events;
vector<vector<int>> sweep;
vector<int> coords;
map<int,int> revcoords;
for (int i=0; i<n; i++) {
int st,en;
cin >> st >> en;
events.push_back({st,en});
coords.push_back(st);
coords.push_back(en);
}
sort(coords.begin(), coords.end());
coords.erase(unique(coords.begin(), coords.end()),coords.end());
int k = coords.size();
for (int i=0; i<k; i++) {
revcoords[coords[i]] = i;
}
for (int i=0; i<events.size(); i++) {
int st,en;
st=events[i].first;
en=events[i].second;
sweep.push_back({revcoords[st],-1,i});
sweep.push_back({revcoords[en],1,i});
events[i] = {revcoords[st],revcoords[en]};
}
sort(sweep.begin(), sweep.end());
set<int> indices;
multiset<int> endings;
vector<int> latest(k,-1);
for (auto ev:sweep) {
int a,b,ind;
a=ev[0];
b=ev[1];
ind=ev[2];
if (b==-1) {
indices.insert(ind);
endings.insert(events[ind].second);
}
else {
indices.erase(ind);
endings.erase(endings.find(events[ind].second));
}
if (endings.size()) {
latest[a] = *endings.rbegin();
}
else {
latest[a] = a;
}
}
int maxlift=20;
vector<vector<int>> lift(k,vector<int>(maxlift+1,-1));
for (int i=0; i<k; i++) {
lift[i][0] = latest[i];
//cout << i <<" " << latest[i] << endl;
}
for (int p=0; p<maxlift; p++) {
for (int i=0; i<k; i++) {
lift[i][p+1] = lift[lift[i][p]][p];
//cout << i <<" " << p+1 <<" " << lift[i][p+1] << endl;
}
}
for (int i=0; i<q; i++) {
int x,y;
cin >> x >> y;
x--;
y--;
int answer = 0;
int start = events[x].second;
int endstart = events[y].first;
int end = events[y].second;
if (x==y) {
cout << 0 << endl;
continue;
}
if (endstart <= start && start<=end) {
cout << 1 << endl;
continue;
}
int cur = start;
for (int p=maxlift; p>=0; p--) {
int ncur = lift[cur][p];
//cout << p <<" " << cur <<" " << ncur << endl;
if (ncur<endstart) {
cur=ncur;
answer+=1LL<<p;
}
}
cur=lift[cur][0];
//cout << "DOING " << start << " " << end << " " << cur << endl;
if (!(endstart<=cur && cur<=end)) {
cout << "impossible" << endl;
}
else {
cout << answer+2 << endl;
}
}
}
Compilation message (stderr)
events.cpp: In function 'int main()':
events.cpp:40:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
40 | for (int i=0; i<events.size(); i++) {
| ~^~~~~~~~~~~~~~
events.cpp:9:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
9 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
events.cpp:11:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# | 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... |