#include <bits/stdc++.h>
using namespace std;
#define ld long double
// #define int long long
#define endl "\n"
const int N = 3e5,K = 20;
int r,c,n,q,lg[N + 1];
map<int,vector<int>> green;
vector<vector<int>> idx;
vector<int> row;
vector<int> sparse[N + 1][K + 1];
int query(int r1,int c1,int r2) {
r1--;
r2--;
int len = r2 - r1;
if(r1 == r2) {
auto it = lower_bound(idx[r1].begin(),idx[r1].end(),c1);
return (*it);
}
auto it = lower_bound(idx[r1].begin(),idx[r1].end(),c1);
if(it == idx[r1].end()) return INT_MAX;
int pp = it - idx[r1].begin();
int res = c1;
for(int j = K;j >= 0;j--) {
int tmp = (len >> j) % 2;
if(tmp == 0) continue;
int nxt = sparse[r1][j][pp];
// cout<<j<<" "<<nxt<<" "<<r1<<" "<<pp<<endl;
r1 += (1<<j);
res = max(res,nxt);
it = lower_bound(idx[r1].begin(),idx[r1].end(),nxt);
if(it == idx[r1 + (1<<j)].end()) {
return INT_MAX;
}
pp = it - idx[r1].begin();
}
return res;
}
map<int,int> uy;
signed main() {
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
cin>>r>>c>>n;
for(int i = 2;i <= N;i++) {
lg[i] = lg[i/2] + 1;
}
for(int i = 0;i < n;i++) {
int x,y;
cin>>x>>y;
green[x].push_back(y);
}
for(auto u : green) {
u.second.push_back(INT_MAX);
sort(u.second.begin(),u.second.end());
idx.push_back(u.second);
row.push_back(u.first);
}
for(int i = 0;i < idx.size();i++) {
for(int j = 0;j <= K;j++) {
sparse[i][j].assign(idx[i].size(),0);
}
}
for(int i = 0;i < idx.size();i++) {
uy[row[i]] = i + 1;
for(int j = 0;j < idx[i].size();j++) {
if(i == (int)idx.size() - 1 || row[i] + 1 != row[i + 1]) {
sparse[i][0][j] = INT_MAX;
} else {
auto it = lower_bound(idx[i + 1].begin(),idx[i + 1].end(),idx[i][j]);
if(it == idx[i + 1].end()) {
sparse[i][0][j] = INT_MAX;
} else {
sparse[i][0][j] = (*it);
}
}
}
}
for(int j = 1;j <= K;j++) {
for(int i = 0;i + (1<<j) <= (int)idx.size();i++) {
for(int pp = 0;pp < idx[i].size();pp++) {
int fi = sparse[i][j - 1][pp];
auto it = lower_bound(idx[i + (1<<(j - 1))].begin(),idx[i + (1<<(j - 1))].end(),fi);
if(row[i + (1<<(j - 1)) - 1] + 1 != row[i + (1<<(j - 1))]) {
sparse[i][j][pp] = INT_MAX;
} else {
int pos = it - idx[i + (1<<(j - 1))].begin();
sparse[i][j][pp] = sparse[i + (1<<(j - 1))][j - 1][pos];
}
}
}
}
int q;
cin>>q;
while(q--) {
int r1,c1,r2,c2;
cin>>r1>>c1>>r2>>c2;
if(r1 > r2 || c1 > c2) {
cout<<"NO"<<endl;
continue;
}
if(r1 == r2) {
cout<<"YES"<<endl;
continue;
}
r1 = uy[r1];
if(r1 == 0) {
cout<<"NO"<<endl;
continue;
}
int mn = INT_MAX;
if(uy[r2] != 0) {
mn = min(mn,query(r1,c1,uy[r2]));
}
if(uy[r2 - 1] != 0) {
mn = min(mn,query(r1,c1,uy[r2 - 1]));
}
if(mn > c2) {
cout<<"NO"<<endl;
} else {
cout<<"YES"<<endl;
}
}
return 0;
}
Compilation message
trampoline.cpp: In function 'int main()':
trampoline.cpp:85:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for(int i = 0;i < idx.size();i++) {
| ~~^~~~~~~~~~~~
trampoline.cpp:91:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
91 | for(int i = 0;i < idx.size();i++) {
| ~~^~~~~~~~~~~~
trampoline.cpp:94:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
94 | for(int j = 0;j < idx[i].size();j++) {
| ~~^~~~~~~~~~~~~~~
trampoline.cpp:110:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
110 | for(int pp = 0;pp < idx[i].size();pp++) {
| ~~~^~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
82 ms |
150348 KB |
200 token(s): yes count is 21, no count is 179 |
| 2 |
Correct |
78 ms |
150324 KB |
200 token(s): yes count is 70, no count is 130 |
| 3 |
Correct |
72 ms |
150076 KB |
197 token(s): yes count is 25, no count is 172 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
194 ms |
169324 KB |
4000 token(s): yes count is 99, no count is 3901 |
| 2 |
Correct |
220 ms |
169356 KB |
4000 token(s): yes count is 91, no count is 3909 |
| 3 |
Correct |
194 ms |
168168 KB |
4000 token(s): yes count is 4000, no count is 0 |
| 4 |
Correct |
171 ms |
169388 KB |
4000 token(s): yes count is 1991, no count is 2009 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
312 ms |
168192 KB |
200000 token(s): yes count is 110486, no count is 89514 |
| 2 |
Correct |
309 ms |
168204 KB |
200000 token(s): yes count is 114664, no count is 85336 |
| 3 |
Correct |
363 ms |
168424 KB |
200000 token(s): yes count is 86232, no count is 113768 |
| 4 |
Correct |
444 ms |
169908 KB |
200000 token(s): yes count is 94603, no count is 105397 |
| 5 |
Correct |
384 ms |
169676 KB |
200000 token(s): yes count is 94148, no count is 105852 |
| 6 |
Correct |
798 ms |
210400 KB |
200000 token(s): yes count is 97163, no count is 102837 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
81 ms |
149968 KB |
5000 token(s): yes count is 3238, no count is 1762 |
| 2 |
Correct |
79 ms |
149872 KB |
5000 token(s): yes count is 3837, no count is 1163 |
| 3 |
Runtime error |
236 ms |
311648 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
577 ms |
445812 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
