제출 #1336952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1336952		matsakyannn	Bali Sculptures (APIO15_sculpture)	C++20	71 / 100	1094 ms	1348 KiB

sculpture

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <cstdio>
//#include <sys/resource.h>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(deque <T> v);
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.front()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(priority_queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.top()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(int n__, T arr[]) {cerr << "[ "; for(int i = 0; i <= n__; i++) {print(arr[i]); cerr << " ";} cerr << "]\n";}
 
 
#define pb push_back
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define noAnsw cout << -1 << '\n'
#define ll long long
#define ppb pop_back
#define OK cout << "OK" << endl;
#define ld long double
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define PII pair <int, int>
#define endl '\n'
#define ull unsigned long long
#define PLL pair <ll, ll>
#define PIL pair <int, ll>
#define PLI pair <ll, int>
#define rall(v) (v).rbegin(), (v).rend() 
#define priora priority_queue
#define urishOK cout << "urishOK\n";
 
void setIO(string name = "") {
	if (!name.empty()) {
		freopen((name + ".in").c_str(), "r", stdin);  
		freopen((name + ".out").c_str(), "w", stdout);
	}
}
void fastIO(){
    ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL); 
}
void setPrecision(int x){
    if(x == 0){
        return;
    }
    cout.setf(ios::fixed);
    cout.precision(x);
    return;
}
// void increaseStack(rlim_t stackSize) {
//     struct rlimit rl;
//     int result;

//     result = getrlimit(RLIMIT_STACK, &rl);
//     if (result == 0) {
//         if (rl.rlim_cur < stackSize) {
//             rl.rlim_cur = stackSize;
//             result = setrlimit(RLIMIT_STACK, &rl);
//             if (result != 0) {
//                 cerr << "Error setting stack size." << endl;
//             }
//         }
//     }
// }
 
const int inf = 1e9 + 5, LOG = 50;
const ll inf64 = 1e18 + 5, mod = 1e9 + 7, wmod = 998244353;
const double epsilon = 0.000001, pi = 3.14159265359;
 
const int N = 2005;
int n, A, B;
ll a[N];
bool dp[N][N];

void solve(int TST_NUM){
    cin >> n >> A >> B;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    ll answ = 0;
    for(int ii = LOG; ii >= 0; ii--){
        for(int i = 0; i <= n; i++){
            for(int j = 0; j <= n; j++){
                dp[i][j] = 0;
            }
        }
        ll mask = (answ | ((1LL << ii) - 1));
        dp[0][0] = 1;
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(j > i) break;
                ll sum = 0;
                for(int t = i; t >= 1; t--){
                    sum += a[t];
                    dp[i][j] |= (dp[t - 1][j - 1] & ((sum & (mask)) == sum));
                }
            }
        }
        bool flag = 0;
        for(int j = A; j <= B; j++){
            flag |= dp[n][j];
        }
        if(!flag) answ |= (1LL << ii);
    }
    cout << answ << endl;
}   
 
int main(){
    setPrecision(1);
    fastIO();
    //increaseStack(64 * 1024 * 1024);
    //setIO("file");
 
    int Tests = 1;
    //cin >> Tests;
 
    int TST_NUM = 1;
    while(Tests--){
        solve(TST_NUM++);
    }
    return 0; 
} 
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//mcmcmcmcmcmcmcmcmcmcmc
//matsak

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

sculpture.cpp: In function 'void setIO(std::string)':
sculpture.cpp:60:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |                 freopen((name + ".in").c_str(), "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:61:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |                 freopen((name + ".out").c_str(), "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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