oj.uz

Submission #783802

# Submission time Handle Problem Language Result Execution time Memory
783802 2023-07-15T10:31:30 Z nghiaaa Bank (IZhO14_bank) C++17
44 / 100
 76 ms 212 KB 
#include <bits/stdc++.h>

using namespace std;
multiset<int> haha;
int n,m,a[30],BIT[30];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen("bank.in","r",stdin);
    //freopen("bank.out","w",stdout);
    cin>>n>>m;
    int check=0;
    for (int i=0;i<n;i++)
    {
        int ai;
        cin>>ai;
        haha.insert(ai);
    }
    for (int i=0;i<m;i++)
        cin>>a[i];
    //sort(a,a+m);
    BIT[0]=1;
    for (int i=1;i<25;i++)
        BIT[i]=BIT[i-1]<<1;
    for (int mask=1;mask<BIT[m];mask++)
    {
        if (mask&check) continue;
        int sum=0;
        for (int i=0;i<m;i++)
            if (mask&BIT[i]) sum+=a[i];
        if (haha.find(sum)!=haha.end())
        {
            haha.erase(haha.find(sum));
            check|=mask;
        }
    }
    if (haha.size()) cout<<"NO";
    else cout<<"YES";
    return 0;
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 76 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 74 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 0 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -