oj.uz

답안 #885507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885507 2023-12-09T22:02:05 Z vjudge1 Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 1000 ms 11128 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
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);
	}
};
 
 
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 u=0,d=0;
    for(int i=1; i<=n; i++)
    {
        u+=max(cad[i]-cad[i-1],0LL);
        d+=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++;
        u-=max(asd.query(a)-asd.query(a-1),0);
        d-=max(asd.query(a-1)-asd.query(a),0);
        if(b!=n+1){
        u-=max(asd.query(b+1)-asd.query(b),0);
        d-=max(asd.query(b)-asd.query(b+1),0);}

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

Compilation message

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

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 8 ms 548 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 10 ms 604 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 12 ms 536 KB Output is correct
8 Correct 8 ms 352 KB Output is correct
9 Correct 8 ms 352 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 6 ms 352 KB Output is correct
14 Correct 6 ms 352 KB Output is correct
15 Correct 8 ms 540 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 360 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 0 ms 352 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 982 ms 7540 KB Output is correct
2 Execution timed out 1006 ms 11128 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 8 ms 548 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 10 ms 604 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 12 ms 536 KB Output is correct
8 Correct 8 ms 352 KB Output is correct
9 Correct 8 ms 352 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 344 KB Output is correct
13 Correct 6 ms 352 KB Output is correct
14 Correct 6 ms 352 KB Output is correct
15 Correct 8 ms 540 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 360 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 0 ms 352 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 982 ms 7540 KB Output is correct
23 Execution timed out 1006 ms 11128 KB Time limit exceeded
24 Halted 0 ms 0 KB -