Submission #489708

#	Time	Username	Problem	Language	Result	Execution time	Memory
489708		mdn2002	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	1087 ms	16096 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
int n , a , b , y [2003] , dp [2003][2003];
long long mask;
bool f ( int x , int num )
{
    if ( x == n )
    {
        if ( a <= num && num <= b ) return 1;
        return 0;
    }
    if ( dp [x][num] != -1 ) return dp [x][num];
    bool ans = 0;
    long long sum = 0;
    for ( int i = x ; i < n ; i ++ )
    {
        sum += y [i];
        if ( ( mask | sum ) > mask ) continue;
        ans = max ( ans , f ( i + 1 , num + 1 ) );
    }
    return dp [x][num] = ans;
}
bool ck ( )
{
    memset ( dp , -1 , sizeof dp );
    return f ( 0 , 0 );
}
int main()
{
    //freopen ( "fence8.in" , "r" , stdin );
    //freopen ( "fence8.out" , "w" , stdout );
    scanf ( "%d%d%d" , &n , &a , &b );
    for ( int i = 0 ; i < n ; i ++ ) scanf ( "%d" , &y [i] );
    mask = ( 1ll << 50 ) - 1;
    for ( int i = 49 ; i >= 0 ; i -- )
    {
        mask ^= ( 1ll << i );
        if ( ck ( ) == 0 ) mask ^= ( 1ll << i );
    }
    printf ( "%lld" , mask );
}

Compilation message (stderr)

sculpture.cpp: In function 'bool f(int, int)':
sculpture.cpp:21:24: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   21 |     return dp [x][num] = ans;
      |            ~~~~~~~~~~~~^~~~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:32:11: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf ( "%d%d%d" , &n , &a , &b );
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:33:44: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     for ( int i = 0 ; i < n ; i ++ ) scanf ( "%d" , &y [i] );
      |                                      ~~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 0 / 29