Submission #106365

#TimeUsernameProblemLanguageResultExecution timeMemory
106365abilBali Sculptures (APIO15_sculpture)C++14
0 / 100
1076 ms384 KiB
#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 (stderr)

sculpture.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...