Submission #470986

#TimeUsernameProblemLanguageResultExecution timeMemory
470986NhatMinh0208Trampoline (info1cup20_trampoline)C++17
100 / 100
1324 ms62864 KiB
#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 (stderr)

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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...