oj.uz

답안 #566500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566500 2022-05-22T11:13:27 Z Abdulmohsen1284 Bootfall (IZhO17_bootfall) C++14
28 / 100
 55 ms 972 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 long long mod=129583759019245;
long long occ[600000],good[500006],a[505],maxn;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    long long 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]];
            occ[j]%=mod;
        }
    }
    
    //cout<<"HI"<<endl;
    if(occ[sum/2]!=0&&sum%2==0)
    {
        vector <int> v;
        v.reserve(maxn);
        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++)
            {
                long long oth=i-(sum-i);
                if(oth<=0||oth>=20000)
                    continue;
                if(occ[i]!=0){
                    good[oth]++;
                    //cout<<oth<<" ";
                    //cout<<oth<<" ";
                }
            }
            for(int i=maxn;i>=0;i--)
            {
                if(occ[i-a[k]]!=0){
                occ[i]+=occ[i-a[k]];
                occ[i]%=mod;
                }
            }
            //cout<<endl;
            sum+=a[k];
        }
        
    }
    for(int i=1;i<=20000;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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 2 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 6 ms 496 KB Output is correct
29 Correct 7 ms 496 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 6 ms 468 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 4 ms 340 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 2 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 6 ms 496 KB Output is correct
29 Correct 7 ms 496 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 6 ms 468 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 788 KB Output is correct
38 Correct 32 ms 776 KB Output is correct
39 Incorrect 55 ms 972 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 2 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 6 ms 496 KB Output is correct
29 Correct 7 ms 496 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 6 ms 468 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 788 KB Output is correct
38 Correct 32 ms 776 KB Output is correct
39 Incorrect 55 ms 972 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 2 ms 340 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 7 ms 468 KB Output is correct
28 Correct 6 ms 496 KB Output is correct
29 Correct 7 ms 496 KB Output is correct
30 Correct 4 ms 340 KB Output is correct
31 Correct 6 ms 468 KB Output is correct
32 Correct 4 ms 340 KB Output is correct
33 Correct 4 ms 468 KB Output is correct
34 Correct 5 ms 468 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 788 KB Output is correct
38 Correct 32 ms 776 KB Output is correct
39 Incorrect 55 ms 972 KB Output isn't correct
40 Halted 0 ms 0 KB -