Submission #38797

# Submission time Handle Problem Language Result Execution time Memory
38797 2018-01-06T15:20:39 Z DenXman111 Bootfall (IZhO17_bootfall) C++14
28 / 100
56 ms 7208 KB
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <cstring>
#include <iomanip>
#include <set>
#include <sstream>
#include <ctime>
#include <bitset>

#define rust(a, b, c, d) sqrt(sqr(a - c) + sqr(b - d))
#define sqr(a) (a)*(a)
#define p_b push_back
#define m_p make_pair
#define fi first
#define se second
#define endl "\n"

typedef long long ll;
typedef long double ld;
const int MAXINT = 2147483640;
const ll MAXLL = 9223372036854775800LL;
const ll MAXN = 323456;
const ll MOD = 1000000123;
const ll MAXANS = 1000000007;
using namespace std;

int a[MAXN], ans[MAXN], dp[MAXN], d[MAXN];
int main()
{
//    freopen("bootfall.in", "r", stdin);
//    freopen("bootfall.out", "w", stdout);
    int n, i, j, sum = 0, x = 0;
    cin >> n;
    dp[0] = 1;
    if (sum % 2 == 1 || dp[sum / 2] == 0) return cout << 0 << endl, 0;
    for (j = 0; j <= sum; j++) d[j] = dp[j];
    bitset < 25555 > dp, now, zero;
    dp[0] = 1;
    for (i = 1; i <= n; i++){
        cin >> a[i];
        now = dp;
        dp <<= a[i];
        dp |= now;
        sum += a[i];
    }
    if (sum % 2 == 1 || dp[sum / 2] == 0) return cout << 0, 0;

    for (i = 1; i <= n; i++){
        dp &= zero;
        dp[0] = 1;
        for (j = 1; j <= n; j++) if (j != i){
            now = dp;
            dp <<= a[j];
            dp |= now;
        }
        for (j = 0; j <= sum; j++) if (dp[j]){
            x = abs(sum - j - a[i] - j);
            if (ans[x] == i - 1) ans[x] = i;
        }
    }
    vector < int > v;
    for (i = 0; i <= sum; i++) if (ans[i] == n) v.p_b(i);
    cout << v.size() << endl;
    for (i = 0; i < v.size(); i++) cout << v[i] << " ";
    return 0;
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:71:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++) cout << v[i] << " ";
                   ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
10 Correct 0 ms 7068 KB Output is correct
11 Correct 0 ms 7068 KB Output is correct
12 Correct 0 ms 7068 KB Output is correct
13 Correct 0 ms 7068 KB Output is correct
14 Correct 0 ms 7068 KB Output is correct
15 Correct 0 ms 7068 KB Output is correct
16 Correct 0 ms 7068 KB Output is correct
17 Correct 0 ms 7068 KB Output is correct
18 Correct 0 ms 7068 KB Output is correct
19 Correct 0 ms 7068 KB Output is correct
20 Correct 0 ms 7068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
10 Correct 0 ms 7068 KB Output is correct
11 Correct 0 ms 7068 KB Output is correct
12 Correct 0 ms 7068 KB Output is correct
13 Correct 0 ms 7068 KB Output is correct
14 Correct 0 ms 7068 KB Output is correct
15 Correct 0 ms 7068 KB Output is correct
16 Correct 0 ms 7068 KB Output is correct
17 Correct 0 ms 7068 KB Output is correct
18 Correct 0 ms 7068 KB Output is correct
19 Correct 0 ms 7068 KB Output is correct
20 Correct 0 ms 7068 KB Output is correct
21 Correct 6 ms 7068 KB Output is correct
22 Correct 13 ms 7068 KB Output is correct
23 Correct 3 ms 7068 KB Output is correct
24 Correct 13 ms 7068 KB Output is correct
25 Correct 13 ms 7068 KB Output is correct
26 Correct 13 ms 7068 KB Output is correct
27 Correct 13 ms 7068 KB Output is correct
28 Correct 13 ms 7068 KB Output is correct
29 Correct 13 ms 7068 KB Output is correct
30 Correct 13 ms 7068 KB Output is correct
31 Correct 16 ms 7068 KB Output is correct
32 Correct 13 ms 7068 KB Output is correct
33 Correct 13 ms 7068 KB Output is correct
34 Correct 13 ms 7068 KB Output is correct
35 Correct 13 ms 7068 KB Output is correct
36 Correct 13 ms 7068 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
10 Correct 0 ms 7068 KB Output is correct
11 Correct 0 ms 7068 KB Output is correct
12 Correct 0 ms 7068 KB Output is correct
13 Correct 0 ms 7068 KB Output is correct
14 Correct 0 ms 7068 KB Output is correct
15 Correct 0 ms 7068 KB Output is correct
16 Correct 0 ms 7068 KB Output is correct
17 Correct 0 ms 7068 KB Output is correct
18 Correct 0 ms 7068 KB Output is correct
19 Correct 0 ms 7068 KB Output is correct
20 Correct 0 ms 7068 KB Output is correct
21 Correct 6 ms 7068 KB Output is correct
22 Correct 13 ms 7068 KB Output is correct
23 Correct 3 ms 7068 KB Output is correct
24 Correct 13 ms 7068 KB Output is correct
25 Correct 13 ms 7068 KB Output is correct
26 Correct 13 ms 7068 KB Output is correct
27 Correct 13 ms 7068 KB Output is correct
28 Correct 13 ms 7068 KB Output is correct
29 Correct 13 ms 7068 KB Output is correct
30 Correct 13 ms 7068 KB Output is correct
31 Correct 16 ms 7068 KB Output is correct
32 Correct 13 ms 7068 KB Output is correct
33 Correct 13 ms 7068 KB Output is correct
34 Correct 13 ms 7068 KB Output is correct
35 Correct 13 ms 7068 KB Output is correct
36 Correct 13 ms 7068 KB Output is correct
37 Correct 56 ms 7208 KB Output is correct
38 Correct 56 ms 7208 KB Output is correct
39 Incorrect 0 ms 7068 KB Output isn't correct
40 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
10 Correct 0 ms 7068 KB Output is correct
11 Correct 0 ms 7068 KB Output is correct
12 Correct 0 ms 7068 KB Output is correct
13 Correct 0 ms 7068 KB Output is correct
14 Correct 0 ms 7068 KB Output is correct
15 Correct 0 ms 7068 KB Output is correct
16 Correct 0 ms 7068 KB Output is correct
17 Correct 0 ms 7068 KB Output is correct
18 Correct 0 ms 7068 KB Output is correct
19 Correct 0 ms 7068 KB Output is correct
20 Correct 0 ms 7068 KB Output is correct
21 Correct 6 ms 7068 KB Output is correct
22 Correct 13 ms 7068 KB Output is correct
23 Correct 3 ms 7068 KB Output is correct
24 Correct 13 ms 7068 KB Output is correct
25 Correct 13 ms 7068 KB Output is correct
26 Correct 13 ms 7068 KB Output is correct
27 Correct 13 ms 7068 KB Output is correct
28 Correct 13 ms 7068 KB Output is correct
29 Correct 13 ms 7068 KB Output is correct
30 Correct 13 ms 7068 KB Output is correct
31 Correct 16 ms 7068 KB Output is correct
32 Correct 13 ms 7068 KB Output is correct
33 Correct 13 ms 7068 KB Output is correct
34 Correct 13 ms 7068 KB Output is correct
35 Correct 13 ms 7068 KB Output is correct
36 Correct 13 ms 7068 KB Output is correct
37 Correct 56 ms 7208 KB Output is correct
38 Correct 56 ms 7208 KB Output is correct
39 Incorrect 0 ms 7068 KB Output isn't correct
40 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 7068 KB Output is correct
2 Correct 0 ms 7068 KB Output is correct
3 Correct 0 ms 7068 KB Output is correct
4 Correct 0 ms 7068 KB Output is correct
5 Correct 0 ms 7068 KB Output is correct
6 Correct 0 ms 7068 KB Output is correct
7 Correct 0 ms 7068 KB Output is correct
8 Correct 0 ms 7068 KB Output is correct
9 Correct 0 ms 7068 KB Output is correct
10 Correct 0 ms 7068 KB Output is correct
11 Correct 0 ms 7068 KB Output is correct
12 Correct 0 ms 7068 KB Output is correct
13 Correct 0 ms 7068 KB Output is correct
14 Correct 0 ms 7068 KB Output is correct
15 Correct 0 ms 7068 KB Output is correct
16 Correct 0 ms 7068 KB Output is correct
17 Correct 0 ms 7068 KB Output is correct
18 Correct 0 ms 7068 KB Output is correct
19 Correct 0 ms 7068 KB Output is correct
20 Correct 0 ms 7068 KB Output is correct
21 Correct 6 ms 7068 KB Output is correct
22 Correct 13 ms 7068 KB Output is correct
23 Correct 3 ms 7068 KB Output is correct
24 Correct 13 ms 7068 KB Output is correct
25 Correct 13 ms 7068 KB Output is correct
26 Correct 13 ms 7068 KB Output is correct
27 Correct 13 ms 7068 KB Output is correct
28 Correct 13 ms 7068 KB Output is correct
29 Correct 13 ms 7068 KB Output is correct
30 Correct 13 ms 7068 KB Output is correct
31 Correct 16 ms 7068 KB Output is correct
32 Correct 13 ms 7068 KB Output is correct
33 Correct 13 ms 7068 KB Output is correct
34 Correct 13 ms 7068 KB Output is correct
35 Correct 13 ms 7068 KB Output is correct
36 Correct 13 ms 7068 KB Output is correct
37 Correct 56 ms 7208 KB Output is correct
38 Correct 56 ms 7208 KB Output is correct
39 Incorrect 0 ms 7068 KB Output isn't correct
40 Halted 0 ms 0 KB -