oj.uz

Submission #638881

# Submission time Handle Problem Language Result Execution time Memory
638881 2022-09-07T19:13:21 Z MohamedAhmed04 Trading (IZhO13_trading) C++14
100 / 100
 263 ms 28984 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 3e5 + 10 ;

int arr[MAX] ;
int n , m ;

vector< pair<int , int> >vp[MAX] ;
int ans[MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	for(int i = 0 ; i < m ; ++i)
	{
		int l , r , x ;
		cin>>l>>r>>x ;
		vp[l].emplace_back(x-l , 1) , vp[r+1].emplace_back(x-l , -1) ;
	}
	multiset<int>s ;
	for(int i = 1 ; i <= n ; ++i)
	{
		for(auto &p : vp[i])
		{
			if(p.second == 1)
				s.insert(p.first) ;
			else
				s.erase(s.find(p.first)) ;
		}
		if(s.size())
			ans[i] = *s.rbegin() + i ;
	}
	for(int i = 1 ; i <= n ; ++i)
		cout<<ans[i]<<" " ;
	cout<<"\n" ;
	return 0 ;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7376 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7344 KB Output is correct
5 Correct 5 ms 7392 KB Output is correct
6 Correct 6 ms 7508 KB Output is correct
7 Correct 121 ms 18224 KB Output is correct
8 Correct 139 ms 19980 KB Output is correct
9 Correct 155 ms 20660 KB Output is correct
10 Correct 161 ms 21756 KB Output is correct
11 Correct 159 ms 22108 KB Output is correct
12 Correct 195 ms 24440 KB Output is correct
13 Correct 176 ms 22700 KB Output is correct
14 Correct 183 ms 23388 KB Output is correct
15 Correct 213 ms 25604 KB Output is correct
16 Correct 231 ms 24876 KB Output is correct
17 Correct 221 ms 25152 KB Output is correct
18 Correct 241 ms 28984 KB Output is correct
19 Correct 213 ms 25684 KB Output is correct
20 Correct 263 ms 28528 KB Output is correct