제출 #1166227

#제출 시각아이디문제언어결과실행 시간메모리
1166227GoBananas69Foehn Phenomena (JOI17_foehn_phenomena)C++20
0 / 100
1095 ms1232 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> typedef long long ll; using namespace std; signed main() { cin.tie() -> sync_with_stdio(0); int n, q, s, t; cin >> n >> q >> s >> t; vector<int> nums(n + 1); for (int i = 0; i<=n; ++i) { cin >> nums[i]; } while (q--) { int l, r, x; cin >> l >> r >> x; for (int i = l; i<=r; ++i) { nums[i] += x; } int res = 0; for (int i = 1; i<=n; ++i) { if (nums[i] > nums[i - 1]) { res -= (nums[i] - nums[i - 1]) * s; } else { res += (nums[i - 1] - nums[i]) * t; } } cout << res << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...