oj.uz

Submission #173089

# Submission time Handle Problem Language Result Execution time Memory
173089 2020-01-03T10:40:54 Z emil_physmath Bank (IZhO14_bank) C++17
100 / 100
 537 ms 16060 KB 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
typedef double ldouble;
typedef long long llong;
typedef unsigned int uint;

vector<uint> sumup[1001];
int sum[1 << 20], bits[1 << 20];
bool ok[1 << 20];

bool IsSet(uint mask, uint i)
{
    return mask & (1 << i);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int& x: a)
        cin >> x;
    vector<int> b(m);
    for (int& x: b)
        cin >> x;
    for (uint mask = 0; mask < (1 << m); ++mask)
    {
        int curSum = 0, curBits = 0;
        for (int i = 0; i < m; ++i)
            if (IsSet(mask, i))
            {
                ++curBits;
                curSum += b[i];
            }
        if (curSum <= 1000)
            sumup[curSum].push_back(mask);
        sum[mask] = curSum;
        bits[mask] = curBits;
    }
    vector<uint> possLeft;
    possLeft.push_back((1 << m) - 1);
    for (int i = 0; i < n; ++i)
    {
        for (uint mask = 0; mask < (1 << m); ++mask)
            ok[mask] = false;
        for (uint left: possLeft)
        {
            if ((1 << bits[left]) < sumup[a[i]].size())
            {
                for(uint mask = left; mask; mask = (mask - 1) & left)
                    if (sum[mask] == a[i])
                        ok[left ^ mask] = true;
            }
            else
            {
                for (uint mask: sumup[a[i]])
                    if ((mask & left) == mask)
                        ok[left ^ mask] = true;
            }
        }
        possLeft.clear();
        for (uint mask = 0; mask < (1 << m); ++mask)
            if (ok[mask])
                possLeft.push_back(mask);
    }
    // cerr << possLeft.size() << endl;
    cout << (possLeft.size() ? "YES" : "NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:33:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (uint mask = 0; mask < (1 << m); ++mask)
                         ~~~~~^~~~~~~~~~
bank.cpp:51:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (uint mask = 0; mask < (1 << m); ++mask)
                             ~~~~~^~~~~~~~~~
bank.cpp:55:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if ((1 << bits[left]) < sumup[a[i]].size())
                 ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:69:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (uint mask = 0; mask < (1 << m); ++mask)
                             ~~~~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 5 ms 888 KB Output is correct
5 Correct 105 ms 15736 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 103 ms 15144 KB Output is correct
9 Correct 103 ms 15480 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 5 ms 888 KB Output is correct
5 Correct 105 ms 15736 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 103 ms 15144 KB Output is correct
9 Correct 103 ms 15480 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 4 ms 632 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 4 ms 632 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 632 KB Output is correct
31 Correct 107 ms 14916 KB Output is correct
32 Correct 145 ms 15608 KB Output is correct
33 Correct 114 ms 10296 KB Output is correct
34 Correct 123 ms 9592 KB Output is correct
35 Correct 126 ms 9596 KB Output is correct
36 Correct 158 ms 9568 KB Output is correct
37 Correct 96 ms 9720 KB Output is correct
38 Correct 102 ms 9720 KB Output is correct
39 Correct 144 ms 15028 KB Output is correct
40 Correct 127 ms 11244 KB Output is correct
41 Correct 162 ms 10212 KB Output is correct
42 Correct 122 ms 15044 KB Output is correct
43 Correct 121 ms 11312 KB Output is correct
44 Correct 141 ms 9592 KB Output is correct
45 Correct 115 ms 15692 KB Output is correct
46 Correct 115 ms 12640 KB Output is correct
47 Correct 141 ms 9564 KB Output is correct
48 Correct 105 ms 15212 KB Output is correct
49 Correct 103 ms 15480 KB Output is correct
50 Correct 246 ms 15552 KB Output is correct
51 Correct 135 ms 15224 KB Output is correct
52 Correct 137 ms 14552 KB Output is correct
53 Correct 537 ms 15172 KB Output is correct
54 Correct 279 ms 15424 KB Output is correct
55 Correct 247 ms 15424 KB Output is correct
56 Correct 259 ms 16060 KB Output is correct
57 Correct 265 ms 15936 KB Output is correct
58 Correct 261 ms 15932 KB Output is correct