oj.uz

Submission #92764

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

const int N = 505, M = 260010, P = 4;
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 376 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 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 380 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 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 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 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 380 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 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 376 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 11 ms 760 KB Output is correct
25 Correct 16 ms 1016 KB Output is correct
26 Correct 18 ms 1116 KB Output is correct
27 Correct 14 ms 1016 KB Output is correct
28 Correct 12 ms 1016 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 18 ms 1020 KB Output is correct
32 Correct 12 ms 760 KB Output is correct
33 Correct 3 ms 1144 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 12 ms 1016 KB Output is correct
36 Correct 12 ms 760 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 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 380 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 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 376 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 11 ms 760 KB Output is correct
25 Correct 16 ms 1016 KB Output is correct
26 Correct 18 ms 1116 KB Output is correct
27 Correct 14 ms 1016 KB Output is correct
28 Correct 12 ms 1016 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 18 ms 1020 KB Output is correct
32 Correct 12 ms 760 KB Output is correct
33 Correct 3 ms 1144 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 12 ms 1016 KB Output is correct
36 Correct 12 ms 760 KB Output is correct
37 Correct 113 ms 1892 KB Output is correct
38 Correct 115 ms 1964 KB Output is correct
39 Correct 16 ms 2936 KB Output is correct
40 Correct 298 ms 2936 KB Output is correct
41 Correct 20 ms 3192 KB Output is correct
42 Correct 252 ms 2808 KB Output is correct
43 Correct 419 ms 4592 KB Output is correct
44 Correct 456 ms 4856 KB Output is correct
45 Correct 451 ms 4728 KB Output is correct
46 Correct 162 ms 2812 KB Output is correct
47 Correct 266 ms 2940 KB Output is correct
48 Correct 366 ms 4984 KB Output is correct
49 Correct 243 ms 4728 KB Output is correct
50 Correct 274 ms 2936 KB Output is correct
51 Correct 2 ms 256 KB Output is correct
52 Correct 633 ms 5852 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 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 380 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 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 376 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 11 ms 760 KB Output is correct
25 Correct 16 ms 1016 KB Output is correct
26 Correct 18 ms 1116 KB Output is correct
27 Correct 14 ms 1016 KB Output is correct
28 Correct 12 ms 1016 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 18 ms 1020 KB Output is correct
32 Correct 12 ms 760 KB Output is correct
33 Correct 3 ms 1144 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 12 ms 1016 KB Output is correct
36 Correct 12 ms 760 KB Output is correct
37 Correct 113 ms 1892 KB Output is correct
38 Correct 115 ms 1964 KB Output is correct
39 Correct 16 ms 2936 KB Output is correct
40 Correct 298 ms 2936 KB Output is correct
41 Correct 20 ms 3192 KB Output is correct
42 Correct 252 ms 2808 KB Output is correct
43 Correct 419 ms 4592 KB Output is correct
44 Correct 456 ms 4856 KB Output is correct
45 Correct 451 ms 4728 KB Output is correct
46 Correct 162 ms 2812 KB Output is correct
47 Correct 266 ms 2940 KB Output is correct
48 Correct 366 ms 4984 KB Output is correct
49 Correct 243 ms 4728 KB Output is correct
50 Correct 274 ms 2936 KB Output is correct
51 Correct 2 ms 256 KB Output is correct
52 Correct 633 ms 5852 KB Output is correct
53 Correct 494 ms 3960 KB Output is correct
54 Correct 760 ms 4724 KB Output is correct
55 Execution timed out 1087 ms 8696 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 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 380 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 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 376 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 7 ms 632 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 11 ms 760 KB Output is correct
25 Correct 16 ms 1016 KB Output is correct
26 Correct 18 ms 1116 KB Output is correct
27 Correct 14 ms 1016 KB Output is correct
28 Correct 12 ms 1016 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 18 ms 1020 KB Output is correct
32 Correct 12 ms 760 KB Output is correct
33 Correct 3 ms 1144 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 12 ms 1016 KB Output is correct
36 Correct 12 ms 760 KB Output is correct
37 Correct 113 ms 1892 KB Output is correct
38 Correct 115 ms 1964 KB Output is correct
39 Correct 16 ms 2936 KB Output is correct
40 Correct 298 ms 2936 KB Output is correct
41 Correct 20 ms 3192 KB Output is correct
42 Correct 252 ms 2808 KB Output is correct
43 Correct 419 ms 4592 KB Output is correct
44 Correct 456 ms 4856 KB Output is correct
45 Correct 451 ms 4728 KB Output is correct
46 Correct 162 ms 2812 KB Output is correct
47 Correct 266 ms 2940 KB Output is correct
48 Correct 366 ms 4984 KB Output is correct
49 Correct 243 ms 4728 KB Output is correct
50 Correct 274 ms 2936 KB Output is correct
51 Correct 2 ms 256 KB Output is correct
52 Correct 633 ms 5852 KB Output is correct
53 Correct 494 ms 3960 KB Output is correct
54 Correct 760 ms 4724 KB Output is correct
55 Execution timed out 1087 ms 8696 KB Time limit exceeded
56 Halted 0 ms 0 KB -