oj.uz

답안 #1008359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008359 2024-06-26T09:52:43 Z Whisper Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX         2005
int nArr, l, r;
int A[MAX], sum[MAX];
void init(void){
    cin >> nArr >> l >> r;
    for (int i = 1; i <= nArr; ++i) cin >> A[i], sum[i] = sum[i - 1] + A[i];
}

int dp[51][501][51];
void process(void){
    int ans = 0;
    int lim = accumulate(A + 1, A + nArr + 1, 0);
    dp[0][0][0] = 1;
    REP(pos, nArr) REP(cur_or, lim) REP(gr, r){
        FOR(nw_pos, pos + 1, nArr){
            int v = (sum[nw_pos] - sum[pos]);
            dp[nw_pos][cur_or | v][gr + 1] |= dp[pos][cur_or][gr];
        }
    }
    FOR(cur_or, 0, lim) FOR(gr, l, r) if(dp[nArr][cur_or][gr]){
        return void(cout << cur_or);
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    init();
    process();
}

Compilation message

sculpture.cpp: In function 'void process()':
sculpture.cpp:48:9: warning: unused variable 'ans' [-Wunused-variable]
   48 |     int ans = 0;
      |         ^~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 464 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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