Submission #1072651

#TimeUsernameProblemLanguageResultExecution timeMemory
1072651username_____hereTrampoline (info1cup20_trampoline)C++17
0 / 100
556 ms1048576 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef vector<int> veci; typedef vector<ll> vecll; #define fi first #define se second // debug needs a semicolon!!! #define debug(x) cerr<<# x<<" is "<<x<<'\n' #define vec vector #define pq priority_queue int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int r, c, t; cin >> r >> c >> t; set<int> green[r]; while (t--) { int rr, cc; cin >> rr >> cc; green[rr-1].insert(cc-1); } int q; cin >> q; while (q--) { int xs, ys, xe, ye; cin >> xs>> ys>> xe>> ye; xs--; xe--; ys--; ye--; int currrow=xs, currcol=ys; bool madeit=true; while (currrow < xe) { auto it=green[currrow].lower_bound(currcol); if (it == green[currrow].end()) { madeit = false; break; } if (*(it) > ye) { madeit = false; break; } currrow++; currcol = *it; } if (madeit) { 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...