Submission #106356

#	Time	Username	Problem	Language	Result	Execution time	Memory
106356		abil	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1077 ms	504 KiB

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 == 0){
                   ans = min(ans,(an | sum));
            }
      }
      else{
                  if(g == 0){
                        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;
      for(int i = 1;i <= n; i++){
            Scan(arr[i]);
      }
      for(int i = a;i <= b; i++){
            dfs(i - 1,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(){
      ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:9:35: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
 #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 == 0){
             ~~~~~~~~~~~~           
                    ans = min(ans,(an | sum));
                    ~~~~~~~~~~~~~~~~~~~~~~~~~~~
             }
             ~~                     
       }
       ~~                           
       else{
       ~~~~~~                       
                   if(g == 0){
                   ~~~~~~~~~~~~     
                         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;
       ~~~~~~~~~~~~~~~~~~~~         
       for(int i = 1;i <= n; i++){
       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
             Scan(arr[i]);
             ~~~~~~~~~~~            
sculpture.cpp:39:13: note: in expansion of macro 'Scan'
             Scan(arr[i]);
             ^~~~
sculpture.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define Scan(a) scanf ("%I64d", &a)
                 ~~~~~~^~~~~~~~~~~~~
sculpture.cpp:39:13: note: in expansion of macro 'Scan'
             Scan(arr[i]);
             ^~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29