oj.uz

Submission #877259

# Submission time Handle Problem Language Result Execution time Memory
877259 2023-11-23T05:03:12 Z hasan2006 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 459 ms 34260 KB 
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll   a[N] = {}, b[N] , c[N] , d[N] , tree[2 * N] , lz[2 * N];


void lazzy(int i , int l , int r){
    tree[i] += lz[i] * (r - l + 1);
    lz[2 * i] += lz[i];
    lz[2 * i + 1] += lz[i];
    lz[i] = 0;
}

ll ind;
void get(int i , int l , int r , int x , int y ,int k){
    int m = (l + r) / 2;
    if(x > r || y < l){
        return;
    }
    lazzy(i , l,  r);
    if(l >= x && r <= y){
        tree[i] += (r - l + 1) * k;
        ind = tree[i];
        lz[2 * i] += k;
        lz[2 * i + 1] += k;
        return;
    }
    get(2 * i , l ,  m , x , y , k);
    get(2 * i + 1 , m + 1 , r , x , y , k);
    tree[i] = tree[2 * i] + tree[2 * i + 1];
}

void solve()
{
    ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m>>x>>y;
    for(i = 0; i <= n; i++){
        cin>>a[i];
        if(i > 1)
            b[i - 1] = b[i - 2] , c[i - 1] = c[i - 2];
        if(i && a[i] >= a[i - 1]){
            s -= abs(a[i] - a[i - 1]) * x;
            b[i - 1]++;
        }else {
            s += abs(a[i] - a[i - 1]) * y;
            c[i - 1]++;
        }
    }
    while(m--){
        cin>>l>>r>>k;
        vector<ll>v;
        get(1 , 1 , n , l, r , k);
        if(l == 1)
            v.pb(0);
        else {
            get(1 , 1  , n , l - 1, l - 1 , 0);
            v.pb(ind + a[l - 1]);
        }
        get(1 , 1 , n , l, l , 0);
        v.pb(ind + a[l]);
        get(1 , 1 , n , r, r , 0);
        v.pb(ind + a[r]);
        if(r != n){
            get(1 , 1 , n , r + 1, r  + 1, 0);
            v.pb(ind + a[r + 1]);
        }
        if(v[0] <= (v[1] - k)){
            s += abs((v[1] - k) - v[0]) * x;
        }else {
            s -= abs((v[1] - k) - v[0]) * y;
        }
        if(v[0] <= v[1]){
            s -= abs(v[1] - v[0]) * x;
        }else {
            s += abs(v[1] - v[0]) * y;
        }
        if(r < n){
            if((v[2] - k) <= v[3]){
                s += abs(v[3] - (v[2] - k)) * x;
            }else {
                s -= abs(v[3] - (v[2] - k)) * y;
            }
            if(v[2] <= v[3]){
                s -= abs(v[3] - v[2]) * x;
            }else {
                s += abs(v[3] - v[2]) * y;
            }
        }
        cout<<s<<"\n";
    }
}

int main(){
    TL;
int t = 1;
//cin>>t;
while(t--)
     {
     solve();
     }
}
// Author : حسن

Compilation message

foehn_phenomena.cpp: In function 'void solve()':
foehn_phenomena.cpp:53:8: warning: unused variable 'q' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
foehn_phenomena.cpp:53:16: warning: unused variable 'j' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                ^
foehn_phenomena.cpp:53:26: warning: unused variable 'z' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                          ^
foehn_phenomena.cpp:53:37: warning: unused variable 'f' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                     ^
foehn_phenomena.cpp:53:60: warning: unused variable 'mn' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                            ^~
foehn_phenomena.cpp:53:73: warning: unused variable 'mx' [-Wunused-variable]
   53 |     ll q , i , j , m ,n, z ,s = 0 , f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                                         ^~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 4 ms 8796 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 5 ms 8784 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 4 ms 8796 KB Output is correct
12 Correct 3 ms 6748 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 3 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 3 ms 8716 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8544 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 26648 KB Output is correct
2 Correct 407 ms 26520 KB Output is correct
3 Correct 415 ms 27728 KB Output is correct
4 Correct 412 ms 27196 KB Output is correct
5 Correct 380 ms 26960 KB Output is correct
6 Correct 161 ms 24132 KB Output is correct
7 Correct 145 ms 23712 KB Output is correct
8 Correct 347 ms 27472 KB Output is correct
9 Correct 380 ms 27732 KB Output is correct
10 Correct 343 ms 26720 KB Output is correct
11 Correct 259 ms 23936 KB Output is correct
12 Correct 146 ms 24552 KB Output is correct
13 Correct 224 ms 24660 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 3 ms 6748 KB Output is correct
4 Correct 3 ms 6748 KB Output is correct
5 Correct 3 ms 6748 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 4 ms 8796 KB Output is correct
8 Correct 4 ms 8796 KB Output is correct
9 Correct 5 ms 8784 KB Output is correct
10 Correct 3 ms 6748 KB Output is correct
11 Correct 4 ms 8796 KB Output is correct
12 Correct 3 ms 6748 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 6488 KB Output is correct
15 Correct 3 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 3 ms 8716 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8544 KB Output is correct
22 Correct 429 ms 26648 KB Output is correct
23 Correct 407 ms 26520 KB Output is correct
24 Correct 415 ms 27728 KB Output is correct
25 Correct 412 ms 27196 KB Output is correct
26 Correct 380 ms 26960 KB Output is correct
27 Correct 161 ms 24132 KB Output is correct
28 Correct 145 ms 23712 KB Output is correct
29 Correct 347 ms 27472 KB Output is correct
30 Correct 380 ms 27732 KB Output is correct
31 Correct 343 ms 26720 KB Output is correct
32 Correct 259 ms 23936 KB Output is correct
33 Correct 146 ms 24552 KB Output is correct
34 Correct 224 ms 24660 KB Output is correct
35 Correct 404 ms 26584 KB Output is correct
36 Correct 420 ms 27308 KB Output is correct
37 Correct 434 ms 33580 KB Output is correct
38 Correct 413 ms 33576 KB Output is correct
39 Correct 412 ms 34260 KB Output is correct
40 Correct 423 ms 33504 KB Output is correct
41 Correct 408 ms 33876 KB Output is correct
42 Correct 431 ms 33976 KB Output is correct
43 Correct 459 ms 32716 KB Output is correct
44 Correct 375 ms 33104 KB Output is correct
45 Correct 422 ms 33744 KB Output is correct
46 Correct 458 ms 33988 KB Output is correct
47 Correct 150 ms 28496 KB Output is correct
48 Correct 245 ms 28504 KB Output is correct
49 Correct 381 ms 32336 KB Output is correct
50 Correct 257 ms 29176 KB Output is correct
51 Correct 153 ms 29364 KB Output is correct
52 Correct 317 ms 31316 KB Output is correct