제출 #768872

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768872		raysh07	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	468 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int n, a, b;
const int N = 2005;
int aa[N]; 
long long p[N];
bitset <N> bs[N];

bool check(long long x){
    bs[0].set(0);
    
    for (int i = 1; i <= n; i++){
        bs[i] &= 0;
        for (int j = 0; j < i; j++){
            long long val = p[i] - p[j];
            if ((val | x) == x) {
                bs[i] |= bs[j] << 1;
            }
        }
        
        int cnt = 0;
        for (int j = 1; j <= n; j++){
            if (bs[i].test(j) && !bs[i].test(j - 1)) cnt++;
        }
        
        assert(cnt <= 2);
    }
    
    for (int i = a; i <= b; i++){
        if (bs[n].test(i)) return true;
    }
    return false;
}

void Solve() 
{
    cin >> n >> a >> b;
    
    for (int i = 1; i <= n; i++) cin >> aa[i], p[i] = p[i - 1] + aa[i];
    
    long long ans = (1LL << 63) - 1;
    for (int i = 62; i >= 0; i--){
        if (check(ans - (1LL << i))) ans -= 1LL << i;
    }
    
    cout << ans << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
//    cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

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

sculpture.cpp: In function 'void Solve()':
sculpture.cpp:48:33: warning: integer overflow in expression of type 'long long int' results in '9223372036854775807' [-Woverflow]
   48 |     long long ans = (1LL << 63) - 1;
      |                     ~~~~~~~~~~~~^~~

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