oj.uz

Submission #885512

# Submission time Handle Problem Language Result Execution time Memory
885512 2023-12-09T22:12:46 Z Marco_Escandon Foehn Phenomena (JOI17_foehn_phenomena) C++11
30 / 100
 1000 ms 12640 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
struct Segment_tree
{
	struct node
	{
		int value, lazy;
 
		node(int v = 0)
		{
			value = v;
			lazy = 0;
		}
	};
 
	vector <node> tree; int l;
 
	void update(int v, int s, int e, int k)
	{
		tree[v].lazy += k;
		tree[v].value += (e - s + 1) * k;
	}
 
	void push(int v, int s, int e)
	{
		if (tree[v].lazy)
		{
			int middle = (s + e) / 2;
 
			update(2 * v, s, middle, tree[v].lazy);
			update(2 * v + 1, middle + 1, e, tree[v].lazy);
 
			tree[v].lazy = 0;
		}
	}
 
	void increase(int node, int v, int x, int y, int s, int e)
	{
		if (x > e || y < s) return;
 
		if (s >= x && e <= y)
		{
			update(node, s, e, v);
			return;
		}
 
		push(node, s, e);
 
		int middle = (s + e) / 2;
 
		increase(node * 2, v, x, y, s, middle);
		increase(node * 2 + 1, v, x, y, middle + 1, e);
 
		tree[node].value = tree[node * 2].value
			+ tree[node * 2 + 1].value;
	}
 
	void increase(int x, int y, int v) { increase(1, v, x, y, 1, l); }
 
	int sum(int node, int x, int y, int s, int e)
	{
		if (x > e || y < s) return 0;
 
		if (s >= x && e <= y)
			return tree[node].value;
 
		push(node, s, e);
		int middle = (s + e) / 2;
 
		return sum(node * 2, x, y, s, middle) +
			sum(node * 2 + 1, x, y, middle + 1, e);
	}
 
	int query(int x) { return sum(1, x, x, 1, l); }
 
	Segment_tree(int n)
	{
		for (l = 1; l < n; l = (l << 1));
		tree.resize(2 * l);
	}
};
 
 
int32_t main()
{
    ll n,q,s,t;
    cin>>n>>q>>s>>t;
    ll cad[n+1];
    Segment_tree asd(n+2);
    for(int i=0; i<n+1; i++)
    {
        cin>>cad[i];
    }
    ll sol=0;
    for(int i=1; i<=n; i++)
    {
        sol-=s*max(cad[i]-cad[i-1],0LL);
        sol+=t*max(cad[i-1]-cad[i],0LL);
        asd.increase(i+1,i+1,cad[i]);
    }
    while(q--)
    {
        ll a,b,c;
        cin>>a>>b>>c;
        a++;
        b++;
        sol+=s*max(asd.query(a)-asd.query(a-1),0LL);
        sol-=t*max(asd.query(a-1)-asd.query(a),0LL);
        if(b!=n+1){
        sol+=s*max(asd.query(b+1)-asd.query(b),0LL);
        sol-=t*max(asd.query(b)-asd.query(b+1),0LL);}

        asd.increase(a,b,c);
        
        sol-=s*max(asd.query(a)-asd.query(a-1),0LL);
        sol+=t*max(asd.query(a-1)-asd.query(a),0LL);
        if(b!=n+1){
        sol-=s*max(asd.query(b+1)-asd.query(b),0LL);
        sol+=t*max(asd.query(b)-asd.query(b+1),0LL);}
        cout<<sol<<"\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 608 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 780 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 516 KB Output is correct
12 Correct 8 ms 508 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 6 ms 520 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 966 ms 11472 KB Output is correct
2 Correct 970 ms 12412 KB Output is correct
3 Correct 967 ms 12640 KB Output is correct
4 Execution timed out 1030 ms 11988 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 608 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 8 ms 348 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 780 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 516 KB Output is correct
12 Correct 8 ms 508 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 8 ms 344 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Correct 6 ms 520 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 966 ms 11472 KB Output is correct
23 Correct 970 ms 12412 KB Output is correct
24 Correct 967 ms 12640 KB Output is correct
25 Execution timed out 1030 ms 11988 KB Time limit exceeded
26 Halted 0 ms 0 KB -