oj.uz

Submission #682319

# Submission time Handle Problem Language Result Execution time Memory
682319 2023-01-16T06:20:11 Z smartmonky Trading (IZhO13_trading) C++14
0 / 100
 272 ms 21228 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]);
	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:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   47 | main(){
      | ^~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 3 ms 468 KB Output is correct
7 Correct 137 ms 14536 KB Output is correct
8 Correct 150 ms 15068 KB Output is correct
9 Correct 169 ms 15016 KB Output is correct
10 Correct 219 ms 14784 KB Output is correct
11 Correct 220 ms 15612 KB Output is correct
12 Correct 219 ms 15380 KB Output is correct
13 Correct 272 ms 15720 KB Output is correct
14 Correct 213 ms 15520 KB Output is correct
15 Correct 246 ms 16016 KB Output is correct
16 Correct 268 ms 15832 KB Output is correct
17 Incorrect 251 ms 21228 KB Output isn't correct
18 Halted 0 ms 0 KB -