# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894586 | 2023-12-28T13:25:39 Z | Andrey | Trading (IZhO13_trading) | C++14 | 141 ms | 26552 KB |
#include <bits/stdc++.h> using namespace std; vector<pair<int,int>> haha[500002]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n,q,l,r,a; cin >> n >> q; for(int i = 0; i < q; i++) { cin >> l >> r >> a; haha[l].push_back({a-l,r}); } priority_queue<pair<int,int>> idk; for(int i = 1; i <= n; i++) { for(int j = 0; j < haha[i].size(); j++) { idk.push(haha[i][j]); } while(!idk.empty() && idk.top().second < i) { idk.pop(); } if(idk.empty()) { cout << 0 << " "; } else { cout << idk.top().first+i << " "; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 12376 KB | Output is correct |
2 | Correct | 3 ms | 12124 KB | Output is correct |
3 | Correct | 3 ms | 12116 KB | Output is correct |
4 | Correct | 3 ms | 12124 KB | Output is correct |
5 | Correct | 3 ms | 12124 KB | Output is correct |
6 | Correct | 4 ms | 12144 KB | Output is correct |
7 | Correct | 62 ms | 19332 KB | Output is correct |
8 | Correct | 68 ms | 20424 KB | Output is correct |
9 | Correct | 77 ms | 20808 KB | Output is correct |
10 | Correct | 77 ms | 20796 KB | Output is correct |
11 | Correct | 81 ms | 21448 KB | Output is correct |
12 | Correct | 85 ms | 22528 KB | Output is correct |
13 | Correct | 89 ms | 21728 KB | Output is correct |
14 | Correct | 99 ms | 22076 KB | Output is correct |
15 | Correct | 103 ms | 24140 KB | Output is correct |
16 | Correct | 141 ms | 23108 KB | Output is correct |
17 | Correct | 115 ms | 23620 KB | Output is correct |
18 | Correct | 110 ms | 24988 KB | Output is correct |
19 | Correct | 107 ms | 23940 KB | Output is correct |
20 | Correct | 135 ms | 26552 KB | Output is correct |