oj.uz

Submission #767034

# Submission time Handle Problem Language Result Execution time Memory
767034 2023-06-26T10:28:11 Z LucaIlie Homecoming (BOI18_homecoming) C++17
31 / 100
 1000 ms 141368 KB 
#include <bits/stdc++.h>
#include "homecoming.h"

using namespace std;

const long long INF = 1e16;
const int MAX_SGT = 4e6 + 1;

struct SegTree {
    long long segTree[4 * MAX_SGT], lazy[4 * MAX_SGT];

    void init( int n ) {
        for ( int v = 0; v < 4 * n; v++ ) {
            segTree[v] = -INF;
            lazy[v] = 0;
        }
    }

    void propag( int v, int l, int r ) {
        segTree[v] += lazy[v];
        if ( l != r ) {
            lazy[v * 2 + 1] += lazy[v];
            lazy[v * 2 + 2] += lazy[v];
        }
        lazy[v] = 0;
    }

    void update( int v, int l, int r, int lu, int ru, long long x ) {
        propag( v, l, r );

        if ( l > ru || r < lu )
            return;

        if ( lu <= l && r <= ru ) {
            lazy[v] = x;
            propag( v, l, r );
            return;
        }

        int mid = (l + r) / 2;
        update( v * 2 + 1, l, mid, lu, ru, x );
        update( v * 2 + 2, mid + 1, r, lu, ru, x );
        segTree[v] = max( segTree[v * 2 + 1], segTree[v * 2 + 2] );
    }

    long long query( int v, int l, int r, int lq, int rq ) {
        propag( v, l, r );

        if ( l > rq || r < lq )
            return -INF;

        if ( lq <= l && r <= rq )
            return segTree[v];

        int mid = (l + r) / 2;
        return max( query( v * 2 + 1, l, mid, lq, rq ), query( v * 2 + 2, mid + 1, r, lq, rq ) );
    }
};

SegTree dp;

long long solve( int n, int k, int a[], int b[] ) {
    long long ans = 0;

    for ( int take = 0; take <= 1; take++ ) {
        dp.init( n + k + 1 );
        if ( !take ) {
            long long s = 0;
            for ( int j = 0; j <= k; j++ ) {
                dp.update( 0, 0, n + k, n + j, n + j, INF - s );
                s += b[j];
            }
        } else {
            for ( int j = 0; j <= k; j++ )
                dp.update( 0, 0, n + k, n + j, n + j, INF );
        }

        for ( int i = n - 1; i >= 0; i-- ) {
            if ( i >= k * take ) {
                long long x = dp.query( 0, 0, n + k, i + 1, n + k );
                dp.update( 0, 0, n + k, i, i, INF + x );
            }

            dp.update( 0, 0, n + k, i + 1, n + k, -b[i] );
            dp.update( 0, 0, n + k, i + k, n + k, a[i] );
        }

        ans = max( ans, dp.query( 0, 0, n + k, 0, n + k ) );
    }

    return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1008 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 6 ms 596 KB Output is correct
10 Correct 3 ms 260 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 35576 KB Output is correct
2 Correct 27 ms 524 KB Output is correct
3 Execution timed out 1045 ms 141368 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 1008 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 6 ms 596 KB Output is correct
10 Correct 3 ms 260 KB Output is correct
11 Correct 884 ms 35576 KB Output is correct
12 Correct 27 ms 524 KB Output is correct
13 Execution timed out 1045 ms 141368 KB Time limit exceeded
14 Halted 0 ms 0 KB -