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;
#define st first
#define nd second
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m,g,q;
cin>>n>>m>>g;
vector<vector<int>>a(n);
for(int i=0;i<g;i++)
{
int x,y;
cin>>x>>y;
a[x-1].push_back(y-1);
}
cin>>q;
while(q--)
{
int x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
x1--;x2--;y1--;y2--;
bool p=true;
if(x2<x1 or y2<y1)
{
p=false;
}
else
{
for(int i=x1;i<x2;i++)
{
int start=0,meta=a[i].size()-1,s=(start+meta)/2;
while(start<meta)
{
if(a[i][s]<y1)
{
start=s+1;
}
else
{
meta=s;
}
s=(start+meta)/2;
}
if(a[i].size()>0)
{
if(a[i][s]>=y1 && a[i][s]<=y2)
{
y1=a[i][s];
}
else
{
p=false;
break;
}
}
else
{
p=false;
break;
}
}
}
if(p)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
}
}
# | 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... |