제출 #882409

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882409		vjudge1	Bali Sculptures (APIO15_sculpture)	C++17	37 / 100	132 ms	27308 KiB

sculpture

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;


int n, a, b, A[N], pref[N];
bool dp[105][105][2200];
void solve(){
  cin >> n >> a >> b;
  for(int i = 1; i <= n; ++i) cin >> A[i];
  pref[0] = 0;
  for(int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + A[i];
  for(int i = 0; i <= n; ++i) for(int l = 0; l <= n; ++l) for(int j = 0; j <= 5000 ;++j) dp[i][l][j] = 0;
  dp[0][0][0] = 1;
  for(int i = 1; i <= n; ++i){
    for(int j = 0; j < i; ++j){
      for(int k = 1; k <= j + 1; ++k){
        for(int s = 0; s <= pref[j]; ++s){
          dp[i][k][(pref[i] - pref[j]) | s] |= dp[j][k - 1][s];
        }
      }
    }
  } 
  int ans = MOD;
  for(int i = a; i <= b; ++i){
    for(int j = 0; j <= pref[n]; ++j) if(dp[n][i][j]) ans = min(ans, j);
  }
  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  // cin >> tt;
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'int main()':
sculpture.cpp:41:15: warning: unused variable 'aa' [-Wunused-variable]
   41 |   int tt = 1, aa;
      |               ^~
sculpture.cpp: In function 'void solve()':
sculpture.cpp:20:102: warning: iteration 2200 invokes undefined behavior [-Waggressive-loop-optimizations]
   20 |   for(int i = 0; i <= n; ++i) for(int l = 0; l <= n; ++l) for(int j = 0; j <= 5000 ;++j) dp[i][l][j] = 0;
      |                                                                                          ~~~~~~~~~~~~^~~
sculpture.cpp:20:76: note: within this loop
   20 |   for(int i = 0; i <= n; ++i) for(int l = 0; l <= n; ++l) for(int j = 0; j <= 5000 ;++j) dp[i][l][j] = 0;
      |                                                                          ~~^~~~~~~

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