Submission #475215

#TimeUsernameProblemLanguageResultExecution timeMemory
475215bigoTrampoline (info1cup20_trampoline)C++14
0 / 100
1269 ms19836 KiB
#include <iostream> #include <vector> #include <cmath> #include <set> using namespace std; #define pii pair<int, int> vector<vector<int>>vec; vector<bool>visit; void dfs(int v) { visit[v] = true; for (auto u:vec[v]) { if (!visit[u]) dfs(u); } } int main() { int r, c, n; cin >> r >> c >> n; set<pii>green; set<int>green1; int a, b; for (int i = 0; i < n; i++) { cin >> a >> b; a--, b--; green.insert({ a,b }); green1.insert(a * c + b); } int t; cin >> t; while (t--) { int y1, x1, y2, x2; cin >> y1 >> x1 >> y2 >> x2; y1--, x1--, y2--, x2--; auto it = green1.lower_bound(y1 * c + x1); if (it == green1.end()) cout << "NO"; else { if (*it <= y1 * c + x2) cout << "YES"; else cout << "NO"; } cout << endl; } }
#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...