oj.uz

Submission #476336

# Submission time Handle Problem Language Result Execution time Memory
476336 2021-09-26T05:03:48 Z palilo Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 125 ms 11584 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef palilo
template <typename C, typename T = typename enable_if<!is_same<C, string>::value, typename C::value_type>::type>
ostream& operator<<(ostream& os, const C& container) {
    os << '[';
    bool first = true;
    for (const auto& x : container) {
        if (!first) os << ", ";
        os << x;
        first = false;
    }
    return os << ']';
}

template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << '(' << p.first << ", " << p.second << ')';
}

template <typename T>
void debug_msg(string name, T arg) {
    cerr << name << " = " << arg << endl;
}

template <typename T1, typename... T2>
void debug_msg(string names, T1 arg, T2... args) {
    cerr << names.substr(0, names.find(',')) << " = " << arg << " | ";
    debug_msg(names.substr(names.find(',') + 2), args...);
}

#define debug(...) cerr << '(' << __LINE__ << ')' << ' ', debug_msg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...)
#endif

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef palilo
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int n, q;
    int64_t s, t;
    cin >> n >> q >> s >> t;
    vector<int64_t> a(n);
    {
        int prv, cur;
        cin >> prv;
        for (auto& x : a) {
            cin >> cur;
            x = cur - prv;
            prv = cur;
        }
    }
    int64_t res = 0;
    for (const auto& x : a) {
        res -= (x < 0 ? t : s) * x;
    }
    for (int l, r, x; q--;) {
        cin >> l >> r >> x, --l;
        res += (a[l] < 0 ? t : s) * a[l];
        if (r != n) res += (a[r] < 0 ? t : s) * a[r];
        a[l] += x;
        if (r != n) a[r] -= x;
        res -= (a[l] < 0 ? t : s) * a[l];
        if (r != n) res -= (a[r] < 0 ? t : s) * a[r];
        cout << res << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 396 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 8728 KB Output is correct
2 Correct 109 ms 9292 KB Output is correct
3 Correct 111 ms 9924 KB Output is correct
4 Correct 115 ms 9284 KB Output is correct
5 Correct 111 ms 10692 KB Output is correct
6 Correct 109 ms 9412 KB Output is correct
7 Correct 95 ms 9420 KB Output is correct
8 Correct 101 ms 10184 KB Output is correct
9 Correct 113 ms 10564 KB Output is correct
10 Correct 105 ms 9356 KB Output is correct
11 Correct 95 ms 9284 KB Output is correct
12 Correct 101 ms 10120 KB Output is correct
13 Correct 88 ms 10308 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 320 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 396 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 118 ms 8728 KB Output is correct
23 Correct 109 ms 9292 KB Output is correct
24 Correct 111 ms 9924 KB Output is correct
25 Correct 115 ms 9284 KB Output is correct
26 Correct 111 ms 10692 KB Output is correct
27 Correct 109 ms 9412 KB Output is correct
28 Correct 95 ms 9420 KB Output is correct
29 Correct 101 ms 10184 KB Output is correct
30 Correct 113 ms 10564 KB Output is correct
31 Correct 105 ms 9356 KB Output is correct
32 Correct 95 ms 9284 KB Output is correct
33 Correct 101 ms 10120 KB Output is correct
34 Correct 88 ms 10308 KB Output is correct
35 Correct 101 ms 8820 KB Output is correct
36 Correct 107 ms 10308 KB Output is correct
37 Correct 112 ms 11100 KB Output is correct
38 Correct 104 ms 10832 KB Output is correct
39 Correct 109 ms 10792 KB Output is correct
40 Correct 125 ms 10816 KB Output is correct
41 Correct 121 ms 10688 KB Output is correct
42 Correct 124 ms 10784 KB Output is correct
43 Correct 118 ms 9992 KB Output is correct
44 Correct 110 ms 10436 KB Output is correct
45 Correct 101 ms 10536 KB Output is correct
46 Correct 125 ms 11584 KB Output is correct
47 Correct 98 ms 10112 KB Output is correct
48 Correct 91 ms 10080 KB Output is correct
49 Correct 97 ms 9168 KB Output is correct
50 Correct 107 ms 9936 KB Output is correct
51 Correct 107 ms 10324 KB Output is correct
52 Correct 88 ms 10064 KB Output is correct