#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int r,c,n,m,i,j,k,t,t1,u,v,a,b;
int x[200001],y[200001];
int ordp[200001];
int nxt[200001][20];
int sx,sy,tx,ty;
map<int,vector<int>> mp;
map<int,int> ord;
int main()
{
fio;
cin>>r>>c>>n;
for (i=1;i<=n;i++)
{
cin>>x[i]>>y[i];
mp[x[i]].push_back(i);
}
u=0;
for (auto& g : mp) {
sort(g.se.begin(),g.se.end(),[](int a, int b){
return (y[a]<y[b]);
});
u++;
ord[g.fi]=u;
vec.push_back(g.fi);
for (auto gg : g.se) ordp[gg]=u;
}
for (j=0;j<20;j++) {
if (j==0) {
for (i=1;i<=n;i++) {
u=ordp[i];
if (u==vec.size() || vec[u]-vec[u-1]>1) nxt[i][j]=-1;
else {
auto it =((lower_bound(mp[vec[u]].begin(),mp[vec[u]].end(),i,[](int a, int b){
return (y[a]<y[b]);
})));
if (it==mp[vec[u]].end()) nxt[i][j]=-1;
else nxt[i][j]=(*it);
}
}
}
else {
for (i=1;i<=n;i++) {
if (nxt[i][j-1]==-1) nxt[i][j]=-1;
else nxt[i][j]=nxt[nxt[i][j-1]][j-1];
}
}
}
cin>>m;
for (i=1;i<=m;i++) {
cin>>sx>>sy>>tx>>ty;
if (sx>tx || sy>ty) {
cout<<"No\n";
continue;
}
if (sx == tx) {
cout<<"Yes\n";
continue;
}
u=ord[sx];
v=ord[tx-1];
if (u==0 || v==0) {
cout<<"No\n";
continue;
}
y[0]=sy;
// for (auto g : mp[sx]) {
// cout<<g<<" ";
// }
// cout<<"\n";
auto it=lower_bound(mp[sx].begin(),mp[sx].end(),0,[](int a, int b){
return (y[a]<y[b]);
});
if (it==mp[sx].end()) {
cout<<"No\n";
continue;
}
a = (*it);
for (j=19;j>=0;j--) {
if (a==-1) break;
else if (u+(1<<j)<=v) {
u+=(1<<j);
a=nxt[a][j];
}
}
if (a==-1 || y[a]>ty) {
cout<<"No\n";
continue;
} else {
cout<<"Yes\n";
continue;
}
}
}
// Normie28;
Compilation message
trampoline.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
23 | #pragma comment(linker, "/stack:200000000")
|
trampoline.cpp: In function 'int main()':
trampoline.cpp:131:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
131 | if (u==vec.size() || vec[u]-vec[u-1]>1) nxt[i][j]=-1;
| ~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
1284 KB |
200 token(s): yes count is 21, no count is 179 |
| 2 |
Correct |
7 ms |
1352 KB |
200 token(s): yes count is 70, no count is 130 |
| 3 |
Correct |
5 ms |
1100 KB |
197 token(s): yes count is 25, no count is 172 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
219 ms |
21828 KB |
4000 token(s): yes count is 99, no count is 3901 |
| 2 |
Correct |
223 ms |
21832 KB |
4000 token(s): yes count is 91, no count is 3909 |
| 3 |
Correct |
199 ms |
21040 KB |
4000 token(s): yes count is 4000, no count is 0 |
| 4 |
Correct |
219 ms |
22084 KB |
4000 token(s): yes count is 1991, no count is 2009 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
332 ms |
32028 KB |
200000 token(s): yes count is 110486, no count is 89514 |
| 2 |
Correct |
347 ms |
31772 KB |
200000 token(s): yes count is 114664, no count is 85336 |
| 3 |
Correct |
348 ms |
31636 KB |
200000 token(s): yes count is 86232, no count is 113768 |
| 4 |
Correct |
435 ms |
32324 KB |
200000 token(s): yes count is 94603, no count is 105397 |
| 5 |
Correct |
431 ms |
32264 KB |
200000 token(s): yes count is 94148, no count is 105852 |
| 6 |
Correct |
741 ms |
41792 KB |
200000 token(s): yes count is 97163, no count is 102837 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1100 KB |
5000 token(s): yes count is 3238, no count is 1762 |
| 2 |
Correct |
8 ms |
1100 KB |
5000 token(s): yes count is 3837, no count is 1163 |
| 3 |
Correct |
10 ms |
1864 KB |
5000 token(s): yes count is 4104, no count is 896 |
| 4 |
Correct |
8 ms |
1100 KB |
5000 token(s): yes count is 3934, no count is 1066 |
| 5 |
Correct |
10 ms |
1360 KB |
5000 token(s): yes count is 3384, no count is 1616 |
| 6 |
Correct |
7 ms |
1088 KB |
5000 token(s): yes count is 3390, no count is 1610 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
985 ms |
43684 KB |
200000 token(s): yes count is 171404, no count is 28596 |
| 2 |
Correct |
659 ms |
35136 KB |
200000 token(s): yes count is 161254, no count is 38746 |
| 3 |
Correct |
379 ms |
31928 KB |
200000 token(s): yes count is 117455, no count is 82545 |
| 4 |
Correct |
1324 ms |
62864 KB |
200000 token(s): yes count is 182118, no count is 17882 |
| 5 |
Correct |
681 ms |
42544 KB |
200000 token(s): yes count is 167565, no count is 32435 |
| 6 |
Correct |
379 ms |
31736 KB |
200000 token(s): yes count is 156797, no count is 43203 |
| 7 |
Correct |
376 ms |
31712 KB |
200000 token(s): yes count is 156797, no count is 43203 |
| 8 |
Correct |
369 ms |
32024 KB |
200000 token(s): yes count is 122100, no count is 77900 |
| 9 |
Correct |
875 ms |
41548 KB |
200000 token(s): yes count is 139670, no count is 60330 |
| 10 |
Correct |
987 ms |
41632 KB |
200000 token(s): yes count is 165806, no count is 34194 |
| 11 |
Correct |
1146 ms |
52160 KB |
200000 token(s): yes count is 175646, no count is 24354 |
| 12 |
Correct |
320 ms |
31672 KB |
200000 token(s): yes count is 134695, no count is 65305 |
| 13 |
Correct |
332 ms |
31972 KB |
200000 token(s): yes count is 126733, no count is 73267 |
| 14 |
Correct |
462 ms |
32224 KB |
200000 token(s): yes count is 155290, no count is 44710 |
| 15 |
Correct |
340 ms |
31780 KB |
200000 token(s): yes count is 129674, no count is 70326 |
