oj.uz

Submission #682321

# Submission time Handle Problem Language Result Execution time Memory
682321 2023-01-16T06:20:52 Z smartmonky Trading (IZhO13_trading) C++14
100 / 100
 270 ms 20720 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

const int N = 3e5 + 1;
int t[N * 4], add[N * 4], ans[N * 4];
int lg, rg, x;
int n;
void push(int v, int tl, int tr){
	t[v] = max(t[v], add[v]);
	if(tl != tr){
		int mid = (tl + tr) >> 1;
		add[v * 2 + 1] = max(add[v * 2 + 1], add[v]);
		add[v * 2] = max(add[v * 2], add[v] - tr + mid);
	}
}

void update(int v = 1, int tl = 1, int tr = n){
	push(v, tl, tr);
	if(tl > rg || tr < lg)
		return;
	if(tl >= lg && tr <= rg){
		add[v] = max(add[v], x + tr - lg);
		push(v, tl, tr);
		return;
	}
	int mid = (tl + tr) >> 1;
	update(v * 2, tl, mid);
	update(v * 2 + 1, mid + 1, tr);
}
void get(int v = 1, int tl = 1, int tr = n){
	push(v, tl, tr);
	if(tl == tr){
		ans[tl] = t[v];
		return;	
	}else{
		int mid = (tl + tr) >> 1;
		get(v * 2, tl, mid);
		get(v * 2 + 1, mid + 1, tr);
	}
}
main(){
	ios_base::sync_with_stdio(0);
    cin.tie(0);
    int m;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
		cin >> lg >> rg >> x;
		update();
	}
	get();
	for(int i = 1; i <= n; i++){
		cout << ans[i] <<" ";
	}
}

Compilation message

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

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 123 ms 10504 KB Output is correct
8 Correct 146 ms 10960 KB Output is correct
9 Correct 139 ms 10916 KB Output is correct
10 Correct 154 ms 10800 KB Output is correct
11 Correct 172 ms 11528 KB Output is correct
12 Correct 165 ms 11340 KB Output is correct
13 Correct 176 ms 11612 KB Output is correct
14 Correct 223 ms 11408 KB Output is correct
15 Correct 194 ms 11848 KB Output is correct
16 Correct 217 ms 11852 KB Output is correct
17 Correct 220 ms 20164 KB Output is correct
18 Correct 229 ms 20300 KB Output is correct
19 Correct 233 ms 20312 KB Output is correct
20 Correct 270 ms 20720 KB Output is correct