답안 #333421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333421	2020-12-05T22:17:14 Z	rocks03	Bali Sculptures (APIO15_sculpture)	C++14	25 / 100	1000 ms	15212 KB

sculpture

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e3+100;
int N, A, B, a[MAXN];
map<pair<int, pair<int, ll>>, ll> memo;

ll f(int gruppo, int i, ll ans){
  	ll cur_ans = (1ll<<60)-1;
  	if(i == N){
    	if(gruppo - 1 > B || gruppo - 1 < A)
        	return cur_ans;
    	else
        	return ans;
    }
    if(gruppo + (N - i) < A || gruppo > B){
        return cur_ans;
    }
    pair<int, pair<int, ll>> st = {gruppo, {i, ans}};
    if(memo.count(st)){
        return memo[st];
    }
    ll s = 0;
    for(int j = i; j < N; j++){
        s += a[j];
        cur_ans = min(cur_ans, f(gruppo+1, j+1, (s|ans)));
    }
    memo[st] = cur_ans;
    return cur_ans;
}

void solve(){
    cin >> N >> A >> B;
    for(int i = 0; i < N; i++){
        cin >> a[i];
    }
    cout << f(1, 0, 0);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Compilation message

sculpture.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization("O3")
      | 
sculpture.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization("unroll-loops")
      |

Subtask #1

9.0 / 9.0

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

Subtask #2

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	0 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	48 ms	492 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	376 KB	Output is correct
27	Correct	2 ms	492 KB	Output is correct
28	Correct	73 ms	512 KB	Output is correct
29	Correct	3 ms	492 KB	Output is correct
30	Correct	164 ms	1260 KB	Output is correct
31	Correct	64 ms	2304 KB	Output is correct
32	Correct	28 ms	1388 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	37 ms	1644 KB	Output is correct
35	Correct	34 ms	1516 KB	Output is correct
36	Correct	27 ms	1132 KB	Output is correct

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	2 ms	492 KB	Output is correct
15	Correct	3 ms	492 KB	Output is correct
16	Correct	3 ms	512 KB	Output is correct
17	Correct	20 ms	1144 KB	Output is correct
18	Correct	63 ms	2156 KB	Output is correct
19	Correct	27 ms	1260 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	38 ms	1644 KB	Output is correct
22	Correct	34 ms	1516 KB	Output is correct
23	Correct	27 ms	1132 KB	Output is correct
24	Correct	67 ms	2412 KB	Output is correct
25	Correct	104 ms	2540 KB	Output is correct
26	Correct	443 ms	7680 KB	Output is correct
27	Correct	872 ms	13416 KB	Output is correct
28	Execution timed out	1047 ms	14848 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	492 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	2 ms	640 KB	Output is correct
38	Correct	3 ms	492 KB	Output is correct
39	Correct	3 ms	640 KB	Output is correct
40	Correct	20 ms	1260 KB	Output is correct
41	Correct	64 ms	2156 KB	Output is correct
42	Correct	27 ms	1260 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	38 ms	1644 KB	Output is correct
45	Correct	34 ms	1428 KB	Output is correct
46	Correct	27 ms	1132 KB	Output is correct
47	Correct	67 ms	2412 KB	Output is correct
48	Correct	106 ms	2668 KB	Output is correct
49	Correct	435 ms	7532 KB	Output is correct
50	Correct	874 ms	13292 KB	Output is correct
51	Execution timed out	1094 ms	15212 KB	Time limit exceeded
52	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	0 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	0 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	3 ms	492 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Correct	20 ms	1152 KB	Output is correct
28	Correct	63 ms	2156 KB	Output is correct
29	Correct	28 ms	1260 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	38 ms	1644 KB	Output is correct
32	Correct	34 ms	1516 KB	Output is correct
33	Correct	28 ms	1152 KB	Output is correct
34	Correct	67 ms	2412 KB	Output is correct
35	Correct	103 ms	2540 KB	Output is correct
36	Correct	434 ms	7532 KB	Output is correct
37	Correct	874 ms	13420 KB	Output is correct
38	Execution timed out	1045 ms	14972 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-