# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970449 | 2024-04-26T14:36:27 Z | jadai007 | Trading (IZhO13_trading) | C++14 | 131 ms | 22968 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 300005; int n, q; vector<pair<int, int>> vc[maxn]; int ans[maxn]; int main(){ cin.tie(nullptr)->sync_with_stdio(false); cin >> n >> q; for (int i = 1; i <= q; ++i){ int l, r, val; cin >> l >> r >> val; vc[l].push_back({r, val - l}); } priority_queue<pair<int, int>> pq; for (int i = 1; i <= n; ++i){ while (!pq.empty() && pq.top().second < i) pq.pop(); for (int j = 0; j < vc[i].size(); ++j) pq.push({vc[i][j].second, vc[i][j].first}); if (!pq.empty()) ans[i] = pq.top().first + i; else ans[i] = 0; cout << ans[i] << ' '; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 8284 KB | Output is correct |
2 | Correct | 2 ms | 8284 KB | Output is correct |
3 | Correct | 2 ms | 8284 KB | Output is correct |
4 | Correct | 2 ms | 8540 KB | Output is correct |
5 | Correct | 3 ms | 8540 KB | Output is correct |
6 | Correct | 4 ms | 8540 KB | Output is correct |
7 | Correct | 61 ms | 15792 KB | Output is correct |
8 | Correct | 66 ms | 16836 KB | Output is correct |
9 | Correct | 69 ms | 17344 KB | Output is correct |
10 | Correct | 78 ms | 17096 KB | Output is correct |
11 | Correct | 80 ms | 17856 KB | Output is correct |
12 | Correct | 84 ms | 19108 KB | Output is correct |
13 | Correct | 93 ms | 18108 KB | Output is correct |
14 | Correct | 89 ms | 18496 KB | Output is correct |
15 | Correct | 109 ms | 20804 KB | Output is correct |
16 | Correct | 103 ms | 19672 KB | Output is correct |
17 | Correct | 102 ms | 19844 KB | Output is correct |
18 | Correct | 118 ms | 21368 KB | Output is correct |
19 | Correct | 108 ms | 20440 KB | Output is correct |
20 | Correct | 131 ms | 22968 KB | Output is correct |