Submission #658985

#TimeUsernameProblemLanguageResultExecution timeMemory
658985600MihneaNew Home (APIO18_new_home)C++17
0 / 100
4 ms7252 KiB
bool home = 1; #include <bits/stdc++.h> using namespace std; struct Store { int x; int type; int first_time; int last_time; }; struct Query { int x; int t; }; const int N = (int) 3e5 + 7; int n; int k; int q; vector<int> whereType[N]; Store stores[N]; Query queries[N]; int main() { if (home) { freopen ("input.txt", "r", stdin); } else { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } { /// Read cin >> n >> k >> q; for (int i = 1; i <= n; i++) { cin >> stores[i].x >> stores[i].type >> stores[i].first_time >> stores[i].last_time; whereType[stores[i].type].push_back(i); } for (int i = 1; i <= q; i++) { cin >> queries[i].x >> queries[i].t; } } { /// Normalize time } { /// Normalize positions } { /// Brute for (int iq = 1; iq <= q; iq++) { int maxDist = 0; for (int t = 1; t <= k; t++) { int minDist = (int) 1e9 + 7; for (auto &i : whereType[t]) { if (stores[i].first_time <= queries[iq].t && queries[iq].t <= stores[i].last_time) { minDist = min(minDist, abs(stores[i].x - queries[iq].x)); } } maxDist = max(maxDist, minDist); } if (maxDist == (int) 1e9 + 7) { maxDist = -1; } cout << maxDist << "\n"; } } return 0; }

Compilation message (stderr)

new_home.cpp: In function 'int main()':
new_home.cpp:29:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen ("input.txt", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...