Submission #1027834

#TimeUsernameProblemLanguageResultExecution timeMemory
1027834vjudge1Trampoline (info1cup20_trampoline)C++17
11 / 100
395 ms22860 KiB
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> using namespace std; #define int long long #define OYY LLONG_MAX #define mod 998244353 #define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define FOR for(int i=1;i<=n;i++) #define mid (start+end)/2 #define lim 200005 #define fi first #define se second int r,c,timer; vector<int> v[lim]; //int dp[2505][2505]; int xm[lim],ym[lim]; int tut[lim]; map<int,int> mp; //map<pair<int,int>,int> dp; set<int> st; /* inline int f(int x,int y,int tx,int ty){ if(mp[x]>r || y>c)return 0; if(mp[x]==mp[tx] && y<=ty)return 1; if(dp.find({x,y})!=dp.end())return dp[{x,y}]; int cev=0; for(auto a:v[x]){ if(a<y || a>ty)continue; cev+=f(x+1,a,tx,ty); } return dp[{x,y}]=cev; } */ inline void solve(int n){ FOR{ cin>>xm[i]>>ym[i]; st.insert(xm[i]); } for(auto x:st){ mp[x]=++timer; tut[timer]=x; } FOR{ v[mp[xm[i]]].push_back(ym[i]); } for(int i=1;i<=timer;i++){ sort(v[i].begin(),v[i].end()); } int q;cin>>q; while(q--){ int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; if(mp.find(x1)==mp.end()){ cout<<"No"<<'\n'; continue; } int tut=lower_bound(v[mp[x1]].begin(),v[mp[x1]].end(),y1)-v[mp[x1]].begin(); if(tut>=v[mp[x1]].size()){ cout<<"No"<<'\n'; continue; } if(v[mp[x1]][tut]<=y2){ cout<<"Yes"<<'\n'; } else cout<<"No"<<'\n'; } } int32_t main(){ faster int n;cin>>r>>c>>n; /*if(n<=5000){ FOR{ cin>>xm[i]>>ym[i]; st.insert(xm[i]); } for(auto x:st){ mp[x]=++timer; tut[timer]=x; } FOR{ v[mp[xm[i]]].push_back(ym[i]); } int q;cin>>q; while(q--){ int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; dp.clear(); int tut=f(x1,y1,x2,y2); if(tut)cout<<"Yes"<<'\n'; else cout<<"No"<<'\n'; } return 0; }*/ solve(n); return 0; }

Compilation message (stderr)

trampoline.cpp: In function 'void solve(long long int)':
trampoline.cpp:72:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   if(tut>=v[mp[x1]].size()){
      |      ~~~^~~~~~~~~~~~~~~~~~
#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...