제출 #743359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
743359		Magikarp4000	Bali Sculptures (APIO15_sculpture)	C++17	16 / 100	11 ms	8532 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 1e2+1, MAXX = 5e2+1;
int n,A,B;
int a[MAXN], p[MAXN];
int dp[MAXN][MAXN][MAXX];

signed main() {
    cin >> n >> A >> B;
    FOR(i,0,n) cin >> a[i];
    FOR(i,1,n+1) p[i] = p[i-1]+a[i-1];
    FOR(i,0,n) dp[i][0][p[i+1]] = 1;
    FOR(j,0,n-1) {
        FOR(i,0,n) {
            FOR(k,0,MAXX) {
                if (dp[i][j][k]) {
                    FOR(l,i+1,n) {
                        dp[l][j+1][k|(p[l+1]-p[i+1])] = 1;
                    }
                }

            }
        }
    }
    int res = LLINF;
    FOR(x,A-1,B) {
        FOR(k,0,MAXX) {
            if (dp[n-1][x][k]) res = min(res,k);
        }
    }
    cout << res;
}

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