oj.uz

Submission #502152

# Submission time Handle Problem Language Result Execution time Memory
502152 2022-01-05T11:15:50 Z tmn2005 Trading (IZhO13_trading) C++17
100 / 100
 203 ms 18708 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b,c;

main(){
	NeedForSpeed
    cin>>n>>m;
    
    priority_queue<pair<int, pii>> s;
    priority_queue<pair<pii, int>, vec<pair<pii, int>>, greater<pair<pii, int>> > q;
    for(int i=1; i<=m; i++){
    	cin>>l>>r>>x;
    	q.push(mk(mk(l, r), x - l));
	}
	
	for(int i=1; i<=n; i++){
		while(!q.empty() && q.top().fr.fr <= i && i <= q.top().fr.sc){
			s.push(mk(q.top().sc, mk(q.top().fr.fr, q.top().fr.sc)));
			q.pop();
		}
		while(!s.empty() && (i < s.top().sc.fr || s.top().sc.sc < i))s.pop();
		
		if(s.empty())cout<<0<<" ";
		else cout<<s.top().fr + i<<" ";
	}




	return 0;
}

Compilation message

trading.cpp:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 97 ms 8632 KB Output is correct
8 Correct 105 ms 9540 KB Output is correct
9 Correct 116 ms 12544 KB Output is correct
10 Correct 139 ms 15528 KB Output is correct
11 Correct 122 ms 12568 KB Output is correct
12 Correct 157 ms 16612 KB Output is correct
13 Correct 142 ms 12916 KB Output is correct
14 Correct 156 ms 14080 KB Output is correct
15 Correct 175 ms 17008 KB Output is correct
16 Correct 189 ms 13764 KB Output is correct
17 Correct 164 ms 14412 KB Output is correct
18 Correct 203 ms 18708 KB Output is correct
19 Correct 186 ms 17904 KB Output is correct
20 Correct 197 ms 16084 KB Output is correct