oj.uz

답안 #127612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127612 2019-07-09T16:26:44 Z MohamedAhmed04 Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 35 ms 9592 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX = 2005 ;
const int MAX2 = 105 ;

long long arr[MAX] , pref[MAX];

long long dp[MAX2][MAX2][MAX2] ;
long long dp2[MAX][MAX] ;

int n , a , b ;

long long now = 0 ;

long long bit1 = 0 , bit2 = 0;

long long calc1(int idx , int st , int groups)
{
    if(idx == n && groups >= a && groups <= b)
    {
        long long val ;
        if(st == 0)
            val = pref[idx-1] ;
        else
            val = pref[idx-1] - pref[st-1] ;
        if(!((val & bit1)))
            return val ;
        return (1ll << 58) ;
    }
    if(groups > b)
        return (1ll << 58) ;
    if(idx == n && groups < a || groups > b)
        return (1ll << 58) ;
    long long &ret = dp[idx][st][groups] ;
    if(ret != -1)
        return ret ;
    long long val ;
    if(st == 0)
        val = pref[idx-1] ;
    else
        val = pref[idx-1] - pref[st-1] ;
    long long choice1 = calc1(idx+1 , st , groups) ;
    long long choice2 = (1ll << 58) ;
    if(!((val & bit1)))
        choice2 = calc1(idx+1 , idx , groups+1) | val ;
    ret = min(choice1 , choice2) ;
    return ret ;
}

long long calc2(int idx , int st)
{
    if(idx == n)
    {
        long long val ;
        if(st == 0)
            val = pref[idx-1] ;
        else
            val = pref[idx-1] - pref[st-1] ;
        if(!((val & bit1)))
            return 0 ;
        return (1ll << 58) ;
    }
    long long &ret = dp2[idx][st] ;
    if(ret != -1)
        return ret ;
    long long val ;
    if(st == 0)
        val = pref[idx-1] ;
    else
        val = pref[idx-1] - pref[st-1] ;
    long long choice1 = calc2(idx+1 , st) ;
    long long choice2 = (1ll << 58) ;
    if(!((val & bit1)))
        choice2 = calc2(idx+1 , idx) + 1;
    ret = min(choice1 , choice2) ;
    return ret ;
}

void solve1()
{
    long long ans = 0 ;
    for(int i = 42 ; i >= 0 ; --i)
    {
        memset(dp2 , -1 , sizeof(dp)) ;
        bit1 |= (1ll << i) ;
        long long a = calc2(1 , 0);
        if(a > b)
        {
            bit1 ^= (1ll << i) ;
            ans += (1ll << i) ;
        }
    }
    cout<<ans<<"\n" ;
    return ;
}

void solve2()
{
    long long ans = 0 ;
    for(int i = 42 ; i >= 0 ; --i)
    {
        memset(dp , -1 , sizeof(dp)) ;
        bit1 |= (1ll << i) ;
        long long a = calc1(1 , 0 , 1) ;
        if(a >= (1ll << 58))
        {
            bit1 ^= (1ll << i) ;
            ans += (1ll << i) ;
        }
    }
    cout<<ans<<"\n" ;
    return ;
}


int main()
{
    ios::sync_with_stdio(0) ;
    cin.tie(0) ;
    cin>>n>>a>>b ;
    for(int i = 0 ; i < n ; ++i)
        cin>>arr[i] ;
    pref[0] = arr[0] ;
    for(int i = 1 ; i < n ; ++i)
        pref[i] = pref[i-1] + arr[i] ;
    if(a == 1)
    {
        solve1() ;
        return 0 ;
    }
    solve2() ;
    return 0 ;
}

Compilation message

sculpture.cpp: In function 'long long int calc1(int, int, int)':
sculpture.cpp:34:17: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if(idx == n && groups < a || groups > b)
        ~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 9592 KB Output is correct
2 Correct 30 ms 9464 KB Output is correct
3 Correct 30 ms 9464 KB Output is correct
4 Correct 30 ms 9468 KB Output is correct
5 Incorrect 31 ms 9336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 9340 KB Output is correct
2 Correct 29 ms 9336 KB Output is correct
3 Correct 31 ms 9336 KB Output is correct
4 Correct 30 ms 9464 KB Output is correct
5 Incorrect 31 ms 9464 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 9464 KB Output is correct
2 Correct 29 ms 9448 KB Output is correct
3 Correct 35 ms 9448 KB Output is correct
4 Correct 34 ms 9532 KB Output is correct
5 Incorrect 30 ms 9336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 9336 KB Output is correct
2 Correct 31 ms 9336 KB Output is correct
3 Correct 31 ms 9464 KB Output is correct
4 Correct 30 ms 9464 KB Output is correct
5 Incorrect 30 ms 9336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 9464 KB Output is correct
2 Correct 30 ms 9336 KB Output is correct
3 Correct 30 ms 9336 KB Output is correct
4 Correct 27 ms 9336 KB Output is correct
5 Incorrect 31 ms 9464 KB Output isn't correct
6 Halted 0 ms 0 KB -