oj.uz

Submission #502129

# Submission time Handle Problem Language Result Execution time Memory
502129 2022-01-05T10:47:11 Z tmn2005 Trading (IZhO13_trading) C++17
0 / 100
 2000 ms 6544 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<pii, int>, vec<pair<pii, int>>, greater<pair<pii, int>> > q, s;
    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++){
		k = -INF;
		if(q.top().fr.fr <= i && i <= q.top().fr.sc){
			while(!q.empty() && q.top().fr.fr <= i && i <= q.top().fr.sc){
				s.push(q.top());
				k = max(k, q.top().sc);
				q.pop();
			}
			a[i] = (k == -INF ? 0 : i + k);
			while(!s.empty()){
				if(s.top().fr.sc >= i+1){
					q.push(s.top());
				}
				s.pop();
			}
		}
		else{
			while(!q.empty() && q.top().fr.fr <= i){
				s.push(q.top());
				q.pop();
			}
			while(!s.empty()){
				if(s.top().fr.sc >= i+1){
					q.push(s.top());
				}
				if(s.top().fr.fr <= i && i <= s.top().fr.sc){
					k = max(k, s.top().sc);
				}
				s.pop();
			}
			a[i] = (k == -INF ? 0 : i + k);
		}
	}
	for(int i=1; i<=n; i++){
		cout<<a[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
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 29 ms 368 KB Output is correct
5 Correct 122 ms 396 KB Output is correct
6 Correct 282 ms 592 KB Output is correct
7 Execution timed out 2080 ms 6544 KB Time limit exceeded
8 Halted 0 ms 0 KB -