제출 #1185295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185295		swishy123	Bali Sculptures (APIO15_sculpture)	C++20	37 / 100	0 ms	328 KiB

sculpture

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const ll inf = 1e18;
const ll def = 1e5+1;
const ll mod = 1e9;

void solve(){  
    int n, a, b;
    read(n, a, b);

    auto y = vec(n, 0);
    read(y);

    auto pref = vec(n + 1, 0ll);
    for (int i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + y[i - 1];

    ll msk = 0, res = 0;
    if (a != 1){
        for (int i = 30; i >= 0; i--){
            msk += (1ll << i);    
            auto dp = vec(n + 1, n + 1, 0);
    
            dp[0][0] = 1;
            for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) for (int u = 0; u < i; u++){
                bool flag = 1;
                if (((pref[i] - pref[u]) & msk) != 0)
                    flag = 0;
                dp[i][j] |= dp[u][j - 1] & flag;
            }
            bool ok = 0;
            for (int i = a; i <= b; i++){
                if (dp[n][i])
                    ok = 1;
            }
            if (!ok){
                msk ^= (1ll << i);
                res += (1ll << i);
            }
        }
    }
    else{
        for (int i = 30; i >= 0; i--){
            msk += (1ll << i);    
            auto dp = vec(n + 1, inf);
    
            dp[0] = 0;
            for (int i = 1; i <= n; i++) for (int u = 0; u < i; u++){
                bool flag = 1;
                if (((pref[i] - pref[u]) & msk) != 0)
                    flag = 0;
                if (flag)
                    mini(dp[i], dp[u] + 1);
            }
            if (dp[n] > b){
                msk ^= (1ll << i);
                res += (1ll << i);
            }
        }
    }
    print(res);
}       

/*
1 2 3 4 
2 3 4 1 
*/

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    if (ifstream("input.txt").good()){
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }

    int t;  
    t = 1;

    while (t--){
        solve();
        nl;
    }
}

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

sculpture.cpp: In function 'int32_t main()':
sculpture.cpp:178:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  178 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:179:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  179 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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