# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522144 | maks007 | Trampoline (info1cup20_trampoline) | C++14 | 2097 ms | 21656 KiB |
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;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
map <int,vector <int>> a;
int q;
cin >> q;
vector <pair <int,int>> temp;
while(q --) {
int x, y;
cin >> x >> y;
x --;
y --;
temp.push_back({x, y});
}
sort(temp.begin(), temp.end());
for(int i = 0; i < temp.size(); i ++) {
a[temp[i].first].push_back(temp[i].second);
}
cin >> q;
while(q --) {
int startx, starty, endx, endy;
cin >> startx >> starty >> endx >> endy;
startx --;
starty --;
endx --;
endy --;
while(startx != endx) {
auto it = lower_bound(a[startx].begin(), a[startx].end(), starty);
if(it == a[startx].end()) {
goto end;
}
startx ++;
starty = *it;
}
if(startx == endx and starty <= endy){
cout << "Yes\n";
}else cout << "No\n";
continue;
end:;
cout << "No\n";
}
return false;
}
Compilation message (stderr)
# | 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... |