oj.uz

Submission #396540

# Submission time Handle Problem Language Result Execution time Memory
396540 2021-04-30T09:01:22 Z giorgikob Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 808 ms 20296 KB 
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

const int N = 2e5+50, mod = 1e9+7, K = 31;

int n,q,l,r,x;
ll L[N*4],R[N*4],A[N];
ll s,t;
ll sum[N*4],toadd[N*4];

inline void lazy(int node,int tl,int tr){
    int mid = (tl+tr)/2;
    int left = node*2;
    int right = node*2+1;
    //sum[left] += (mid-tl+1)*toadd[node];
    //sum[right] += (tr-mid)*toadd[node];
    L[left] += toadd[node]; R[left] += toadd[node];
    L[right] += toadd[node]; R[right] += toadd[node];
    toadd[left] += toadd[node];
    toadd[right] += toadd[node];
    toadd[node] = 0;
}

inline void merge(int node,int left,int right){
    L[node] = L[left];
    R[node] = R[right];
    ll x = 0, y = 0;
    if(R[left] < L[right]) x = s*(R[left]-L[right]); else
                           x = t*(R[left]-L[right]);
    sum[node] = sum[left]+sum[right]+x;
}

inline void upd(int node,int tl,int tr,int l,int r,int val){
    if(l > tr || tl > r) return ;
    if(tl == tr){
        L[node] += val;
        R[node] += val;
        return ;
    }
    if(l <= tl && tr <= r){
        //sum[node] += val*(tr-tl+1);
        toadd[node] += val;
        L[node] += val;
        R[node] += val;
        return ;
    }

    int mid = (tl+tr)/2;
    int left = node*2;
    int right = node*2+1;

    if(toadd[node]) lazy(node,tl,tr);

    upd(left,tl,mid,l,r,val);
    upd(right,mid+1,tr,l,r,val);

    merge(node,left,right);
}

inline void test_case(){

    cin >> n >> q >> s >> t;

    for(int i = 0; i <= n; i++){
        cin >> A[i];
        upd(1,0,n,i,i,A[i]);
    }

    while(q--){
        cin >> l >> r >> x;
        upd(1,0,n,l,r,x);
        cout << sum[1] << endl;
    }
}
 main(){
    ios::sync_with_stdio(0);

    int T = 1;
    //cin >> T;
    while(T--){
        test_case();
    }
}

Compilation message

foehn_phenomena.cpp: In function 'void lazy(int, int, int)':
foehn_phenomena.cpp:16:9: warning: unused variable 'mid' [-Wunused-variable]
   16 |     int mid = (tl+tr)/2;
      |         ^~~
foehn_phenomena.cpp: In function 'void merge(int, int, int)':
foehn_phenomena.cpp:31:15: warning: unused variable 'y' [-Wunused-variable]
   31 |     ll x = 0, y = 0;
      |               ^
foehn_phenomena.cpp: At global scope:
foehn_phenomena.cpp:79:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   79 |  main(){
      |       ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 6 ms 500 KB Output is correct
3 Correct 6 ms 460 KB Output is correct
4 Correct 6 ms 460 KB Output is correct
5 Correct 6 ms 500 KB Output is correct
6 Correct 7 ms 516 KB Output is correct
7 Correct 6 ms 460 KB Output is correct
8 Correct 6 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 6 ms 460 KB Output is correct
11 Correct 6 ms 500 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 5 ms 460 KB Output is correct
18 Correct 6 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 280 KB Output is correct
21 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 789 ms 17904 KB Output is correct
2 Correct 791 ms 18472 KB Output is correct
3 Correct 798 ms 19140 KB Output is correct
4 Correct 792 ms 18100 KB Output is correct
5 Correct 767 ms 18944 KB Output is correct
6 Correct 550 ms 15452 KB Output is correct
7 Correct 550 ms 15428 KB Output is correct
8 Correct 716 ms 19456 KB Output is correct
9 Correct 726 ms 19724 KB Output is correct
10 Correct 726 ms 18332 KB Output is correct
11 Correct 557 ms 15264 KB Output is correct
12 Correct 543 ms 15696 KB Output is correct
13 Correct 532 ms 16208 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 6 ms 500 KB Output is correct
3 Correct 6 ms 460 KB Output is correct
4 Correct 6 ms 460 KB Output is correct
5 Correct 6 ms 500 KB Output is correct
6 Correct 7 ms 516 KB Output is correct
7 Correct 6 ms 460 KB Output is correct
8 Correct 6 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 6 ms 460 KB Output is correct
11 Correct 6 ms 500 KB Output is correct
12 Correct 6 ms 460 KB Output is correct
13 Correct 5 ms 460 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 5 ms 460 KB Output is correct
18 Correct 6 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 280 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 789 ms 17904 KB Output is correct
23 Correct 791 ms 18472 KB Output is correct
24 Correct 798 ms 19140 KB Output is correct
25 Correct 792 ms 18100 KB Output is correct
26 Correct 767 ms 18944 KB Output is correct
27 Correct 550 ms 15452 KB Output is correct
28 Correct 550 ms 15428 KB Output is correct
29 Correct 716 ms 19456 KB Output is correct
30 Correct 726 ms 19724 KB Output is correct
31 Correct 726 ms 18332 KB Output is correct
32 Correct 557 ms 15264 KB Output is correct
33 Correct 543 ms 15696 KB Output is correct
34 Correct 532 ms 16208 KB Output is correct
35 Correct 777 ms 17892 KB Output is correct
36 Correct 782 ms 19668 KB Output is correct
37 Correct 781 ms 20296 KB Output is correct
38 Correct 803 ms 19992 KB Output is correct
39 Correct 791 ms 20036 KB Output is correct
40 Correct 808 ms 20164 KB Output is correct
41 Correct 798 ms 20056 KB Output is correct
42 Correct 795 ms 19976 KB Output is correct
43 Correct 781 ms 19268 KB Output is correct
44 Correct 793 ms 19704 KB Output is correct
45 Correct 789 ms 19524 KB Output is correct
46 Correct 780 ms 20072 KB Output is correct
47 Correct 550 ms 15848 KB Output is correct
48 Correct 533 ms 16044 KB Output is correct
49 Correct 752 ms 19176 KB Output is correct
50 Correct 561 ms 15940 KB Output is correct
51 Correct 543 ms 15960 KB Output is correct
52 Correct 601 ms 15912 KB Output is correct