Submission #217557

#TimeUsernameProblemLanguageResultExecution timeMemory
217557VEGAnnNew Home (APIO18_new_home)C++14
0 / 100
5 ms640 KiB
#include <bits/stdc++.h> using namespace std; const int N = 410; int n, k, qq, x[N], t[N], a[N], b[N], mrk[N], tt = 0; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); // freopen("in.txt","r",stdin); cin >> n >> k >> qq; assert(n < 401 && qq < 401); for (int i = 0; i < n; i++) cin >> x[i] >> t[i] >> a[i] >> b[i]; for (; qq; qq--){ int l, y; cin >> l >> y; tt++; int kol = 0, mx = 0; for (int i = 0; i < n; i++){ if (y < a[i] || y > b[i]) continue; if (mrk[t[i]] < tt) kol++; mrk[t[i]] = tt; mx = max(mx, abs(l - x[i])); } if (kol < k) cout << "-1\n"; else cout << mx << '\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...
#Verdict Execution timeMemoryGrader output
Fetching results...