제출 #1280061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280061		SSKMF	Bali Sculptures (APIO15_sculpture)	C++20	37 / 100	5 ms	588 KiB

sculpture

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

bitset <2001> posibil[2001];
int sir[2001];

int main ()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int lungime , minim , maxim;
    cin >> lungime >> minim >> maxim;

    for (int indice = 1 ; indice <= lungime ; indice++)
        { cin >> sir[indice]; }
    
    int rezultat = (1 << 30) - 1;
    for (int putere = (1 << 29) ; putere ; putere >>= 1)
    {
        rezultat ^= putere;

        posibil[0].set(0);
        for (int dreapta = 1 ; dreapta <= lungime ; dreapta++)
        {
            posibil[dreapta].reset();
            for (int stanga = dreapta , suma = 0 ; stanga && suma <= rezultat ; stanga--)
            {
                suma += sir[stanga];
                if ((rezultat & suma) == suma)
                    { posibil[dreapta] |= (posibil[stanga - 1] << 1); }
            }
        }

        bool gasit = false;
        for (int indice = minim ; indice <= maxim ; indice++) {
            if (posibil[lungime][indice])
                { gasit = true; break; }
        }

        if (!gasit)
            { rezultat |= putere; }
    }

    cout << rezultat;
    return 0;
}

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