Submission #1144949

#TimeUsernameProblemLanguageResultExecution timeMemory
1144949Halym2007Trampoline (info1cup20_trampoline)C++17
62 / 100
2095 ms2208 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define sz size() #define ff first #define ss second #define pb push_back #define pii pair <int, int> #define dur exit(0) #define dur1 return(0) const int N = 2e5 + 5; pii p[N]; int n, m, k, q; int main () { // freopen ("input.txt", "r", stdin); ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n >> m >> k; for (int i = 1; i <= k; ++i) { cin >> p[i].ff >> p[i].ss; } sort (p + 1, p + k + 1); cin >> q; while ( q-- ) { int x, y, x1, y1; cin >> x >> y >> x1 >> y1; if (x1 < x or y1 < y) { cout << "No\n"; continue; } if (x1 - x > k) { cout << "No\n"; continue; } // when it comes here x1 - x <= k --> it means every time you will go at most k times // cout << "men\n", 0; for (int i = 1; i <= k; ++i) { if (p[i].ff == x and p[i].ss >= y) { x++; y = p[i].ss; } if (x == x1) break; } if (x == x1 and y <= y1) { cout << "Yes\n"; } else cout << "No\n"; } }
#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...