제출 #541843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
541843		farhan132	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	207 ms	31892 KiB

sculpture

/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")


#include <bits/stdc++.h>
 
 
 
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2005;

ll dp[N][N];

ll n , a , b;
ll A[N];

bool check1(ll mask){
  mem(dp, 0);
  dp[n + 1][0] = 1;
  for(ll i = n; i >= 1; i--){
    ll sum = 0;
    for(ll j = i; j <= n; j++){
      sum += A[j];
      if( (mask | sum) != mask) continue;
      for(ll k = 1; k <= n; k++) dp[i][k] |= dp[j + 1][k - 1];
    }
  }
  for(ll i = a; i <= b; i++){
    if(dp[1][i]) return 1;
  }
  return 0;
}
ll dp2[N];
bool check2(ll mask){
   mem(dp2, 0);
   for(ll i = n; i >= 1; i--){
    ll sum = 0;
    dp2[i] = n + 2;
    for(ll j = i; j <= n; j++){
      sum += A[j];
      if((mask | sum) != mask) continue;
      dp2[i] = min(dp2[i] , dp2[j + 1] + 1);
    }
  }
  return dp2[1] <= b;
}

void solve(){

   cin >> n >> a >> b;

   for(ll i = 1; i <= n; i++) cin >> A[i];

   ll ans = 0;

   for(ll bit = 50; bit >= 0; bit--){
    bool ok;
    ll mask = ans | (1LL << bit) - 1;
    if(n <= 100) ok = check1(mask);
    else ok = check2(mask);
    if(!ok){

      ans |= (1LL << bit);
    }
   }
  
  cout << ans << '\n';
   return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //pre();

    ll T = 1, CT = 0; // cin >> T;

    while(T--){
        // cout << "Case #" << ++CT <<": " ;
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

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

sculpture.cpp: In function 'void solve()':
sculpture.cpp:114:34: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
  114 |     ll mask = ans | (1LL << bit) - 1;
      |                     ~~~~~~~~~~~~~^~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:140:15: warning: unused variable 'CT' [-Wunused-variable]
  140 |     ll T = 1, CT = 0; // cin >> T;
      |               ^~

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