Submission #992323

#TimeUsernameProblemLanguageResultExecution timeMemory
992323ramalzaherTrampoline (info1cup20_trampoline)C++14
0 / 100
2060 ms17156 KiB
#include <bits/stdc++.h> #define ll long long #define sz size() #define pb push_back #define all(x) x.begin() , x.end() using namespace std; int main() { int r , c , n ; cin >> r >>c >> n ; map<int,set<int>>mp; for (int i = 0; i < n; i++) { int a, b ; cin >> a >> b; mp[a].insert(b) ; } int t ; cin >> t; for (int i = 0; i < t; i++) { vector<int> v ; bool ok= 0 ; int sx , sy , ex , ey ; cin >> sx >> sy >> ex >> ey; sy = *mp[sx].lower_bound(sy) ; for(int j = sx ; j < ex ; j ++ ){ auto itt = mp[j].lower_bound(sy) ; if(itt==mp[j].end()) {ok=1; break ; } sy = *itt ; } v.pb(ey); if(ey >= sy && ok == 0 )cout<<"Yes\n"; else cout<<"No\n"; } return 0; }
#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...