# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
929213 |
2024-02-18T00:03:39 Z |
Karoot |
Trading (IZhO13_trading) |
C++17 |
|
241 ms |
36920 KB |
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
ll linf = 1e15+1;
inline void scoobydoobydoo(){
ios::sync_with_stdio(false);
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
multiset<ll> ms;
vector<ll> start[300001];
vector<ll> ende[300001];
int main(){
scoobydoobydoo();
int n, m; cin >> n >> m;
for (int i = 0; i < m; i++){
int l, r, X; cin >> l >> r >> X;
l--; r--;
start[l].push_back(X-l);
ende[r+1].push_back(X-l);
}
for (int i = 0; i < n; i++){
for (int x : start[i])ms.insert(x);
for (int x : ende[i]){
auto it = ms.find(x);
ms.erase(it);
}
if (ms.empty())cout << 0 << " ";
else cout << *ms.rbegin()+i << " ";
}
cout << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
14428 KB |
Output is correct |
2 |
Correct |
4 ms |
14428 KB |
Output is correct |
3 |
Correct |
5 ms |
14424 KB |
Output is correct |
4 |
Correct |
4 ms |
14428 KB |
Output is correct |
5 |
Correct |
4 ms |
14428 KB |
Output is correct |
6 |
Correct |
5 ms |
14680 KB |
Output is correct |
7 |
Correct |
102 ms |
26276 KB |
Output is correct |
8 |
Correct |
125 ms |
27380 KB |
Output is correct |
9 |
Correct |
123 ms |
28096 KB |
Output is correct |
10 |
Correct |
126 ms |
28988 KB |
Output is correct |
11 |
Correct |
121 ms |
29116 KB |
Output is correct |
12 |
Correct |
157 ms |
31672 KB |
Output is correct |
13 |
Correct |
156 ms |
30500 KB |
Output is correct |
14 |
Correct |
187 ms |
31932 KB |
Output is correct |
15 |
Correct |
212 ms |
32940 KB |
Output is correct |
16 |
Correct |
169 ms |
32752 KB |
Output is correct |
17 |
Correct |
212 ms |
33188 KB |
Output is correct |
18 |
Correct |
232 ms |
36212 KB |
Output is correct |
19 |
Correct |
176 ms |
33356 KB |
Output is correct |
20 |
Correct |
241 ms |
36920 KB |
Output is correct |