oj.uz

Submission #166928

# Submission time Handle Problem Language Result Execution time Memory
166928 2019-12-04T16:20:17 Z Hideo Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 18 ms 508 KB 
// Need to git gud and reach 1900+
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;

#define all(s) s.begin(), s.end()
#define ok puts("ok")
#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >
#define prev prev123
#define next next123
#define pow pow123
#define left left123
#define right right123

const int N = 2007;
const int INF = 1e9 + 7;

ll a[N];
int n, x, y;

main(){ // If you don't know what to do, check the text box at the bottom
    cin >> n >> x >> y;
    for (int i = 1; i <= n; i++)
        scanf("%lld", &a[i]);
    x++;
    if (x == 1){
        bool dp[N];

    }
    else {
        bool dp[107][107];
        memset(dp, false, sizeof(dp));
        dp[0][0] = true;
        ll mask = 0;
        x--;
        for (ll j = 45; j >= 0; j--){
            ll submask = (mask | (1LL << j)), s = 0;
            for (int i = 1; i <= n; i++){
                dp[i][0] = false;
                for (int g = 1; g <= min(i, y); g++){
                    dp[i][g] = false;
                    s = 0;
                    for (int l = i; l >= g; l--){
                        s += a[l];
                        if (s & submask)
                            continue;
                        dp[i][g] |= dp[l - 1][g - 1];
                    }
                }
            }
            bool b = false;
            for (int i = x; i <= y; i++){
                if (dp[n][i]){
                    b = true;
                    break;
                }
            }
            if (b)
                mask = submask;
        }
        printf("%lld", (mask ^ ((1LL << 46) - 1)));
    }
}

/*
    Totally not inspired by BenQ's template
    Things you should do:
    1. Look for stupid typos in code e.g 1 instead of -1 etc
    2. Check if there is no infinite loops
    3. "Measure twice, cut once"
    4. Stay focused

    6 1 3
    8 1 2 1 5 4
*/

Compilation message

sculpture.cpp:29:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){ // If you don't know what to do, check the text box at the bottom
      ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:35:14: warning: unused variable 'dp' [-Wunused-variable]
         bool dp[N];
              ^~
sculpture.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 252 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 252 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 252 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 4 ms 376 KB Output is correct
36 Correct 4 ms 376 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Correct 3 ms 256 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 4 ms 376 KB Output is correct
22 Correct 3 ms 256 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 4 ms 376 KB Output is correct
26 Correct 7 ms 376 KB Output is correct
27 Correct 13 ms 376 KB Output is correct
28 Correct 18 ms 256 KB Output is correct
29 Correct 18 ms 376 KB Output is correct
30 Correct 3 ms 424 KB Output is correct
31 Correct 16 ms 376 KB Output is correct
32 Correct 18 ms 376 KB Output is correct

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 404 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 256 KB Output is correct
30 Correct 2 ms 252 KB Output is correct
31 Correct 3 ms 256 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 4 ms 256 KB Output is correct
36 Correct 7 ms 376 KB Output is correct
37 Correct 14 ms 372 KB Output is correct
38 Correct 18 ms 380 KB Output is correct
39 Correct 18 ms 376 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 16 ms 412 KB Output is correct
42 Correct 18 ms 376 KB Output is correct
43 Correct 4 ms 376 KB Output is correct
44 Correct 6 ms 256 KB Output is correct
45 Correct 11 ms 376 KB Output is correct
46 Correct 14 ms 376 KB Output is correct
47 Correct 14 ms 380 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 16 ms 376 KB Output is correct
50 Correct 15 ms 376 KB Output is correct
51 Correct 9 ms 376 KB Output is correct
52 Runtime error 4 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -