# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1000447 | 2024-06-17T14:09:58 Z | anango | Event Hopping (BOI22_events) | C++17 | 707 ms | 524288 KB |
#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(); assert(k<4*n); 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)|| y<x) { cout << "impossible" << endl; } else { cout << answer+2 << endl; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 707 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 692 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 692 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 692 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 690 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 707 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |