oj.uz

Submission #783722

# Submission time Handle Problem Language Result Execution time Memory
783722 2023-07-15T08:59:21 Z kebine Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 84 ms 7256 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define TC int t; cin>>t; while(t--)
#define all(x) (x).begin(),(x).end()
//*AC BERSAMA ALLAH  FORTIS FORTUNA ADIUVAT

ll n,q,s,t;
vector<ll> v, dif;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin>>n>>q>>s>>t;
    v.resize(n+5);
    dif.resize(n+5);

    ll sneg=0, spos=0, val=0; // stored in positive
    for(int i=0;i<=n;i++){
        cin>>v[i];
        if(i>0){
            dif[i] = v[i]-v[i-1];
            if(dif[i]<=0) sneg += (dif[i]*-1);
            else spos += dif[i];
        }
    }

    // val = sneg * t - spos * s;
    // cout<<"::"<<spos<<"--"<<sneg<<'\n';
    // cout<<"=="<<val<<'\n';

    for(int i=1;i<=q;i++){
        ll l,r,x;
        cin>>l>>r>>x;
        
        if(dif[l]<=0) sneg += dif[l];
        else spos -= dif[l];

        if(r==n);
        else if(dif[r+1]<=0) sneg += dif[r+1];
        else spos -= dif[r+1];
        // cout<<"::"<<spos<<"--"<<sneg<<'\n';

        dif[l] += x;
        dif[r+1] -= x;
        if(dif[l]<=0) sneg -= dif[l];
        else spos += dif[l];

        if(r==n);
        else if(dif[r+1]<=0) sneg -= dif[r+1];
        else spos += dif[r+1];
        // cout<<"::"<<spos<<"--"<<sneg<<'\n';

        val = sneg * t - spos * s;
        cout<<val<<'\n';
        // cout<<val<<'\n';
    }

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 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 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 4772 KB Output is correct
2 Correct 72 ms 5432 KB Output is correct
3 Correct 75 ms 5968 KB Output is correct
4 Correct 70 ms 5196 KB Output is correct
5 Correct 74 ms 5928 KB Output is correct
6 Correct 64 ms 6380 KB Output is correct
7 Correct 65 ms 6292 KB Output is correct
8 Correct 74 ms 6272 KB Output is correct
9 Correct 75 ms 6700 KB Output is correct
10 Correct 84 ms 5312 KB Output is correct
11 Correct 62 ms 6404 KB Output is correct
12 Correct 66 ms 6768 KB Output is correct
13 Correct 61 ms 7176 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 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 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 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 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 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 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 71 ms 4772 KB Output is correct
23 Correct 72 ms 5432 KB Output is correct
24 Correct 75 ms 5968 KB Output is correct
25 Correct 70 ms 5196 KB Output is correct
26 Correct 74 ms 5928 KB Output is correct
27 Correct 64 ms 6380 KB Output is correct
28 Correct 65 ms 6292 KB Output is correct
29 Correct 74 ms 6272 KB Output is correct
30 Correct 75 ms 6700 KB Output is correct
31 Correct 84 ms 5312 KB Output is correct
32 Correct 62 ms 6404 KB Output is correct
33 Correct 66 ms 6768 KB Output is correct
34 Correct 61 ms 7176 KB Output is correct
35 Correct 72 ms 4916 KB Output is correct
36 Correct 74 ms 6352 KB Output is correct
37 Correct 81 ms 7168 KB Output is correct
38 Correct 76 ms 7068 KB Output is correct
39 Correct 81 ms 7044 KB Output is correct
40 Correct 79 ms 7004 KB Output is correct
41 Correct 77 ms 6792 KB Output is correct
42 Correct 77 ms 6988 KB Output is correct
43 Correct 75 ms 6192 KB Output is correct
44 Correct 74 ms 6660 KB Output is correct
45 Correct 77 ms 6452 KB Output is correct
46 Correct 73 ms 7072 KB Output is correct
47 Correct 72 ms 7000 KB Output is correct
48 Correct 66 ms 7256 KB Output is correct
49 Correct 66 ms 6252 KB Output is correct
50 Correct 62 ms 7036 KB Output is correct
51 Correct 63 ms 7016 KB Output is correct
52 Correct 61 ms 7016 KB Output is correct