oj.uz

Submission #368072

# Submission time Handle Problem Language Result Execution time Memory
368072 2021-02-19T12:48:29 Z egekabas Sjeckanje (COCI21_sjeckanje) C++14
55 / 110
 2000 ms 113644 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
struct node{
    ll l, r;
    vector<vector<ll>> vals;
    ll single;
    node(){
        l = r = -1e18;
    }
    node(ll val){
        l = r = val;
        vals = vector<vector<ll>>(3, vector<ll>(3));    
        single = 1;
    }
};
node merge(node a, node b){
    if(a.l == -1e18) return b;
    if(b.l == -1e18) return a;
    node ret;
    ret.l = a.l;
    ret.r = b.r;
    ret.vals = vector<vector<ll>>(3, vector<ll>(3));
    for(ll i = 0; i < 3; ++i)
        for(ll j = 0; j < 3; ++j){
            if((a.single && i == ((a.r < b.l)^1)) || (b.single && j == ((a.r < b.l)^1))){
                ret.vals[i][j] = a.vals[i][2]+b.vals[2][j];
                continue;
            }
            ret.vals[i][j] = max(a.vals[i][2]+b.vals[2][j], abs(a.r-b.l)+a.vals[i][a.r < b.l]+b.vals[a.r < b.l][j]);
        }
    ret.single = 0;
    return ret;
}
node seg[800009];
ll lazy[800009];
ll a[200009];
void init(ll v, ll tl, ll tr){
    if(tl == tr){
        seg[v] = node(a[tl]);
        return;
    }
    init(2*v, tl, (tl+tr)/2);
    init(2*v+1, (tl+tr)/2+1, tr);
    seg[v] = merge(seg[2*v], seg[2*v+1]);
}
void push(ll v){
    lazy[2*v] += lazy[v];
    lazy[2*v+1] += lazy[v];
    
    seg[2*v].l += lazy[v];
    seg[2*v].r += lazy[v];
    
    seg[2*v+1].l += lazy[v];
    seg[2*v+1].r += lazy[v];
    
    lazy[v] = 0;
}
void upd(ll v, ll tl, ll tr, ll l, ll r, ll val){
    if(r < tl || tr < l)
        return;
    if(l <= tl && tr <= r){
        lazy[v] += val;
        seg[v].l += val;
        seg[v].r += val;
    }
    else{
        push(v);
        upd(2*v, tl, (tl+tr)/2, l, r, val);
        upd(2*v+1, (tl+tr)/2+1, tr, l, r, val);
        seg[v] = merge(seg[2*v], seg[2*v+1]);       
    }
}
ll n, q;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    cin >> n >> q;
    for(ll i = 0; i < n; ++i)
        cin >> a[i];
    init(1, 0, n-1);
    //cout << seg[1].vals[2][2] << '\n';
    while(q--){
        ll x, y, val;
        cin >> x >> y >> val;
        upd(1, 0, n-1, x-1, y-1, val);
        cout << seg[1].vals[2][2] << '\n';
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 38028 KB Output is correct
2 Correct 30 ms 37996 KB Output is correct
3 Correct 27 ms 37996 KB Output is correct
4 Correct 26 ms 37996 KB Output is correct
5 Correct 27 ms 37996 KB Output is correct
6 Correct 26 ms 37996 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 38028 KB Output is correct
2 Correct 30 ms 37996 KB Output is correct
3 Correct 27 ms 37996 KB Output is correct
4 Correct 26 ms 37996 KB Output is correct
5 Correct 27 ms 37996 KB Output is correct
6 Correct 26 ms 37996 KB Output is correct
7 Correct 56 ms 39148 KB Output is correct
8 Correct 60 ms 39148 KB Output is correct
9 Correct 61 ms 39148 KB Output is correct
10 Correct 55 ms 39148 KB Output is correct
11 Correct 63 ms 39148 KB Output is correct
12 Correct 67 ms 39148 KB Output is correct

Subtask #3
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 38028 KB Output is correct
2 Correct 30 ms 37996 KB Output is correct
3 Correct 27 ms 37996 KB Output is correct
4 Correct 26 ms 37996 KB Output is correct
5 Correct 27 ms 37996 KB Output is correct
6 Correct 26 ms 37996 KB Output is correct
7 Correct 56 ms 39148 KB Output is correct
8 Correct 60 ms 39148 KB Output is correct
9 Correct 61 ms 39148 KB Output is correct
10 Correct 55 ms 39148 KB Output is correct
11 Correct 63 ms 39148 KB Output is correct
12 Correct 67 ms 39148 KB Output is correct
13 Execution timed out 2086 ms 113644 KB Time limit exceeded
14 Halted 0 ms 0 KB -