oj.uz

Submission #770938

# Submission time Handle Problem Language Result Execution time Memory
770938 2023-07-02T07:20:42 Z matei__b Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 972 KB 
#include <bits/stdc++.h>
#define ll long long 
#define mod 1000000007
#define dim 100002
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200000
#define simaimult 1e17
#define piii pair<int,pair<int,int> > 
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;

ifstream fin("b.in");
ofstream fout("b.out");

int n,m;
int a[22],b[22];

bool dp[1<<22][22];
int curr[1<<22],cnt;
int temp[1<<22],cntt;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> m;

    for(int i=1; i<=n; i++)
        cin >> a[i];
    
    for(int i=0; i<m; i++)
        cin >> b[i];

    for(int i=1; i<=n; i++)
    {
        if(i==1)
        {
            bool ok=0;
            for(int j=1; j<(1<<m); j++)
            {
                int s=0;
                for(int z=0; z<m; z++)
                {
                    if(j&(1<<z))
                    {
                        s+=b[z];
                    }
                }

                if(s==a[1])
                {
                    if(!(m-nr_biti(j)<n-i))
                    {
                        curr[++cnt]=j;
                        ok=1;
                    }
                }
            }

            if(!ok)
            {
                cout <<"NO";
                return 0;
            }
        }
        else 
        {
            cntt=0;
            for(int j=1; j<(1<<m); j++)
            {
                int s=0;
                for(int z=0; z<m; z++)
                {
                    if(j&(1<<z))
                    {
                        s+=b[z];
                    }
                }

                if(s==a[i])
                {
                    for(int u=1; u<=cnt; u++)
                    {
                        int it=curr[u];

                        bool okk=1;
                        for(int z=0; z<m; z++)
                        {
                            if(it&(1<<z) && j&(1<<z))
                                okk=0;
                        }

                        if(okk)
                        {
                            if(!(m-nr_biti(j|it)<n-i))
                                temp[++cntt]=j|it;
                        }
                    }
                }
            }

            cnt=cntt;

            for(int j=1; j<=cnt; j++)
                curr[j]=temp[j];

            if(!cnt)
            {
                cout <<"NO";
                return 0;
            }
        }
    }

    cout << "YES";

    return 0;
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 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 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 68 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 63 ms 344 KB Output is correct
9 Correct 64 ms 212 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 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 7 ms 340 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 10 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 7 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 225 ms 340 KB Output is correct
32 Execution timed out 1071 ms 972 KB Time limit exceeded
33 Halted 0 ms 0 KB -