oj.uz

답안 #735289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735289 2023-05-03T20:32:13 Z tigar Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 112 ms 17828 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll n, q, s, t;
ll a[200020], l[200020], r[200020], x[200020], diff[200020];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin>>n>>q>>s>>t;
    for(int i=0; i<=n; i++)
    {
        cin>>a[i];
        diff[i]=a[i]-a[max(i-1, 0)];
    }
    for(int i=0; i<q; i++)cin>>l[i]>>r[i]>>x[i];

    ll windspid=0;
    for(int i=1; i<=n; i++)
    {
        if(diff[i]>0)windspid-=s*diff[i];
        else windspid-=t*diff[i];
    }

    for(int i=0; i<q; i++)
    {
        if(diff[l[i]]>0)windspid+=s*diff[l[i]];
        else windspid+=t*diff[l[i]];

        diff[l[i]]+=x[i];

        if(diff[l[i]]>0)windspid-=s*diff[l[i]];
        else windspid-=t*diff[l[i]];

        if(r[i]<n)
        {
            if(diff[r[i]+1]>0)windspid+=s*diff[r[i]+1];
            else windspid+=t*diff[r[i]+1];

            diff[r[i]+1]-=x[i];

            if(diff[r[i]+1]>0)windspid-=s*diff[r[i]+1];
            else windspid-=t*diff[r[i]+1];
        }
        cout<<windspid<<"\n";
    }
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 9536 KB Output is correct
2 Correct 96 ms 10180 KB Output is correct
3 Correct 95 ms 10708 KB Output is correct
4 Correct 84 ms 9944 KB Output is correct
5 Correct 93 ms 10620 KB Output is correct
6 Correct 84 ms 11008 KB Output is correct
7 Correct 79 ms 11032 KB Output is correct
8 Correct 89 ms 10956 KB Output is correct
9 Correct 108 ms 11280 KB Output is correct
10 Correct 88 ms 10020 KB Output is correct
11 Correct 76 ms 11284 KB Output is correct
12 Correct 81 ms 11420 KB Output is correct
13 Correct 83 ms 16572 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 94 ms 9536 KB Output is correct
23 Correct 96 ms 10180 KB Output is correct
24 Correct 95 ms 10708 KB Output is correct
25 Correct 84 ms 9944 KB Output is correct
26 Correct 93 ms 10620 KB Output is correct
27 Correct 84 ms 11008 KB Output is correct
28 Correct 79 ms 11032 KB Output is correct
29 Correct 89 ms 10956 KB Output is correct
30 Correct 108 ms 11280 KB Output is correct
31 Correct 88 ms 10020 KB Output is correct
32 Correct 76 ms 11284 KB Output is correct
33 Correct 81 ms 11420 KB Output is correct
34 Correct 83 ms 16572 KB Output is correct
35 Correct 88 ms 15116 KB Output is correct
36 Correct 110 ms 16460 KB Output is correct
37 Correct 96 ms 17308 KB Output is correct
38 Correct 112 ms 17084 KB Output is correct
39 Correct 105 ms 17088 KB Output is correct
40 Correct 93 ms 17112 KB Output is correct
41 Correct 96 ms 16972 KB Output is correct
42 Correct 101 ms 17024 KB Output is correct
43 Correct 108 ms 16264 KB Output is correct
44 Correct 95 ms 16744 KB Output is correct
45 Correct 94 ms 16764 KB Output is correct
46 Correct 93 ms 17828 KB Output is correct
47 Correct 84 ms 16324 KB Output is correct
48 Correct 87 ms 16332 KB Output is correct
49 Correct 102 ms 15496 KB Output is correct
50 Correct 83 ms 16168 KB Output is correct
51 Correct 101 ms 16556 KB Output is correct
52 Correct 81 ms 16372 KB Output is correct