oj.uz

답안 #260797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260797 2020-08-11T02:03:47 Z jeqcho Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 1000 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second

int const n=2e3;
int N,A,B;
int Y[n];

ll recur(int now, vector<ll> sum, int cnt)
{
    if(cnt+1>B)return 2e12+5;
    ll cand=0;
    ll ans=2e12+5;
    FOR(i,now,N)
    {
        cand += Y[i];
        sum.pb(cand);
        if(i==N-1)
        {
            if(cnt+1<A)return ans;
            cand=0;
            trav(e,sum)
            {
                cand = cand | e;
            }
            return min(cand,ans);
        }
        ans = min(ans, recur(i+1,sum,cnt+1));
        sum.pop_back();
    }
    return ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N>>A>>B;
    F0R(i,N)cin>>Y[i];
    ll ans = recur(0, vector<ll> {0}, 0);
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 96 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 77 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 74 ms 384 KB Output is correct
34 Correct 97 ms 504 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 96 ms 384 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 103 ms 504 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 8 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 8 ms 384 KB Output is correct
26 Correct 77 ms 384 KB Output is correct
27 Correct 206 ms 392 KB Output is correct
28 Correct 603 ms 384 KB Output is correct
29 Correct 26 ms 504 KB Output is correct
30 Execution timed out 1089 ms 384 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 98 ms 392 KB Output is correct
14 Correct 195 ms 396 KB Output is correct
15 Correct 602 ms 388 KB Output is correct
16 Correct 49 ms 384 KB Output is correct
17 Execution timed out 1094 ms 384 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 98 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 8 ms 384 KB Output is correct
26 Correct 74 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 78 ms 384 KB Output is correct
34 Correct 97 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 96 ms 384 KB Output is correct
37 Correct 194 ms 396 KB Output is correct
38 Correct 619 ms 504 KB Output is correct
39 Correct 26 ms 384 KB Output is correct
40 Execution timed out 1099 ms 384 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 99 ms 504 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 7 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 77 ms 384 KB Output is correct
21 Correct 99 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 96 ms 384 KB Output is correct
24 Correct 197 ms 504 KB Output is correct
25 Correct 601 ms 384 KB Output is correct
26 Correct 27 ms 384 KB Output is correct
27 Execution timed out 1091 ms 384 KB Time limit exceeded
28 Halted 0 ms 0 KB -