Submission #342783

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
342783	2021-01-02T18:50:47 Z	Gurban	Trading (IZhO13_trading)	C++17	100 / 100	379 ms	35468 KB

trading

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=3e5+5;
int n,m,l,r,x;
multiset<int>s;
vector<int>L[maxn],R[maxn];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for(int i = 1;i <= m;i++){
		cin >> l >> r >> x;
		L[l].push_back(x-l);
		R[r].push_back(x-l);
	}
	for(int i = 1;i <= n;i++){
		for(auto j : L[i]) s.insert(j);
		int nw = 0;
		if(!s.empty()) nw = *s.rbegin() + i;
		cout<<nw<<' '	;
		for(auto j : R[i]) s.erase(s.find(j));
	}
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	14444 KB	Output is correct
2	Correct	9 ms	14444 KB	Output is correct
3	Correct	10 ms	14444 KB	Output is correct
4	Correct	10 ms	14444 KB	Output is correct
5	Correct	12 ms	14564 KB	Output is correct
6	Correct	11 ms	14700 KB	Output is correct
7	Correct	175 ms	25700 KB	Output is correct
8	Correct	204 ms	26724 KB	Output is correct
9	Correct	210 ms	26980 KB	Output is correct
10	Correct	228 ms	28004 KB	Output is correct
11	Correct	225 ms	28516 KB	Output is correct
12	Correct	258 ms	30432 KB	Output is correct
13	Correct	248 ms	29792 KB	Output is correct
14	Correct	267 ms	30688 KB	Output is correct
15	Correct	307 ms	31588 KB	Output is correct
16	Correct	320 ms	31844 KB	Output is correct
17	Correct	317 ms	32352 KB	Output is correct
18	Correct	334 ms	35168 KB	Output is correct
19	Correct	319 ms	32480 KB	Output is correct
20	Correct	379 ms	35468 KB	Output is correct