Submission #702295

#TimeUsernameProblemLanguageResultExecution timeMemory
702295josanneo22New Home (APIO18_new_home)C++17
0 / 100
5052 ms13704 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; while (t--) { int n, type, q; cin >> n >> type >> q; vector<int> loc(n), tp(n), st(n), ed(n); for (int i = 0; i < n; i++) { cin >> loc[i] >> tp[i] >> st[i] >> ed[i]; } for (int i = 0; i < q; i++) { int u, v; cin >> u >> v; vector<int> cur_type(type + 1, 0); int ans = 0; for (int j = 0; j < n; j++) { if(st[j]<=v && ed[j]>=v){ ans = max(ans, abs(u-loc[j])); cur_type[tp[j]]=1; } } int ok = 1; for (int p = 1; p <= type; p++) { ok&=cur_type[p]; } if (ok == 0) cout << "-1\n"; else cout << 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...