답안 #124028

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124028	2019-07-02T11:36:31 Z	amiratou	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1000 ms	49404 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 100000000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
ll tab[2500],dp[2500][2500];
ll n,A,B;

ll solve(int idx,int k,ll sum,int nb){

    //debugs(idx,k);
    //debug(sum);
    //if(k>B)return LLONG_MAX;
    if(idx==n){
        if(!nb){
            if(((k)>=A)&&((k)<=B))return sum;
            else return LLONG_MAX;
        }
        else{
            if(((k+1)>=A)&&((k+1)<=B))return sum;
            else return LLONG_MAX;
        }
    }
    //if(idx==n)return LLONG_MAX;
    ll ans=INF;
    //debug(ans);
    ans=min(ans,solve(idx+1,k,sum+tab[idx],nb+1));
    if(nb>=1)ans=min(ans,sum|solve(idx+1,k+1,tab[idx],1));
    return ans;
}
int main(){
    boost;
    memset(dp,-1,sizeof dp);
    cin>>n>>A>>B;
    for (int i = 0; i < n; ++i)
        cin>>tab[i];
    cout<<solve(0,0,0,0);
    return 0;
}
//long long
//array bounds
//special cases
//binary search

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	41 ms	49272 KB	Output is correct
2	Correct	41 ms	49272 KB	Output is correct
3	Correct	41 ms	49272 KB	Output is correct
4	Correct	41 ms	49272 KB	Output is correct
5	Correct	41 ms	49272 KB	Output is correct
6	Correct	41 ms	49272 KB	Output is correct
7	Correct	41 ms	49272 KB	Output is correct
8	Correct	46 ms	49272 KB	Output is correct
9	Correct	46 ms	49400 KB	Output is correct
10	Correct	46 ms	49272 KB	Output is correct
11	Correct	46 ms	49272 KB	Output is correct
12	Correct	45 ms	49276 KB	Output is correct
13	Correct	46 ms	49272 KB	Output is correct
14	Correct	41 ms	49272 KB	Output is correct
15	Correct	42 ms	49372 KB	Output is correct
16	Correct	41 ms	49288 KB	Output is correct
17	Correct	41 ms	49272 KB	Output is correct
18	Correct	41 ms	49272 KB	Output is correct
19	Correct	41 ms	49272 KB	Output is correct
20	Correct	42 ms	49244 KB	Output is correct
21	Incorrect	46 ms	49224 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	41 ms	49280 KB	Output is correct
2	Correct	43 ms	49244 KB	Output is correct
3	Correct	42 ms	49372 KB	Output is correct
4	Correct	41 ms	49292 KB	Output is correct
5	Correct	41 ms	49272 KB	Output is correct
6	Correct	41 ms	49272 KB	Output is correct
7	Correct	42 ms	49272 KB	Output is correct
8	Correct	46 ms	49272 KB	Output is correct
9	Correct	45 ms	49272 KB	Output is correct
10	Correct	46 ms	49272 KB	Output is correct
11	Correct	47 ms	49272 KB	Output is correct
12	Correct	46 ms	49272 KB	Output is correct
13	Correct	46 ms	49400 KB	Output is correct
14	Correct	41 ms	49272 KB	Output is correct
15	Correct	41 ms	49276 KB	Output is correct
16	Correct	41 ms	49272 KB	Output is correct
17	Correct	41 ms	49272 KB	Output is correct
18	Correct	41 ms	49192 KB	Output is correct
19	Correct	41 ms	49272 KB	Output is correct
20	Correct	42 ms	49272 KB	Output is correct
21	Incorrect	46 ms	49272 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	41 ms	49272 KB	Output is correct
2	Correct	41 ms	49208 KB	Output is correct
3	Correct	42 ms	49272 KB	Output is correct
4	Correct	41 ms	49264 KB	Output is correct
5	Correct	41 ms	49272 KB	Output is correct
6	Correct	41 ms	49272 KB	Output is correct
7	Correct	49 ms	49272 KB	Output is correct
8	Correct	53 ms	49272 KB	Output is correct
9	Correct	47 ms	49180 KB	Output is correct
10	Correct	51 ms	49316 KB	Output is correct
11	Correct	46 ms	49244 KB	Output is correct
12	Correct	45 ms	49272 KB	Output is correct
13	Correct	52 ms	49272 KB	Output is correct
14	Correct	51 ms	49300 KB	Output is correct
15	Correct	198 ms	49272 KB	Output is correct
16	Execution timed out	1066 ms	49272 KB	Time limit exceeded
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	41 ms	49312 KB	Output is correct
2	Correct	41 ms	49272 KB	Output is correct
3	Correct	48 ms	49272 KB	Output is correct
4	Correct	42 ms	49272 KB	Output is correct
5	Correct	41 ms	49272 KB	Output is correct
6	Correct	41 ms	49272 KB	Output is correct
7	Correct	42 ms	49272 KB	Output is correct
8	Correct	46 ms	49400 KB	Output is correct
9	Correct	46 ms	49400 KB	Output is correct
10	Correct	46 ms	49272 KB	Output is correct
11	Correct	46 ms	49272 KB	Output is correct
12	Correct	45 ms	49272 KB	Output is correct
13	Correct	46 ms	49272 KB	Output is correct
14	Correct	42 ms	49272 KB	Output is correct
15	Correct	41 ms	49272 KB	Output is correct
16	Correct	41 ms	49272 KB	Output is correct
17	Correct	41 ms	49244 KB	Output is correct
18	Correct	41 ms	49376 KB	Output is correct
19	Correct	42 ms	49272 KB	Output is correct
20	Correct	42 ms	49272 KB	Output is correct
21	Incorrect	46 ms	49272 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	41 ms	49272 KB	Output is correct
2	Correct	54 ms	49244 KB	Output is correct
3	Correct	41 ms	49272 KB	Output is correct
4	Correct	42 ms	49272 KB	Output is correct
5	Correct	41 ms	49272 KB	Output is correct
6	Correct	42 ms	49404 KB	Output is correct
7	Correct	42 ms	49272 KB	Output is correct
8	Correct	46 ms	49244 KB	Output is correct
9	Correct	46 ms	49272 KB	Output is correct
10	Correct	46 ms	49272 KB	Output is correct
11	Correct	46 ms	49272 KB	Output is correct
12	Correct	46 ms	49272 KB	Output is correct
13	Correct	47 ms	49272 KB	Output is correct
14	Correct	41 ms	49316 KB	Output is correct
15	Correct	41 ms	49272 KB	Output is correct
16	Correct	41 ms	49260 KB	Output is correct
17	Correct	44 ms	49272 KB	Output is correct
18	Incorrect	46 ms	49272 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

답안 #124028

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0