oj.uz

Submission #518993

# Submission time Handle Problem Language Result Execution time Memory
518993 2022-01-25T10:08:09 Z SmolBrain Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 181 ms 432 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << 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, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

bool dp1[105][105];
ll dp2[2005];

void solve(int test_case)
{
    ll n, x, y; cin >> n >> x >> y;
    vector<ll> a(n + 5);
    rep1(i, n) cin >> a[i];

    if (n <= 100) {
        ll mask = 0;

        for (int bit = 49; bit >= 0; --bit) {
            ll f = 1ll << bit;
            mask |= f;
            memset(dp1, 0, sizeof dp1);
            dp1[0][0] = 1;

            rep1(i, n) {
                rep1(j, n) {
                    ll sum = 0;

                    for (int k = i; k >= 1; --k) {
                        sum += a[k];
                        if (!(sum & mask)) {
                            dp1[i][j] |= dp1[k - 1][j - 1];
                        }
                    }
                }
            }

            bool flag = false;
            for (int j = x; j <= y; ++j) {
                if (dp1[n][j]) flag = true;
            }

            if (!flag) {
                mask ^= f;
            }
        }

        ll ans = (1ll << 50) - 1 - mask;
        cout << ans << endl;
    }
    else {
        ll mask = 0;
        for (int bit = 49; bit >= 0; --bit) {
            ll f = 1ll << bit;
            mask |= f;

            rep(i, n + 5) dp2[i] = inf2;
            dp2[0] = 0;

            rep1(i, n) {
                ll sum = 0;
                for (int j = i; j >= 1; --j) {
                    sum += a[j];
                    if (!(sum & mask)) {
                        dp2[i] = min(dp2[i], 1 + dp2[j - 1]);
                    }
                }
            }

            bool flag = false;
            if (dp2[n] <= y) flag = true;

            if (!flag) {
                mask ^= f;
            }
        }

        ll ans = (1ll << 50) - 1 - mask;
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 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 332 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 316 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 316 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 5 ms 432 KB Output is correct
31 Correct 5 ms 204 KB Output is correct
32 Correct 7 ms 204 KB Output is correct
33 Correct 5 ms 204 KB Output is correct
34 Correct 5 ms 204 KB Output is correct
35 Correct 5 ms 208 KB Output is correct
36 Correct 5 ms 320 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 320 KB Output is correct
17 Correct 3 ms 320 KB Output is correct
18 Correct 5 ms 204 KB Output is correct
19 Correct 5 ms 320 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Correct 5 ms 204 KB Output is correct
22 Correct 5 ms 324 KB Output is correct
23 Correct 5 ms 204 KB Output is correct
24 Correct 5 ms 328 KB Output is correct
25 Correct 10 ms 204 KB Output is correct
26 Correct 19 ms 316 KB Output is correct
27 Correct 30 ms 316 KB Output is correct
28 Correct 41 ms 304 KB Output is correct
29 Correct 46 ms 304 KB Output is correct
30 Correct 43 ms 204 KB Output is correct
31 Correct 40 ms 204 KB Output is correct
32 Correct 41 ms 204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 252 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 2 ms 204 KB Output is correct
40 Correct 3 ms 204 KB Output is correct
41 Correct 6 ms 324 KB Output is correct
42 Correct 5 ms 324 KB Output is correct
43 Correct 5 ms 204 KB Output is correct
44 Correct 5 ms 332 KB Output is correct
45 Correct 6 ms 324 KB Output is correct
46 Correct 5 ms 204 KB Output is correct
47 Correct 6 ms 332 KB Output is correct
48 Correct 15 ms 332 KB Output is correct
49 Correct 22 ms 316 KB Output is correct
50 Correct 31 ms 208 KB Output is correct
51 Correct 41 ms 312 KB Output is correct
52 Correct 40 ms 212 KB Output is correct
53 Correct 41 ms 316 KB Output is correct
54 Correct 41 ms 212 KB Output is correct
55 Correct 41 ms 204 KB Output is correct
56 Correct 4 ms 204 KB Output is correct
57 Correct 15 ms 328 KB Output is correct
58 Correct 24 ms 204 KB Output is correct
59 Correct 29 ms 204 KB Output is correct
60 Correct 30 ms 204 KB Output is correct
61 Correct 31 ms 308 KB Output is correct
62 Correct 32 ms 320 KB Output is correct
63 Correct 31 ms 204 KB Output is correct
64 Correct 30 ms 204 KB Output is correct
65 Correct 6 ms 316 KB Output is correct
66 Correct 14 ms 380 KB Output is correct
67 Correct 17 ms 204 KB Output is correct
68 Correct 23 ms 204 KB Output is correct
69 Correct 30 ms 204 KB Output is correct
70 Correct 29 ms 304 KB Output is correct
71 Correct 31 ms 204 KB Output is correct
72 Correct 40 ms 304 KB Output is correct
73 Correct 31 ms 204 KB Output is correct
74 Correct 33 ms 308 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 3 ms 204 KB Output is correct
28 Correct 5 ms 204 KB Output is correct
29 Correct 6 ms 204 KB Output is correct
30 Correct 5 ms 204 KB Output is correct
31 Correct 5 ms 204 KB Output is correct
32 Correct 5 ms 320 KB Output is correct
33 Correct 6 ms 204 KB Output is correct
34 Correct 7 ms 316 KB Output is correct
35 Correct 11 ms 204 KB Output is correct
36 Correct 19 ms 328 KB Output is correct
37 Correct 35 ms 204 KB Output is correct
38 Correct 40 ms 204 KB Output is correct
39 Correct 40 ms 204 KB Output is correct
40 Correct 49 ms 308 KB Output is correct
41 Correct 42 ms 204 KB Output is correct
42 Correct 40 ms 204 KB Output is correct
43 Correct 4 ms 204 KB Output is correct
44 Correct 15 ms 204 KB Output is correct
45 Correct 23 ms 204 KB Output is correct
46 Correct 36 ms 376 KB Output is correct
47 Correct 31 ms 204 KB Output is correct
48 Correct 31 ms 204 KB Output is correct
49 Correct 32 ms 204 KB Output is correct
50 Correct 32 ms 320 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 15 ms 336 KB Output is correct
53 Correct 23 ms 320 KB Output is correct
54 Correct 43 ms 348 KB Output is correct
55 Correct 46 ms 324 KB Output is correct
56 Correct 158 ms 332 KB Output is correct
57 Correct 155 ms 356 KB Output is correct
58 Correct 176 ms 356 KB Output is correct
59 Correct 149 ms 356 KB Output is correct
60 Correct 181 ms 332 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 24 ms 324 KB Output is correct
63 Correct 44 ms 332 KB Output is correct
64 Correct 47 ms 328 KB Output is correct
65 Correct 79 ms 340 KB Output is correct
66 Correct 118 ms 332 KB Output is correct
67 Correct 160 ms 348 KB Output is correct
68 Correct 169 ms 352 KB Output is correct
69 Correct 155 ms 352 KB Output is correct