이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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 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... |