oj.uz

답안 #708500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
708500 2023-03-11T21:16:07 Z ssense Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int n;
int a, b;
vint y;

bool get(int mask)
{
    bool dp[101][101];
    memset(dp, 0, sizeof(dp));
    dp[0][0] = true;
    for(int grup = 0; grup < b; grup++)
    {
        for(int i = 0; i < n; i++)
        {
            if(dp[i][grup])
            {
                int sum = 0;
                for(int j = i+1; j <= n; j++)
                {
                    sum+=y[j-1];
                    if((sum&mask) == 0)
                    {
                        dp[j][grup+1] = true;
                    }
                }
            }
        }
    }
    for(int i = a; i <= b; i++)
    {
        if(dp[n][i])
        {
            return true;
        }
    }
    return false;
}

bool get2(int mask)
{
    int dp[2001];
    memset(dp, MX, sizeof(dp));
    dp[0] = 0;
    for(int i = 0; i < n; i++)
    {
        if(dp[i] != MX)
        {
            int sum = 0;
            for(int j = i+1; j <= n; j++)
            {
                sum+=y[j-1];
                if((sum&mask) == 0)
                {
                    dp[j] = min(dp[j], dp[i]+1);
                }
            }
        }
    }
    if(dp[n] != MX)
    {
        return true;
    }
    return false;
}

void solve()
{
    cin >> n;
    cin >> a >> b;
    y = read(n);
    if(a == 1)
    {
        int mask = 0;
        for(int i = 60; i >= 0; i--)
        {
            if(get2(mask | (1LL<<i)))
            {
                mask|=(1LL<<i);
            }
        }
        cout << ((1LL<<61)-1-mask) << endl;
        return;
    }
    int mask = 0;
    for(int i = 60; i >= 0; i--)
    {
        if(get(mask | (1LL<<i)))
        {
            mask|=(1LL<<i);
        }
    }
    cout << ((1LL<<61)-1-mask) << endl;
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}


/*
6 1 3
8 1 2 1 5 4
 */

Compilation message

sculpture.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
sculpture.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -