# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605841 | jjiangly | Foehn Phenomena (JOI17_foehn_phenomena) | C++14 | 9 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX
const int nxm = int(2e3) + 7;
ll n, q, s, t, a[nxm];
namespace sub1 {
ll l, r, x;
void exe() {
while (q--) {
cin >> l >> r >> x;
for (int i = l; i <= r; ++i) {
a[i] += x;
}
ll ans = 0;
for (int i = 1; i <= n; ++i) {
if (a[i] > a[i - 1]) {
ans -= (a[i] - a[i - 1]) * s;
} else {
ans += (a[i - 1] - a[i]) * t;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |