제출 #721731

#제출 시각아이디문제언어결과실행 시간메모리
721731Mr_HusanboyEvent Hopping (BOI22_events)C++17
0 / 100
107 ms11548 KiB
#include<bits/stdc++.h> using namespace std; #define all(a) (a).begin(), (a).end() template<typename T> int len(T &a){ return a.size(); } using ll = long long; #define ff first #define ss second void solve(){ int n, q; cin >> n >> q; vector<pair<int,int>> e(n); map<int,int> mp; for(int i = 0; i < n; i ++){ cin >> e[i].ff >> e[i].ss; mp[e[i].ff] = 1; mp[e[i].ss] = 1; } map<int,int> id; for(auto [a,b] : mp){ id[a] = len(id); } while(q --){ int a, b; cin >> a >> b; a --; b --; if(e[a].ss < e[b].ff || e[a].ss > e[b].ss){ cout << "impossible"; }else cout << 1; if(q)cout << '\n'; } } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int testcases = 1; //cin >> testcases; while(testcases --){ solve(); if(testcases) cout << '\n'; #ifdef LOCAL else cout << '\n'; cout << "__________________" << endl; #endif } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...