Submission #516787

#TimeUsernameProblemLanguageResultExecution timeMemory
516787shmadNew Home (APIO18_new_home)C++17
5 / 100
5096 ms35064 KiB
#pragma GCC optimize("O3", "unroll-loops") #pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") #include <bits/stdc++.h> #define int long long #define vt vector #define pb push_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() #define ff first #define ss second #define dbg(x) cerr << #x << " = " << x << '\n' using namespace std; using ll = long long; using pii = pair<int, int>; using vvi = vt< vt<int> >; const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 17); const double eps = 1e-6; int n, k, q; struct Event { int x, a, b; }; vt<Event> g[N]; void solve () { cin >> n >> k >> q; for (int i = 1; i <= n; i++) { int x, t, a, b; cin >> x >> t >> a >> b; g[t].pb({x, a, b}); } while (q--) { int l, y; cin >> l >> y; int ans = 0; for (int i = 1; i <= k; i++) { int res = inf; for (auto [x, a, b]: g[i]) { if (a <= y && y <= b) res = min(res, abs(l - x)); } ans = max(ans, res); } cout << (ans == inf ? -1 : ans) << '\n'; } cout << '\n'; } bool testcases = 0; signed main() { cin.tie(0) -> sync_with_stdio(0); int test = 1; if (testcases) cin >> test; for (int cs = 1; cs <= test; cs++) { solve (); } }
#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...