제출 #51473

#제출 시각아이디문제언어결과실행 시간메모리
51473kotorinFoehn Phenomena (JOI17_foehn_phenomena)C++17
0 / 100
126 ms4144 KiB
#include <iostream> int A[200001]; int chk[200001]; int sum = 0; int n, q, s, t; inline int calc(int x) { return (x < 0 ? x * s : x * t); } signed main() { // freopen("foehn.inp", "r", stdin); // Fast I/O std::cin.tie(0); std::cout.tie(0); std::ios_base::sync_with_stdio(false); std::cin >> n >> q >> s >> t; for (int i = 0; i <= n; ++i) { std::cin >> A[i]; } for (int i = 1; i <= n; ++i) { chk[i] = A[i - 1] - A[i]; sum += calc(chk[i]); } while (q-- > 0) { int l, r, x; std::cin >> l >> r >> x; if (l > 0) { sum -= calc(chk[l]); chk[l] -= x; sum += calc(chk[l]); } if (r < n) { sum -= calc(chk[r + 1]); chk[r + 1] += x; sum += calc(chk[r + 1]); } std::cout << sum << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...