제출 #690504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
690504		mansur	거래 (IZhO13_trading)	C++17	100 / 100	307 ms	35260 KiB

trading

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define pf push_front
#define pb push_back
#define vt vector
#define s second
#define f first
#define nl '\n'
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vt<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vt<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 2e6 + 6, mod = 998244353;

const ll inf = 1e9;
 
double eps = 1e-15;
                        
bool fl = 0;

void slv() {
	int n, m;
	cin >> n >> m;
	vt<int> add[n + 1], del[n + 1];
	for (int i = 1; i <= m; i++) {
		int l, r, x;
		cin >> l >> r >> x;
		add[l].pb(x - l);
		if (r < n) del[r + 1].pb(x - l);
	}
	multiset<int> s;
	for (int i = 1; i <= n; i++) {
		for (int x: add[i]) s.insert(x);
		for (int x: del[i]) {
			s.erase(s.find(x));
		}
		if (s.empty()) cout << 0 << ' ';
		else cout << *--s.end() + i << ' ';
	}
}                        
 
main() {
	//freopen("shops.in", "r", stdin);                                                                                     
	//freopen("shops.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (fl) cin >> tp;
	while (tp--) {  	
		slv();
	}
}                                               

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

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

• Subtask 1: 100 / 100