# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755600 | 2023-06-10T11:52:40 Z | pera | Trading (IZhO13_trading) | C++17 | 485 ms | 34380 KB |
#include<bits/stdc++.h> using namespace std; #define int long long const int N = 3e5 + 1; vector<int> g[N]; vector<int> y[N]; main(){ int n , m;cin >> n >> m; vector<int> a(n + 1); for(int i = 1;i <= m;i ++){ int l , r , x;cin >> l >> r >> x; g[l].push_back(x - l); y[r + 1].push_back(x - l); } multiset<int> s; for(int i = 1;i <= n;i ++){ for(int j = 0;j < g[i].size();j ++) s.insert(g[i][j]); for(int j = 0;j < y[i].size();j ++) s.erase(s.find(y[i][j])); cout << (s.empty() ? 0 : *--s.end() + i) << " "; //cout << i << " "; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 14292 KB | Output is correct |
2 | Correct | 9 ms | 14320 KB | Output is correct |
3 | Correct | 8 ms | 14392 KB | Output is correct |
4 | Correct | 9 ms | 14396 KB | Output is correct |
5 | Correct | 9 ms | 14420 KB | Output is correct |
6 | Correct | 12 ms | 14548 KB | Output is correct |
7 | Correct | 236 ms | 25876 KB | Output is correct |
8 | Correct | 255 ms | 26792 KB | Output is correct |
9 | Correct | 244 ms | 27236 KB | Output is correct |
10 | Correct | 301 ms | 28172 KB | Output is correct |
11 | Correct | 347 ms | 28456 KB | Output is correct |
12 | Correct | 362 ms | 30528 KB | Output is correct |
13 | Correct | 416 ms | 29356 KB | Output is correct |
14 | Correct | 347 ms | 30744 KB | Output is correct |
15 | Correct | 412 ms | 31192 KB | Output is correct |
16 | Correct | 407 ms | 31116 KB | Output is correct |
17 | Correct | 407 ms | 31644 KB | Output is correct |
18 | Correct | 485 ms | 34380 KB | Output is correct |
19 | Correct | 433 ms | 32004 KB | Output is correct |
20 | Correct | 452 ms | 34240 KB | Output is correct |