제출 #501265

#제출 시각아이디문제언어결과실행 시간메모리
501265beksultan04거래 (IZhO13_trading)C++14
100 / 100
327 ms17196 KiB
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
#define ordered_set tree <int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N = 5e5+12,INF = 1e9+7;
int a[N],der[N];
main(){
	int n,m,i;
	cin>>n>>m;
	deque <pair<pii,int> > v;
	for (i=1;i<=m;++i){
		int l,r,x;
		cin>>l>>r>>x;
		v.pb({{l,r},x-l});
	}
	priority_queue <pii> q;
	sort(all(v));
	for (i=1;i<=n;++i){
		while (!v.empty() && v[0].fr.fr <= i){
			q.push({v[0].sc,v[0].fr.sc});
			v.pop_front();
		}
		while (!q.empty() && q.top().sc<i){
			q.pop();
		}
		if (q.empty())cout <<0<<" ";
		else 
			cout <<q.top().fr+i<< " ";
	}
	
}








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

trading.cpp:22:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   22 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...