Submission #492636

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
492636	2021-12-08T09:26:44 Z	5AP	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	1000 ms	320 KB

sculpture

#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#include<set>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<queue>
#include<bitset>
 
using namespace std;
 
#pragma GCC optimize ("Ofast")

#define all(x) x.begin() , x.end()
#define MP(x , y) make_pair(x , y)
#define wall cerr<<"--------------------------------------"<<endl
#define PB(x) push_back(x)

typedef long long int ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double db;
typedef pair<pll , ll> plll;
typedef pair<int , pii> piii;
typedef pair<pll , pll> pllll;
 
const ll maxn = 1e2+5 , maxc = 1e2+5, md = 1e9 + 7 , inf = 2e16;

ll n , a , b , x[maxn]; 

ll sol(ll pos , ll use , ll st , ll sum = 0)
{
    if(pos==n){
        if(st >= a && st<= b) return use|sum;
        return inf;
    }
    sum+=x[pos];
    ll res = sol(pos+1 , use , st , sum);
    if(st < b && pos < n-1) res= min(res , sol(pos+1 , use|sum , st+1));
    return res;
}

void solve()
{
    cin>>n>>a>>b;
    for(int i = 0 ; i<n ; i++)cin>>x[i];
    cout<<sol(0 , 0 , 1)<<'\n';
    return;
}


int main()
{
	// foropen("input.txt" , "r" , stdin);
	// foropen("output.txt" , "w" , stdout);

	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
	
	return 0;	
}

Subtask #1

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	312 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	312 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	316 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	4 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	3 ms	204 KB	Output is correct
34	Correct	3 ms	204 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	4 ms	204 KB	Output is correct

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	312 KB	Output is correct
7	Correct	0 ms	276 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	4 ms	316 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	3 ms	204 KB	Output is correct
27	Correct	7 ms	320 KB	Output is correct
28	Correct	18 ms	204 KB	Output is correct
29	Correct	2 ms	204 KB	Output is correct
30	Execution timed out	1090 ms	204 KB	Time limit exceeded
31	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	304 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	3 ms	204 KB	Output is correct
14	Correct	6 ms	316 KB	Output is correct
15	Correct	20 ms	312 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Execution timed out	1090 ms	204 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	316 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	308 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	4 ms	204 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	4 ms	204 KB	Output is correct
34	Correct	4 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	3 ms	204 KB	Output is correct
37	Correct	7 ms	204 KB	Output is correct
38	Correct	19 ms	208 KB	Output is correct
39	Correct	2 ms	312 KB	Output is correct
40	Execution timed out	1096 ms	204 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	312 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	276 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	4 ms	308 KB	Output is correct
21	Correct	3 ms	204 KB	Output is correct
22	Correct	0 ms	308 KB	Output is correct
23	Correct	3 ms	204 KB	Output is correct
24	Correct	6 ms	204 KB	Output is correct
25	Correct	19 ms	312 KB	Output is correct
26	Correct	2 ms	204 KB	Output is correct
27	Execution timed out	1086 ms	204 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-