Submission #682300

# Submission time Handle Problem Language Result Execution time Memory
682300 2023-01-16T06:00:23 Z smartmonky Trading (IZhO13_trading) C++14
0 / 100
1 ms 340 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){
	if(tl == tr || add[v] == 0){
		t[v] = max(t[v], add[v]);
		add[v] = 0;
		return;
	}
	t[v] = max(t[v], add[v]);
	int mid = (tl + tr) >> 1;
	add[v * 2 + 1] = add[v];
	add[v * 2] = add[v] - tr + mid;
	t[v * 2] = max(t[v * 2], add[v * 2]);
	t[v * 2 + 1] = max(t[v * 2 + 1], add[v * 2 + 1]);
	add[v] = 0;
}

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] = x + (tr - lg);
		push(v, tl, tr);
		return;
	}
	//cout << tl <<"-" << tr << endl;
	int mid = (tl + tr) >> 1;
	update(v * 2, tl, mid);
	update(v * 2 + 1, mid + 1, tr);
	//t[v] = max(t[v * 2], t[v * 2 + 1]);
}
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++){
		lg = i, rg = i;
		cout << ans[i] <<" ";
	}
}
    

Compilation message

trading.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -