oj.uz

답안 #654529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654529 2022-10-31T15:48:29 Z hail Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 126 ms 13064 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define vi vector<int>
#define vll vector<long long>
#define pb push_back
using ll= long long;
#define fast_io ios::sync_with_stdio(0); cin.tie(0)
#define inpint(x) int x; cin>>x
#define inpll(x) long long x; cin>>x
#define fl(i, n) for(int i=0; i<n; i++)
#define flo(i, n) for(int i=1; i<=n; i++)
#define int long long 
#define pi pair<int, int>
#define mp make_pair
#define ld long double

const int MOD = 7 + (int)1e9;
const int INF = (int)1e18;

//

void solve()
{
    int n, q, s, t;
    cin>>n>>q>>s>>t;

    vector<int> a(n+1, 0);
    vector<int> d(n+1, 0); // a[i+1] - a[i]

    int ans = 0;

    for(int i = 0; i<=n; i++)
    {
        cin>>a[i];
    }
    for(int i=0; i<n; i++)
    {
        d[i] = a[i+1] - a[i];
        if(d[i]>=0) ans -= d[i]*s;
        else ans -= d[i]*t;
    }

    for(int i=1; i<=q; i++)
    {
        int l, r, x;
        cin>>l>>r>>x;


        if(l!=0)
        {
            if(d[l-1]<0) ans += d[l-1]*t;
            else ans += s*d[l-1];
            d[l-1] += x;
            if(d[l-1]>=0) ans -= d[l-1]*s;
            else ans -= d[l-1]*t;
        }
        if(r!=n)
        {
            if(d[r]<0) ans += d[r]*t;
            else ans += d[r]*s;
            d[r] -= x;
            if(d[r]>=0) ans -= d[r]*s;
            else ans -= d[r]*t;            
        }

        cout<<ans<<"\n";
    }


}

signed main()
{
    fast_io;

    int t=1; 
    //cin>>t;
    while(t--)
    {
        solve();
    }
    cout<<endl;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 10364 KB Output is correct
2 Correct 112 ms 10868 KB Output is correct
3 Correct 99 ms 11508 KB Output is correct
4 Correct 113 ms 10844 KB Output is correct
5 Correct 112 ms 12028 KB Output is correct
6 Correct 79 ms 11084 KB Output is correct
7 Correct 88 ms 10944 KB Output is correct
8 Correct 126 ms 11852 KB Output is correct
9 Correct 98 ms 12188 KB Output is correct
10 Correct 106 ms 10816 KB Output is correct
11 Correct 86 ms 10848 KB Output is correct
12 Correct 78 ms 11628 KB Output is correct
13 Correct 88 ms 11852 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 328 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 408 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 404 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 103 ms 10364 KB Output is correct
23 Correct 112 ms 10868 KB Output is correct
24 Correct 99 ms 11508 KB Output is correct
25 Correct 113 ms 10844 KB Output is correct
26 Correct 112 ms 12028 KB Output is correct
27 Correct 79 ms 11084 KB Output is correct
28 Correct 88 ms 10944 KB Output is correct
29 Correct 126 ms 11852 KB Output is correct
30 Correct 98 ms 12188 KB Output is correct
31 Correct 106 ms 10816 KB Output is correct
32 Correct 86 ms 10848 KB Output is correct
33 Correct 78 ms 11628 KB Output is correct
34 Correct 88 ms 11852 KB Output is correct
35 Correct 111 ms 10348 KB Output is correct
36 Correct 105 ms 11752 KB Output is correct
37 Correct 114 ms 12544 KB Output is correct
38 Correct 112 ms 12384 KB Output is correct
39 Correct 105 ms 12364 KB Output is correct
40 Correct 113 ms 12368 KB Output is correct
41 Correct 117 ms 12272 KB Output is correct
42 Correct 108 ms 12280 KB Output is correct
43 Correct 113 ms 11596 KB Output is correct
44 Correct 101 ms 12132 KB Output is correct
45 Correct 106 ms 12060 KB Output is correct
46 Correct 113 ms 13064 KB Output is correct
47 Correct 80 ms 11628 KB Output is correct
48 Correct 96 ms 11696 KB Output is correct
49 Correct 102 ms 10724 KB Output is correct
50 Correct 85 ms 11504 KB Output is correct
51 Correct 77 ms 11848 KB Output is correct
52 Correct 92 ms 11632 KB Output is correct