Submission #1153587

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1153587	2025-02-19 18:41:50	AlgorithmWarrior	Bali Sculptures (APIO15_sculpture)	C++20	100 / 100	50 ms	436 KiB

sculpture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int const MAX1=105;
int const MAX2=2005;
bool dp1[MAX1][MAX1];
int dp2[MAX2];
int n,a,b;
int v[MAX2];
void read(){
    cin>>n>>a>>b;
    int i;
    for(i=1;i<=n;++i)
        cin>>v[i];
}
bool check1(long long nr){
    int i,j,l;
    for(i=0;i<=n;++i)
        for(j=0;j<=n;++j)
            dp1[i][j]=0;
    dp1[0][0]=1;
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j){
            long long sum=v[i];
            for(l=i-1;l>=0;sum+=v[l],--l)
                if(dp1[l][j-1] && (sum|nr)==nr)
                    dp1[i][j]=1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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