oj.uz

Submission #364998

# Submission time Handle Problem Language Result Execution time Memory
364998 2021-02-10T17:36:23 Z farhan132 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 133 ms 9068 KB 
/***Farhan132***/

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vi;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)
#define clean fflush(stdout)

const ll mod =  (ll)1e9 + 7;
const ll maxn = (ll)2e5 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
//const ll INF = 1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};



void solve(){

    ll n , q , s , t;
    cin >> n >> q >> s >> t;
    ll d[n+5] , a[n+5];
    f0(n+1) cin >> a[i];
    ll cur = 0;
    for(ll i = 1; i <= n; i++){
        d[i] = a[i] - a[i-1];
        if(a[i] > a[i-1]) cur -= (a[i] - a[i-1]) * s;
        else cur += (a[i-1] - a[i]) * t;
    }
    while(q--){
        ll l , r , x;
        cin >> l >> r >> x;
        ll sv = cur;
        if(d[l] > 0) cur += s * abs(d[l]);
        else cur -= t * abs(d[l]);
        d[l] += x;
        if(d[l] > 0) cur -= abs(d[l]) * s;
        else cur += abs(d[l]) * t;
        if(r+1 <= n){
          r++;
          if(d[r] > 0) cur += s * abs(d[r]);
          else cur -= t * abs(d[r]);
          d[r] -= x;
          if(d[r] > 0) cur -= abs(d[r]) * s;
          else cur += abs(d[r]) * t;
        }
        cout << cur << '\n';
    }
    
    return;
    
}

 
int main() {
    
    
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #else 
     //   freopen("cbarn2.in", "r", stdin);
     //   freopen("cbarn2.out", "w", stdout);
     ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
    //cout << fixed << setprecision(10);
   // work(maxn);
    //  mem(b,0);
    ll T;
    T=1;
    //cin >> T; 
    //scanf("%lld",&T);
   // ll CT = 0;
    //work();
    while(T--){
        //cout << "Case " << ++CT <<": " ;
        //printf("Case %lld: ",++CT);
        solve();
    }
 
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void solve()':
foehn_phenomena.cpp:66:12: warning: unused variable 'sv' [-Wunused-variable]
   66 |         ll sv = cur;
      |            ^~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 392 KB Output is correct
21 Correct 0 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 6636 KB Output is correct
2 Correct 117 ms 7276 KB Output is correct
3 Correct 116 ms 7788 KB Output is correct
4 Correct 114 ms 6892 KB Output is correct
5 Correct 116 ms 7788 KB Output is correct
6 Correct 99 ms 8172 KB Output is correct
7 Correct 101 ms 8044 KB Output is correct
8 Correct 124 ms 8100 KB Output is correct
9 Correct 128 ms 8428 KB Output is correct
10 Correct 117 ms 7248 KB Output is correct
11 Correct 93 ms 8172 KB Output is correct
12 Correct 101 ms 8556 KB Output is correct
13 Correct 113 ms 9068 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 392 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 118 ms 6636 KB Output is correct
23 Correct 117 ms 7276 KB Output is correct
24 Correct 116 ms 7788 KB Output is correct
25 Correct 114 ms 6892 KB Output is correct
26 Correct 116 ms 7788 KB Output is correct
27 Correct 99 ms 8172 KB Output is correct
28 Correct 101 ms 8044 KB Output is correct
29 Correct 124 ms 8100 KB Output is correct
30 Correct 128 ms 8428 KB Output is correct
31 Correct 117 ms 7248 KB Output is correct
32 Correct 93 ms 8172 KB Output is correct
33 Correct 101 ms 8556 KB Output is correct
34 Correct 113 ms 9068 KB Output is correct
35 Correct 114 ms 6764 KB Output is correct
36 Correct 126 ms 8112 KB Output is correct
37 Correct 133 ms 8940 KB Output is correct
38 Correct 123 ms 8684 KB Output is correct
39 Correct 118 ms 8684 KB Output is correct
40 Correct 123 ms 8684 KB Output is correct
41 Correct 123 ms 8556 KB Output is correct
42 Correct 125 ms 8684 KB Output is correct
43 Correct 114 ms 7916 KB Output is correct
44 Correct 124 ms 8428 KB Output is correct
45 Correct 132 ms 8292 KB Output is correct
46 Correct 123 ms 8752 KB Output is correct
47 Correct 101 ms 8684 KB Output is correct
48 Correct 105 ms 9068 KB Output is correct
49 Correct 104 ms 7916 KB Output is correct
50 Correct 98 ms 8684 KB Output is correct
51 Correct 99 ms 8940 KB Output is correct
52 Correct 98 ms 8684 KB Output is correct