제출 #1181001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181001		asli_bg	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	0 ms	328 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=2e3+5;
const int MOD=1e9+7;
const int INF=1e18;

int dp[MAXN][MAXN];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,a,b;
    cin>>n>>a>>b;
    vi ar(n+1);
    FORE(i,1,n+1) cin>>ar[i];

    vi pref(n+1,0);
    FORE(i,1,n+1) pref[i]=pref[i-1]+ar[i];
    

    FOR(i,n+1) FOR(k,b+1) dp[i][k]=INF;

    dp[0][0]=0;
    FORE(i,1,n+1){
        FORE(j,1,i+1){
            int deg=pref[i]-pref[j-1];
            FORE(k,0,b){ //grup sayısı
                dp[i][k+1]=min(dp[i][k+1],(dp[j-1][k]|deg));
            }
        }
    }

    int ans=INF;
    FORE(i,a,b+1) ans=min(ans,dp[n][i]);

    cout<<ans<<endl;
}   

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