oj.uz

Submission #950003

# Submission time Handle Problem Language Result Execution time Memory
950003 2024-03-20T03:09:55 Z vjudge1 Sjeckanje (COCI21_sjeckanje) C++17
55 / 110
 2000 ms 7920 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q; cin >> n >> q;
    vector <int> a(n);
    for ( auto &u: a ) cin >> u;
    auto f = [&](auto a){
        vector <int> dp(n);
        ar <int,2> mx = {-a[0], a[0]};
        for ( int i = 1; i < n; i++ ){
            chmax(dp[i], dp[i - 1]);
            chmax(mx[0], -a[i] + dp[i - 1]);
            chmax(mx[1], a[i] + dp[i - 1]);
            chmax(dp[i], max(mx[0] + a[i], mx[1] - a[i]));
        }
        return dp.back();
    };
    while ( q-- ){
        int l, r, x; cin >> l >> r >> x;
        --l, --r;
        for ( int i = l; i <= r; i++ ){
            a[i] += x;
        }
        cout << f(a) << ln;
    }

    cout << '\n';
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 756 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 756 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 48 ms 604 KB Output is correct
8 Correct 48 ms 604 KB Output is correct
9 Correct 48 ms 604 KB Output is correct
10 Correct 49 ms 600 KB Output is correct
11 Correct 48 ms 616 KB Output is correct
12 Correct 42 ms 600 KB Output is correct

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 756 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 48 ms 604 KB Output is correct
8 Correct 48 ms 604 KB Output is correct
9 Correct 48 ms 604 KB Output is correct
10 Correct 49 ms 600 KB Output is correct
11 Correct 48 ms 616 KB Output is correct
12 Correct 42 ms 600 KB Output is correct
13 Execution timed out 2013 ms 7920 KB Time limit exceeded
14 Halted 0 ms 0 KB -