답안 #690684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
690684 2023-01-30T10:56:44 Z Kaztaev_Alisher 거래 (IZhO13_trading) C++17
100 / 100
330 ms 30432 KB
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long; 

const ll N = 300005 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;	
 
ll n , q;
vector<pair<ll,ll>> v[N];
multiset<ll> st;

void solve(){
	cin >> n >> q;
	while(q--){
		ll l , r , x;
		cin >> l >> r >> x;
		v[l].push_back({1 , x-l});
		v[r+1].push_back({0 , x-l});
	}
	for(ll i = 1; i <= n; i++){
		sort(all(v[i]));
		for(pair<ll,ll> x : v[i]){
			if(x.F == 1) st.insert(x.S);
			else st.erase(st.find(x.S));
		}
		if(st.size() == 0) cout << "0 ";
		else cout << *st.rbegin()+i <<" ";
	}
}
/*
 
*/
signed main(){
	ios;
	file("trading");
	solve();
	return 0;
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:4:48: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
trading.cpp:42:2: note: in expansion of macro 'file'
   42 |  file("trading");
      |  ^~~~
trading.cpp:4:77: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
      |                                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
trading.cpp:42:2: note: in expansion of macro 'file'
   42 |  file("trading");
      |  ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7368 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 7 ms 7380 KB Output is correct
5 Correct 6 ms 7508 KB Output is correct
6 Correct 8 ms 7508 KB Output is correct
7 Correct 153 ms 20304 KB Output is correct
8 Correct 161 ms 21284 KB Output is correct
9 Correct 172 ms 22792 KB Output is correct
10 Correct 177 ms 24492 KB Output is correct
11 Correct 172 ms 23212 KB Output is correct
12 Correct 195 ms 26664 KB Output is correct
13 Correct 220 ms 24480 KB Output is correct
14 Correct 196 ms 25976 KB Output is correct
15 Correct 307 ms 27832 KB Output is correct
16 Correct 330 ms 26992 KB Output is correct
17 Correct 285 ms 27432 KB Output is correct
18 Correct 235 ms 30432 KB Output is correct
19 Correct 239 ms 27496 KB Output is correct
20 Correct 246 ms 29872 KB Output is correct