oj.uz

Submission #566540

# Submission time Handle Problem Language Result Execution time Memory
566540 2022-05-22T11:38:17 Z milisav Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 3196 KB 
        #include"bits/stdc++.h"
        using namespace std;
        #include <ext/pb_ds/assoc_container.hpp>
        #include <ext/pb_ds/tree_policy.hpp>
        using namespace __gnu_pbds;
        template<class x>
        using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
        mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
        //bool plc[600000];
        const int mod=1e9+7;
        int occ[350000];
        int good[350006],a[505],maxn;
        int main()
        {
            ios_base::sync_with_stdio(0);
            cin.tie(0);
            int n,sum=0;
            cin>>n;
            for(int i=0;i<n;i++)
            {
                cin>>a[i];
                sum+=a[i];
            }
            maxn=sum;
            sort(a,a+n);
            //reverse(a,a+n);
            //plc[0]=true;
            vector <int> h;
            occ[0]=1;
            //yes.push_back(0);
            for(int i=0;i<n;i++)
            {
                for(int j=maxn;j>=a[i];j--)
                {
                    occ[j]+=occ[j-a[i]];
                    while(occ[j]>mod)
                        occ[j]-=mod;
                }
            }
            
            //cout<<"HI"<<endl;
            if(occ[sum/2]!=0&&sum%2==0)
            {
                for(int k=0;k<n;k++)
                {
                    sum-=a[k];
                    for(int i=a[k];i<=maxn;i++)
                    {
                        if(occ[i-a[k]]!=0){
                        occ[i]-=occ[i-a[k]];
                        if(occ[i]<0)
                            occ[i]+=mod;
                        
                        }
                    }
                    /*for(int i=0;i<=15;i++)
                    {
                        cout<<occ[i]<<" ";
                    }
                    cout<<"\n";*/
                    //cout<<"HELLO"<<endl;
                    for(int i=0;i<=sum;i++)
                    {
                        int oth=i-(sum-i);
                        if(oth<=0||oth>=maxn)
                            continue;
                        if(occ[i]!=0){
                            good[oth]++;
                            //cout<<oth<<" ";
                            //cout<<oth<<" ";
                        }
                    }
                    for(int i=maxn;i>=a[k];i--)
                    {
                        if(occ[i-a[k]]!=0){
                        occ[i]+=occ[i-a[k]];
                        while(occ[i]>mod)
                            occ[i]-=mod;
                        }
                    }
                    //cout<<endl;
                    sum+=a[k];
                }
                
            }
            for(int i=1;i<=maxn;i++)
                {
         
                        if(good[i]==n){
                            //cout<<"???"<<endl;
                            h.push_back(i);
                }
            }
            cout<<h.size()<<"\n";
            for(auto i : h)
                cout<<i<<" ";
        }

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 14 ms 416 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 6 ms 340 KB Output is correct
28 Correct 6 ms 408 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 5 ms 380 KB Output is correct
33 Correct 7 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 7 ms 416 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 44 ms 536 KB Output is correct
38 Correct 41 ms 604 KB Output is correct
39 Correct 51 ms 804 KB Output is correct
40 Correct 79 ms 716 KB Output is correct
41 Correct 69 ms 892 KB Output is correct
42 Correct 68 ms 684 KB Output is correct
43 Correct 125 ms 1136 KB Output is correct
44 Correct 150 ms 1136 KB Output is correct
45 Correct 135 ms 1060 KB Output is correct
46 Correct 59 ms 564 KB Output is correct
47 Correct 79 ms 716 KB Output is correct
48 Correct 123 ms 1056 KB Output is correct
49 Correct 96 ms 796 KB Output is correct
50 Correct 77 ms 716 KB Output is correct
51 Correct 18 ms 468 KB Output is correct
52 Correct 173 ms 1236 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 14 ms 416 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 6 ms 340 KB Output is correct
28 Correct 6 ms 408 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 5 ms 380 KB Output is correct
33 Correct 7 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 7 ms 416 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 44 ms 536 KB Output is correct
38 Correct 41 ms 604 KB Output is correct
39 Correct 51 ms 804 KB Output is correct
40 Correct 79 ms 716 KB Output is correct
41 Correct 69 ms 892 KB Output is correct
42 Correct 68 ms 684 KB Output is correct
43 Correct 125 ms 1136 KB Output is correct
44 Correct 150 ms 1136 KB Output is correct
45 Correct 135 ms 1060 KB Output is correct
46 Correct 59 ms 564 KB Output is correct
47 Correct 79 ms 716 KB Output is correct
48 Correct 123 ms 1056 KB Output is correct
49 Correct 96 ms 796 KB Output is correct
50 Correct 77 ms 716 KB Output is correct
51 Correct 18 ms 468 KB Output is correct
52 Correct 173 ms 1236 KB Output is correct
53 Correct 137 ms 1016 KB Output is correct
54 Correct 190 ms 1136 KB Output is correct
55 Correct 386 ms 1704 KB Output is correct
56 Correct 179 ms 1152 KB Output is correct
57 Correct 404 ms 1872 KB Output is correct
58 Correct 199 ms 1184 KB Output is correct
59 Correct 264 ms 1392 KB Output is correct
60 Correct 51 ms 556 KB Output is correct
61 Correct 313 ms 1508 KB Output is correct
62 Correct 326 ms 1600 KB Output is correct
63 Correct 326 ms 1644 KB Output is correct
64 Correct 317 ms 1640 KB Output is correct
65 Correct 66 ms 696 KB Output is correct
66 Correct 94 ms 740 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 14 ms 416 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 6 ms 340 KB Output is correct
28 Correct 6 ms 408 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 5 ms 340 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 5 ms 380 KB Output is correct
33 Correct 7 ms 340 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 7 ms 416 KB Output is correct
36 Correct 6 ms 340 KB Output is correct
37 Correct 44 ms 536 KB Output is correct
38 Correct 41 ms 604 KB Output is correct
39 Correct 51 ms 804 KB Output is correct
40 Correct 79 ms 716 KB Output is correct
41 Correct 69 ms 892 KB Output is correct
42 Correct 68 ms 684 KB Output is correct
43 Correct 125 ms 1136 KB Output is correct
44 Correct 150 ms 1136 KB Output is correct
45 Correct 135 ms 1060 KB Output is correct
46 Correct 59 ms 564 KB Output is correct
47 Correct 79 ms 716 KB Output is correct
48 Correct 123 ms 1056 KB Output is correct
49 Correct 96 ms 796 KB Output is correct
50 Correct 77 ms 716 KB Output is correct
51 Correct 18 ms 468 KB Output is correct
52 Correct 173 ms 1236 KB Output is correct
53 Correct 137 ms 1016 KB Output is correct
54 Correct 190 ms 1136 KB Output is correct
55 Correct 386 ms 1704 KB Output is correct
56 Correct 179 ms 1152 KB Output is correct
57 Correct 404 ms 1872 KB Output is correct
58 Correct 199 ms 1184 KB Output is correct
59 Correct 264 ms 1392 KB Output is correct
60 Correct 51 ms 556 KB Output is correct
61 Correct 313 ms 1508 KB Output is correct
62 Correct 326 ms 1600 KB Output is correct
63 Correct 326 ms 1644 KB Output is correct
64 Correct 317 ms 1640 KB Output is correct
65 Correct 66 ms 696 KB Output is correct
66 Correct 94 ms 740 KB Output is correct
67 Correct 339 ms 1532 KB Output is correct
68 Correct 96 ms 804 KB Output is correct
69 Execution timed out 1039 ms 3196 KB Time limit exceeded
70 Halted 0 ms 0 KB -