oj.uz

Submission #92762

# Submission time Handle Problem Language Result Execution time Memory
92762 2019-01-04T13:07:45 Z toloraia Bootfall (IZhO17_bootfall) C++14
44 / 100
 1000 ms 12008 KB 
#include <bits/stdc++.h>
#define ll long long int
#pragma GCC("O3")
using namespace std;

const int N = 505, M = 260010, P = 6;
const ll B = 4e18;

int n;
int a[N];
bool F[M], f;
int S;
ll DP[M][P];
ll dp[M][P];
int ans[M], ANS[M];
int V[M], np;
int main()
{
    cin>>n;
    for (int i = 1; i <= n; i++){
        cin>>a[i];
        S += a[i];
    }
    sort (a + 1, a + n + 1);
    bool ok = 0;
    for (int i = 2; i <= n; i++)
        if ((a[i] - a[i - 1]) % 2 == 1)
            ok = 1;
    if (S % 2 == 1)
        ok = 1;
    if (ok){
        cout<<0<<endl;
        return 0;
    }
    F[0] = 1;
    DP[0][0] = 1;
    for (int i = 1; i <= n; i++){
        for (int j = S; j >= a[i]; j--)
            if (F[j - a[i]]){
                F[j] = 1;
                for (int l = 0; l < P; l++){
                    DP[j][l] += DP[j - a[i]][l];
                    if (DP[j][l] >= B){
                        DP[j][l + 1]++;
                        DP[j][l] -= B;
                    }
                }
            }
    }
    if (F[S / 2] == 0){
        cout<<0<<endl;
        return 0;
    }
    for (int i = 0; i <= S; i++)
        if (F[i])
            V[np++] = i;
    for (int I = 1; I <= n; ++I){
        for (int i1 = 0; i1 < np; ++i1){
            int i = V[i1];
            for (int j = 0; j < P; j++)
                dp[i][j] = DP[i][j];
            ans[abs (S - 2 * i - a[I])] = 0;
        }
        for (int i1 = 0; i1 < np; ++i1){
            int i = V[i1];
                f = 1;
                if (i >= a[I]){
                    f = 0;
                    for (int j = 0; j < P; ++j){
                        dp[i][j] -= dp[i - a[I]][j];
                        if (dp[i][j] < 0){
                            dp[i][j] += B;
                            dp[i][j + 1]--;
                        }
                        if (dp[i][j])
                            f = 1;
                    }
                }
                if (f && ans[abs (S - a[I] - 2 * i)] == 0){
                    ans[abs (S - a[I] - 2 * i)] = 1;
                    ANS[abs (S - a[I] - 2 * i)]++;
                }
            }
    }
    np = 0;
    for (int i = 1; i <= S; i++)
        if (ANS[i] == n)
            V[np++] = i;
    cout<<np<<endl;
    for (int i = 0; i < np; i++)
        cout<<V[i]<<" ";
    cout<<endl;
    return 0;
}

Compilation message

bootfall.cpp:3:0: warning: ignoring #pragma GCC  [-Wunknown-pragmas]
 #pragma GCC("O3")

Subtask #1
6.0 / 6.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 504 KB Output is correct
9 Correct 2 ms 256 KB Output is correct

Subtask #2
7.0 / 7.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 504 KB Output is correct
9 Correct 2 ms 256 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 308 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct

Subtask #3
15.0 / 15.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 504 KB Output is correct
9 Correct 2 ms 256 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 308 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 13 ms 888 KB Output is correct
25 Correct 20 ms 1272 KB Output is correct
26 Correct 25 ms 1400 KB Output is correct
27 Correct 16 ms 1272 KB Output is correct
28 Correct 14 ms 1400 KB Output is correct
29 Correct 16 ms 1400 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 23 ms 1144 KB Output is correct
32 Correct 15 ms 892 KB Output is correct
33 Correct 4 ms 1272 KB Output is correct
34 Correct 3 ms 1272 KB Output is correct
35 Correct 15 ms 1400 KB Output is correct
36 Correct 15 ms 888 KB Output is correct

Subtask #4
16.0 / 16.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 504 KB Output is correct
9 Correct 2 ms 256 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 308 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 13 ms 888 KB Output is correct
25 Correct 20 ms 1272 KB Output is correct
26 Correct 25 ms 1400 KB Output is correct
27 Correct 16 ms 1272 KB Output is correct
28 Correct 14 ms 1400 KB Output is correct
29 Correct 16 ms 1400 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 23 ms 1144 KB Output is correct
32 Correct 15 ms 892 KB Output is correct
33 Correct 4 ms 1272 KB Output is correct
34 Correct 3 ms 1272 KB Output is correct
35 Correct 15 ms 1400 KB Output is correct
36 Correct 15 ms 888 KB Output is correct
37 Correct 133 ms 2504 KB Output is correct
38 Correct 137 ms 2552 KB Output is correct
39 Correct 17 ms 3064 KB Output is correct
40 Correct 351 ms 3900 KB Output is correct
41 Correct 21 ms 3192 KB Output is correct
42 Correct 298 ms 3712 KB Output is correct
43 Correct 512 ms 6392 KB Output is correct
44 Correct 526 ms 6500 KB Output is correct
45 Correct 535 ms 6520 KB Output is correct
46 Correct 199 ms 3704 KB Output is correct
47 Correct 308 ms 3932 KB Output is correct
48 Correct 428 ms 6604 KB Output is correct
49 Correct 281 ms 6264 KB Output is correct
50 Correct 309 ms 3892 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 692 ms 7928 KB Output is correct

Subtask #5
0 / 21.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 504 KB Output is correct
9 Correct 2 ms 256 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 308 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 13 ms 888 KB Output is correct
25 Correct 20 ms 1272 KB Output is correct
26 Correct 25 ms 1400 KB Output is correct
27 Correct 16 ms 1272 KB Output is correct
28 Correct 14 ms 1400 KB Output is correct
29 Correct 16 ms 1400 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 23 ms 1144 KB Output is correct
32 Correct 15 ms 892 KB Output is correct
33 Correct 4 ms 1272 KB Output is correct
34 Correct 3 ms 1272 KB Output is correct
35 Correct 15 ms 1400 KB Output is correct
36 Correct 15 ms 888 KB Output is correct
37 Correct 133 ms 2504 KB Output is correct
38 Correct 137 ms 2552 KB Output is correct
39 Correct 17 ms 3064 KB Output is correct
40 Correct 351 ms 3900 KB Output is correct
41 Correct 21 ms 3192 KB Output is correct
42 Correct 298 ms 3712 KB Output is correct
43 Correct 512 ms 6392 KB Output is correct
44 Correct 526 ms 6500 KB Output is correct
45 Correct 535 ms 6520 KB Output is correct
46 Correct 199 ms 3704 KB Output is correct
47 Correct 308 ms 3932 KB Output is correct
48 Correct 428 ms 6604 KB Output is correct
49 Correct 281 ms 6264 KB Output is correct
50 Correct 309 ms 3892 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 692 ms 7928 KB Output is correct
53 Correct 561 ms 5420 KB Output is correct
54 Correct 898 ms 6648 KB Output is correct
55 Execution timed out 1072 ms 12008 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 35.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 504 KB Output is correct
9 Correct 2 ms 256 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 308 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 8 ms 760 KB Output is correct
23 Correct 5 ms 632 KB Output is correct
24 Correct 13 ms 888 KB Output is correct
25 Correct 20 ms 1272 KB Output is correct
26 Correct 25 ms 1400 KB Output is correct
27 Correct 16 ms 1272 KB Output is correct
28 Correct 14 ms 1400 KB Output is correct
29 Correct 16 ms 1400 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 23 ms 1144 KB Output is correct
32 Correct 15 ms 892 KB Output is correct
33 Correct 4 ms 1272 KB Output is correct
34 Correct 3 ms 1272 KB Output is correct
35 Correct 15 ms 1400 KB Output is correct
36 Correct 15 ms 888 KB Output is correct
37 Correct 133 ms 2504 KB Output is correct
38 Correct 137 ms 2552 KB Output is correct
39 Correct 17 ms 3064 KB Output is correct
40 Correct 351 ms 3900 KB Output is correct
41 Correct 21 ms 3192 KB Output is correct
42 Correct 298 ms 3712 KB Output is correct
43 Correct 512 ms 6392 KB Output is correct
44 Correct 526 ms 6500 KB Output is correct
45 Correct 535 ms 6520 KB Output is correct
46 Correct 199 ms 3704 KB Output is correct
47 Correct 308 ms 3932 KB Output is correct
48 Correct 428 ms 6604 KB Output is correct
49 Correct 281 ms 6264 KB Output is correct
50 Correct 309 ms 3892 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 692 ms 7928 KB Output is correct
53 Correct 561 ms 5420 KB Output is correct
54 Correct 898 ms 6648 KB Output is correct
55 Execution timed out 1072 ms 12008 KB Time limit exceeded
56 Halted 0 ms 0 KB -