oj.uz

Submission #380347

# Submission time Handle Problem Language Result Execution time Memory
380347 2021-03-21T06:06:39 Z ritul_kr_singh Trading (IZhO13_trading) C++17
100 / 100
 443 ms 35284 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
 
signed main(){
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n, m; cin >> n >> m;
	int a[m], ans[n];
	vector<int> starts[n], ends[n];
	for(int i=0, l, r; i<m; ++i){
		cin >> l >> r >> a[i];
		starts[l-1].push_back(i);
		ends[r-1].push_back(i);
		a[i] -= l-1;
	}

	multiset<int> s;

	for(int i=0; i<n; ++i){
		for(int j : starts[i]) s.insert(a[j]);
		ans[i] = s.empty() ? 0LL : *s.rbegin() + i;
		for(int j : ends[i]) s.erase(s.find(a[j]));
	}

	for(int i : ans) cout << i << ' ';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 192 ms 18780 KB Output is correct
8 Correct 214 ms 20568 KB Output is correct
9 Correct 247 ms 21336 KB Output is correct
10 Correct 267 ms 23252 KB Output is correct
11 Correct 251 ms 24280 KB Output is correct
12 Correct 324 ms 26940 KB Output is correct
13 Correct 304 ms 26448 KB Output is correct
14 Correct 305 ms 28244 KB Output is correct
15 Correct 365 ms 29532 KB Output is correct
16 Correct 396 ms 29916 KB Output is correct
17 Correct 348 ms 30552 KB Output is correct
18 Correct 395 ms 34008 KB Output is correct
19 Correct 365 ms 32212 KB Output is correct
20 Correct 443 ms 35284 KB Output is correct