Submission #1118079

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118079		vjudge1	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	30 / 100	1052 ms	5368 KiB

foehn_phenomena

#include <bits/stdc++.h>
#define F first
#define S second
#define LL long long
 
#define rep(i, x) for(auto &i : (x))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
#define left(x) ((x)<<1)
#define right(x) ((x)>>1)
#define LSOne(x) (x & -(x))
 
using namespace std;
using T = pair<pair<int, int>, int>;
 
const int SZ = 2e5 + 1;
const LL MOD = 1e9 + 7; 
const LL INF = 1e18 + 1;
 
LL bp (LL b, LL e, LL m = MOD) {
 if ( e == 0 ) return 1;
 LL T = bp(b, e / 2);
 T *= T; T %= m;
 if ( e & 1 ) T *= b;
 return T %= m;
}
 
LL nv_i (LL a) { return bp(a, MOD - 2); };
LL gcd (LL a, LL b) { return (b == 0 ? a : gcd(b, a % b)); }
LL lcm(LL a, LL b) { return (a * (b / gcd(a, b))); }
LL ceil (LL a, LL b) { return ((a + b - 1) / b); }
 
void solve() {
  int n, q, s, t;
  cin >> n >> q >> s >> t;

  vector<LL> V(n + 2);
  vector<LL> V_1(n + 2);

  for(int i = 0; i <= n; i ++) {
    cin >> V[i];
  }

  for(int i = 0; i < q; i ++) {
    LL wing = 0;
    int L, R;
    LL val;
    cin >> L >> R >> val;
      
    for(int i = 1; i <= n; i ++) {
      if(i >= L && i <= R)
        V[i] += val;
     
      if(V[i] > V[i - 1]) {
        wing -= ((abs(V[i] - V[i - 1])) * s);
      }
      else
        wing += ((abs(V[i] - V[i - 1])) * t);
    }

      cout << wing << "\n";
  }
}
 
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
 
  solve();
  return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 10
• Subtask 3: 0 / 60