제출 #502152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502152		tmn2005	거래 (IZhO13_trading)	C++17	100 / 100	203 ms	18708 KiB

trading

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 100 / 100