oj.uz

Submission #523127

# Submission time Handle Problem Language Result Execution time Memory
523127 2022-02-07T06:02:01 Z vonatlus Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1000 ms 324 KB 
/// adil sultanov | vonat1us 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 2e3+10;

void ma1n() {
    ll n, L, R;
    cin >> n >> L >> R;
    vector<ll> a(n);
    for (ll& x : a) cin >> x;
    ll ans = (1ll<<60);
    for (int mask = 0; mask < (1<<n); ++mask) {
        ll sum = 0, res = 0;
        for (int i = 0; i < n; ++i) {
            if (mask>>i&1) {
                res |= sum;
                sum = 0;
            }
            sum += a[i];
        }
        res |= sum;
        int cnt = __builtin_popcount(mask)+1;
        if (L <= cnt && cnt <= R) ans = min(ans, res);
    }
    cout << ans;
    /*
    for (int i = 0; i < n; ++i) {
        dp[i][1] = (i ? dp[i-1][1] : 0ll) + a[i];
    }
    for (int k = 2; k <= R; ++k) {
        for (int i = 0; i < n; ++i) {
            ll sum = 0;            
            dp[i][k] = (1ll<<50);
            for (int j = i; j >= k-1; --j) {
                sum += a[j];
                dp[i][k] = min(dp[i][k], (dp[j-1][k-1]|sum));
            } 
        }
    }
    ll ans = (1ll<<50);
    for (int k = L; k <= R; ++k) {
        ans = min(ans, dp[n-1][k]);
    }
    cout << ans;    */
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 9 ms 304 KB Output is correct
8 Correct 55 ms 288 KB Output is correct
9 Correct 57 ms 284 KB Output is correct
10 Correct 57 ms 288 KB Output is correct
11 Correct 55 ms 288 KB Output is correct
12 Correct 57 ms 292 KB Output is correct
13 Correct 56 ms 288 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 7 ms 204 KB Output is correct
8 Correct 57 ms 204 KB Output is correct
9 Correct 57 ms 292 KB Output is correct
10 Correct 57 ms 288 KB Output is correct
11 Correct 56 ms 204 KB Output is correct
12 Correct 54 ms 204 KB Output is correct
13 Correct 60 ms 324 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 7 ms 308 KB Output is correct
8 Correct 55 ms 204 KB Output is correct
9 Correct 57 ms 204 KB Output is correct
10 Correct 54 ms 288 KB Output is correct
11 Correct 58 ms 292 KB Output is correct
12 Correct 56 ms 296 KB Output is correct
13 Correct 62 ms 284 KB Output is correct
14 Correct 112 ms 204 KB Output is correct
15 Execution timed out 1090 ms 204 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 8 ms 204 KB Output is correct
8 Correct 55 ms 204 KB Output is correct
9 Correct 54 ms 204 KB Output is correct
10 Correct 54 ms 284 KB Output is correct
11 Correct 56 ms 288 KB Output is correct
12 Correct 54 ms 204 KB Output is correct
13 Correct 55 ms 324 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 0 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 7 ms 204 KB Output is correct
8 Correct 54 ms 204 KB Output is correct
9 Correct 55 ms 204 KB Output is correct
10 Correct 57 ms 300 KB Output is correct
11 Correct 54 ms 204 KB Output is correct
12 Correct 55 ms 204 KB Output is correct
13 Correct 56 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 27 ms 204 KB Output is correct
18 Correct 60 ms 204 KB Output is correct
19 Correct 56 ms 288 KB Output is correct
20 Correct 55 ms 204 KB Output is correct
21 Correct 55 ms 204 KB Output is correct
22 Correct 56 ms 288 KB Output is correct
23 Correct 57 ms 288 KB Output is correct
24 Correct 111 ms 204 KB Output is correct
25 Execution timed out 1099 ms 204 KB Time limit exceeded
26 Halted 0 ms 0 KB -