oj.uz

Submission #173220

# Submission time Handle Problem Language Result Execution time Memory
173220 2020-01-03T15:32:32 Z DeD_TihoN Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 6796 KB 
#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#define ull unsigned long long
#define endl '\n'
#define y1 yaumru
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter vector<int>::iterator
using namespace std;
using namespace __gnu_pbds;

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

template<class T>
using ordered_multiset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rnd1(chrono::steady_clock::now().time_since_epoch().count());

//find_by_order
//order_of_key

const int N=500+1;
const int inf=1e9+1e9;
const int mod=1e9+7;
const ld eps=1e-9;
const int M=200000;
const int M1=250000;

int a[N];
bool used[N];
bitset<M1>dp[N];
bitset<M>dp1[N];

main ()
{
    ios;
    int n;
    cin>>n;
    for (int i=1;i<=n;++i){
        cin>>a[i];
    }
    if (n<=350){
        int sum=0;
        bool c1=false;
        bool c2=false;
        for (int i=1;i<=n;++i){
            sum+=a[i];
            if (a[i]%2==1){
                c1=true;
            }
            else {
                c2=true;
            }
        }
        if (c1 && c2){
            cout<<0<<endl;
            exit(0);
        }
        if (sum%2==1){
            cout<<0<<endl;
            exit(0);
        }
        for (int i=0;i<=n;++i){
            if (i==0){
                dp1[i][0]=1;
                for (int j=1;j<=n;++j){
                    if (j==i)continue;
                    bitset<M>f=(dp1[i]<<a[j]);
                    dp1[i]=(dp1[i]|f);
                }
                if (dp1[0][sum/2]==0){
                    cout<<0<<endl;
                    exit(0);
                }
            }
            else {
                if (!used[a[i]]){
                    used[a[i]]=true;
                    dp1[a[i]][0]=1;
                    for (int j=1;j<=n;++j){
                        if (j==i)continue;
                        bitset<M>f=(dp1[a[i]]<<a[j]);
                        dp1[a[i]]=(dp1[a[i]]|f);
                    }
                }
            }
        }
        vector<int>ans;
        for (int i=1;i<=M;++i){
            bool cc=true;
            for (int j=1;j<=n;++j){
                if ((sum-a[j]+i)%2==1){
                    cc=false;
                    break;
                }
                if ((sum-a[j]+i)%2==0){
                    if (dp1[a[j]][(sum-a[j]+i)/2]==0){
                        cc=false;
                        break;
                    }
                }
            }
            if (cc)ans.pb(i);
        }
        cout<<(int)ans.size()<<endl;
        for (int i=0;i<ans.size();++i){
            cout<<ans[i]<<' ';
        }
    }
    else {
        int sum=0;
        bool c1=false;
        bool c2=false;
        for (int i=1;i<=n;++i){
            sum+=a[i];
            if (a[i]%2==1){
                c1=true;
            }
            else {
                c2=true;
            }
        }
        if (c1 && c2){
            cout<<0<<endl;
            exit(0);
        }
        if (sum%2==1){
            cout<<0<<endl;
            exit(0);
        }
        for (int i=0;i<=n;++i){
            if (i==0){
                dp[i][0]=1;
                for (int j=1;j<=n;++j){
                    if (j==i)continue;
                    bitset<M1>f=(dp[i]<<a[j]);
                    dp[i]=(dp[i]|f);
                }
                if (dp[0][sum/2]==0){
                    cout<<0<<endl;
                    exit(0);
                }
            }
            else {
                if (!used[a[i]]){
                    used[a[i]]=true;
                    dp[a[i]][0]=1;
                    for (int j=1;j<=n;++j){
                        if (j==i)continue;
                        bitset<M1>f=(dp[a[i]]<<a[j]);
                        dp[a[i]]=(dp[a[i]]|f);
                    }
                }
            }
        }
        vector<int>ans;
        for (int i=1;i<=M1;++i){
            bool cc=true;
            for (int j=1;j<=n;++j){
                if ((sum-a[j]+i)%2==1){
                    cc=false;
                    break;
                }
                if ((sum-a[j]+i)%2==0){
                    if (dp[a[j]][(sum-a[j]+i)/2]==0){
                        cc=false;
                        break;
                    }
                }
            }
            if (cc)ans.pb(i);
        }
        cout<<(int)ans.size()<<endl;
        for (int i=0;i<ans.size();++i){
            cout<<ans[i]<<' ';
        }
    }
}

Compilation message

bootfall.cpp:44:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main ()
       ^
bootfall.cpp: In function 'int main()':
bootfall.cpp:116:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<ans.size();++i){
                      ~^~~~~~~~~~~
bootfall.cpp:184:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i=0;i<ans.size();++i){
                      ~^~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 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 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 3 ms 504 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 31 ms 1528 KB Output is correct
22 Correct 38 ms 1628 KB Output is correct
23 Correct 20 ms 1272 KB Output is correct
24 Correct 52 ms 1656 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 13 ms 760 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 9 ms 604 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 35 ms 1276 KB Output is correct
32 Correct 59 ms 1784 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 508 KB Output is correct
35 Correct 8 ms 504 KB Output is correct
36 Correct 64 ms 1912 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 31 ms 1528 KB Output is correct
22 Correct 38 ms 1628 KB Output is correct
23 Correct 20 ms 1272 KB Output is correct
24 Correct 52 ms 1656 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 13 ms 760 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 9 ms 604 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 35 ms 1276 KB Output is correct
32 Correct 59 ms 1784 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 508 KB Output is correct
35 Correct 8 ms 504 KB Output is correct
36 Correct 64 ms 1912 KB Output is correct
37 Correct 126 ms 1936 KB Output is correct
38 Correct 133 ms 2056 KB Output is correct
39 Correct 9 ms 504 KB Output is correct
40 Correct 452 ms 4532 KB Output is correct
41 Correct 9 ms 632 KB Output is correct
42 Correct 342 ms 3916 KB Output is correct
43 Correct 100 ms 1592 KB Output is correct
44 Correct 100 ms 1528 KB Output is correct
45 Correct 102 ms 1656 KB Output is correct
46 Correct 433 ms 4388 KB Output is correct
47 Correct 340 ms 3960 KB Output is correct
48 Correct 37 ms 888 KB Output is correct
49 Correct 19 ms 636 KB Output is correct
50 Correct 399 ms 4432 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 70 ms 1272 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 31 ms 1528 KB Output is correct
22 Correct 38 ms 1628 KB Output is correct
23 Correct 20 ms 1272 KB Output is correct
24 Correct 52 ms 1656 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 13 ms 760 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 9 ms 604 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 35 ms 1276 KB Output is correct
32 Correct 59 ms 1784 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 508 KB Output is correct
35 Correct 8 ms 504 KB Output is correct
36 Correct 64 ms 1912 KB Output is correct
37 Correct 126 ms 1936 KB Output is correct
38 Correct 133 ms 2056 KB Output is correct
39 Correct 9 ms 504 KB Output is correct
40 Correct 452 ms 4532 KB Output is correct
41 Correct 9 ms 632 KB Output is correct
42 Correct 342 ms 3916 KB Output is correct
43 Correct 100 ms 1592 KB Output is correct
44 Correct 100 ms 1528 KB Output is correct
45 Correct 102 ms 1656 KB Output is correct
46 Correct 433 ms 4388 KB Output is correct
47 Correct 340 ms 3960 KB Output is correct
48 Correct 37 ms 888 KB Output is correct
49 Correct 19 ms 636 KB Output is correct
50 Correct 399 ms 4432 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 70 ms 1272 KB Output is correct
53 Correct 438 ms 4344 KB Output is correct
54 Correct 524 ms 4316 KB Output is correct
55 Correct 119 ms 1552 KB Output is correct
56 Correct 510 ms 4644 KB Output is correct
57 Correct 135 ms 1656 KB Output is correct
58 Correct 754 ms 6236 KB Output is correct
59 Correct 454 ms 3848 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 462 ms 3960 KB Output is correct
62 Correct 250 ms 2600 KB Output is correct
63 Correct 164 ms 1960 KB Output is correct
64 Correct 154 ms 1916 KB Output is correct
65 Correct 36 ms 760 KB Output is correct
66 Correct 138 ms 1624 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 5 ms 808 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 7 ms 760 KB Output is correct
12 Correct 7 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 760 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 7 ms 760 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 31 ms 1528 KB Output is correct
22 Correct 38 ms 1628 KB Output is correct
23 Correct 20 ms 1272 KB Output is correct
24 Correct 52 ms 1656 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 13 ms 760 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 9 ms 604 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 35 ms 1276 KB Output is correct
32 Correct 59 ms 1784 KB Output is correct
33 Correct 5 ms 504 KB Output is correct
34 Correct 5 ms 508 KB Output is correct
35 Correct 8 ms 504 KB Output is correct
36 Correct 64 ms 1912 KB Output is correct
37 Correct 126 ms 1936 KB Output is correct
38 Correct 133 ms 2056 KB Output is correct
39 Correct 9 ms 504 KB Output is correct
40 Correct 452 ms 4532 KB Output is correct
41 Correct 9 ms 632 KB Output is correct
42 Correct 342 ms 3916 KB Output is correct
43 Correct 100 ms 1592 KB Output is correct
44 Correct 100 ms 1528 KB Output is correct
45 Correct 102 ms 1656 KB Output is correct
46 Correct 433 ms 4388 KB Output is correct
47 Correct 340 ms 3960 KB Output is correct
48 Correct 37 ms 888 KB Output is correct
49 Correct 19 ms 636 KB Output is correct
50 Correct 399 ms 4432 KB Output is correct
51 Correct 2 ms 380 KB Output is correct
52 Correct 70 ms 1272 KB Output is correct
53 Correct 438 ms 4344 KB Output is correct
54 Correct 524 ms 4316 KB Output is correct
55 Correct 119 ms 1552 KB Output is correct
56 Correct 510 ms 4644 KB Output is correct
57 Correct 135 ms 1656 KB Output is correct
58 Correct 754 ms 6236 KB Output is correct
59 Correct 454 ms 3848 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 462 ms 3960 KB Output is correct
62 Correct 250 ms 2600 KB Output is correct
63 Correct 164 ms 1960 KB Output is correct
64 Correct 154 ms 1916 KB Output is correct
65 Correct 36 ms 760 KB Output is correct
66 Correct 138 ms 1624 KB Output is correct
67 Execution timed out 1076 ms 6796 KB Time limit exceeded
68 Halted 0 ms 0 KB -