Submission #1111654

#TimeUsernameProblemLanguageResultExecution timeMemory
1111654Onur_IlgazNew Home (APIO18_new_home)C++17
5 / 100
5060 ms25268 KiB
#include <bits/stdc++.h> #define fast cin.tie(0)->sync_with_stdio(0); #define int long long #define inf ((int)1e18) using namespace std; int32_t main(){ fast int n, k, q; cin >> n >> k >> q; vector <array<int, 4> > arr; for(int i = 0; i < n; i++) { int x, t, a, b; cin >> x >> t >> a >> b; t--; arr.push_back({x, t, a, b}); } while(q--) { int x, t; cin >> x >> t; vector <int> mins(k, inf); for(auto [pos, type, a, b]:arr) { if(t >= a and t <= b) { mins[type] = min(mins[type], abs(pos - x)); } } int ans = 0; for(auto it:mins) { ans = max(ans, it); } cout << (ans == inf ? -1 : ans) << '\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...
#Verdict Execution timeMemoryGrader output
Fetching results...