제출 #765619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
765619		LucaIlie	Homecoming (BOI18_homecoming)	C++17	13 / 100	1089 ms	35532 KiB

homecoming

#include <bits/stdc++.h>
#include "homecoming.h"

#pragma GCC optimize(" unroll-loops")
#pragma gcc optimize("Ofast")
#pragma GCC optimization("Ofast")
#pragma optimize(Ofast)


using namespace std;

const long long INF = 1e16;
const int MAX_N = 2e6;
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 l = 0; l <= k; l++ ) {
        dp.init( n + l + 1 );
        dp.update( 0, 0, n + l, n + l, n + l, INF );
        for ( int i = n - 1; i >= 0; i-- ) {
            if ( i >= l ) {
                long long dpii = 0;
                dpii = dp.query( 0, 0, n + l, i + 1, n + l ) - dp.query( 0, 0, n + l, i, i );
                dp.update( 0, 0, n + l, i, i, dpii );
            }
            
            dp.update( 0, 0, n + l, i + 1, n + l, -b[i] );
            dp.update( 0, 0, n + l, i + k, n + l, a[i] );
        }

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

    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

homecoming.cpp:5: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    5 | #pragma gcc optimize("Ofast")
      | 
homecoming.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization("Ofast")
      | 
homecoming.cpp:7: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    7 | #pragma optimize(Ofast)
      | 
homecoming.cpp:4:37: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
    4 | #pragma GCC optimize(" unroll-loops")
      |                                     ^
homecoming.cpp:19:22: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   19 |     void init( int n ) {
      |                      ^
homecoming.cpp:26:38: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   26 |     void propag( int v, int l, int r ) {
      |                                      ^
homecoming.cpp:35:67: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   35 |     void update( int v, int l, int r, int lu, int ru, long long x ) {
      |                                                                   ^
homecoming.cpp:53:58: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   53 |     long long query( int v, int l, int r, int lq, int rq ) {
      |                                                          ^
homecoming.cpp:69:49: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]
   69 | long long solve( int n, int k, int a[], int b[] ) {
      |                                                 ^

• Subtask 1: 13 / 13
• Subtask 2: 0 / 18
• Subtask 3: 0 / 31
• Subtask 4: 0 / 38