답안 #106365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
106365	2019-04-18T03:09:49 Z	abil	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1000 ms	384 KB

sculpture

#include <bits/stdc++.h>
#define int long long
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)
#define pi pair < int, int >

using namespace std;

const long long INF = (int)1e18 + 7;
const int N = (int)2007;
const int mod = 1000000007;

int n, a, b, ans = INF, arr[N];
void dfs(int g,int pos,int sum,int an){
      if(pos - 1 == n){
            if(g == 1){
                   ans = min(ans,(an | sum));
            }
      }
      else{
            if(g == 1){
                  dfs(g, pos + 1, sum + arr[pos], an);
            }
            else{
                  dfs(g,pos + 1, sum + arr[pos], an);
                  dfs(g - 1,pos + 1, arr[pos], (an | sum));
            }
      }
}
main(){
      cin >> n >> a >> b;
      if(n < a){
            cout << 0;
            return 0;
      }
      for(int i = 1;i <= n; i++){
            cin >> arr[i];
      }
      for(int i = a;i <= b; i++){
            dfs(i,1,0,0);
      }
      cout << ans;

}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

sculpture.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	45 ms	384 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	4 ms	256 KB	Output is correct
7	Correct	2 ms	356 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	50 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	43 ms	256 KB	Output is correct
14	Correct	116 ms	356 KB	Output is correct
15	Correct	45 ms	384 KB	Output is correct
16	Correct	4 ms	256 KB	Output is correct
17	Execution timed out	1076 ms	256 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	45 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	3 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	3 ms	256 KB	Output is correct
10	Correct	3 ms	256 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	49 ms	256 KB	Output is correct
14	Correct	3 ms	256 KB	Output is correct
15	Correct	3 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	3 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	21 ms	356 KB	Output is correct
21	Correct	66 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	61 ms	384 KB	Output is correct
24	Correct	109 ms	364 KB	Output is correct
25	Correct	43 ms	256 KB	Output is correct
26	Correct	3 ms	256 KB	Output is correct
27	Execution timed out	1051 ms	256 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-