oj.uz

Submission #566256

# Submission time Handle Problem Language Result Execution time Memory
566256 2022-05-22T07:59:44 Z Abdulmohsen1284 Bootfall (IZhO17_bootfall) C++14
0 / 100
 1 ms 468 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[300000];
long long occ[300000],a[505];
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];
    }
    plc[0]=true;
    set <long long> h;
    vector <int> yes;
    yes.push_back(0);
    for(int i=0;i<n;i++)
    {
        for(int j=yes.size()-1;j>=0;j--)
        {
            if(plc[yes[j]+a[i]]!=true||(yes[j]+a[i])<=250000){
                plc[yes[j]+a[i]]=true;
                yes.push_back(yes[j]+a[i]);
            }
        }
    }
    //cout<<"HI"<<endl;
    if(plc[sum/2])
    {
        for(int k=0;k<n;k++)
        {
            sum-=a[k];
            for(int i=0;i<=250000;i++)
                plc[i]=false;
            plc[0]=true;
            yes.clear();
            yes.push_back(0);
            for(int i=0;i<n;i++)
            {
                if(i==k)
                    continue;
                for(int j=yes.size()-1;j>=0;j--)
                {
                    if(plc[yes[j]+a[i]]!=true||(yes[j]+a[i])<=250000){
                        plc[yes[j]+a[i]]=true;
                        yes.push_back(yes[j]+a[i]);
                    }
                }
            }
            //cout<<"HELLO"<<endl;
            for(int i=1;i<sum;i++)
            {
                long long oth=i-(sum-i);
                if(oth<=0)
                    continue;
                if(plc[i]){
                    occ[oth]++;
                    //cout<<oth<<" ";
                }
                if(occ[oth]==n){
                    //cout<<"???"<<endl;
                    h.insert(oth);
                }
            }
            //cout<<endl;
            sum+=a[k];
        }
        h.erase(0);
    }
    cout<<h.size()<<"\n";
    for(auto i : h)
        cout<<i<<" ";
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 468 KB Output isn't correct
5 Halted 0 ms 0 KB -