oj.uz

Submission #93307

# Submission time Handle Problem Language Result Execution time Memory
93307 2019-01-07T13:59:43 Z 3zp Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 20900 KB 
#include<bits/stdc++.h>
using namespace std;
int n, m;
int f[2000009];
int A[2000009], B[2000009];
long long C[2000009];
void CO(vector<int> &a, vector<int> b){
    for(int i = 0; i < (1 << m); i++)
        A[i] = 0, B[i] = 0;
    for(int i = 0; i < a.size(); i++)
        A[a[i]] = 1;
    for(int i = 0; i < b.size(); i++)
        B[b[i]] = 1;
    for(int i = 0; i < m; i++)
        for(int j = 0; j < (1 << m); j++)
            if(j & (1 << i)) 
                A[j] += A[j ^ (1 << i)],
                B[j] += B[j ^ (1 << i)];
    for(int i = 0; i < (1 << m); i++)
        C[i] = A[i] * B[i];
    for(int i = 0; i < m; i++)
        for(int j = 0; j < (1 << m); j++)
            if(j & (1 << i))
                C[j] -= C[j ^ (1 << i)];
    a.clear();
    for(int i = 0; i < (1 << m); i++)
        if(C[i]) a.push_back(i);
}
int a[29], b[29];
vector<int> v[29];
main(){
    cin >> n >> m;
    int sa = 0;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        sa += a[i];
    }
    for(int i = 0; i < m; i++){
        cin >> b[i];
    }
    for(int i = 0; i < (1 << m); i++){
        int S = 0, k = 0;
        for(int j = 0; j < m; j++){
            if((1 << j) & i) 
                S += b[j], k++;
        }
        if(S == sa) f[i] = 1;
        if(k > m - n + 1) continue;
        for(int j = 0; j < n; j++){
            if(a[j] == S) v[j].push_back(i);
        }
    }
    vector<int> V;
    V.push_back(0);
    for(int i = 0; i < n; i++){
        CO(V, v[i]);
    }
    for(int i = 0; i < V.size(); i++){
        if(f[V[i]]){
            cout <<"YES"<<endl;
            return 0;
        }
    }
    cout << "NO" << endl;
}

Compilation message

bank.cpp: In function 'void CO(std::vector<int>&, std::vector<int>)':
bank.cpp:10:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < a.size(); i++)
                    ~~^~~~~~~~~~
bank.cpp:12:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < b.size(); i++)
                    ~~^~~~~~~~~~
bank.cpp: At global scope:
bank.cpp:31:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
bank.cpp: In function 'int main()':
bank.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < V.size(); i++){
                    ~~^~~~~~~~~~

Subtask #1
19.0 / 19.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 5 ms 1016 KB Output is correct
5 Correct 132 ms 16760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 131 ms 20900 KB Output is correct
9 Correct 132 ms 16760 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 508 KB Output is correct
9 Correct 2 ms 504 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 7 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 8 ms 632 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 8 ms 632 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 5 ms 636 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 7 ms 636 KB Output is correct
10 Correct 7 ms 632 KB Output is correct
11 Correct 10 ms 632 KB Output is correct

Subtask #4
0 / 29.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 5 ms 1016 KB Output is correct
5 Correct 132 ms 16760 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 131 ms 20900 KB Output is correct
9 Correct 132 ms 16760 KB Output is correct
10 Correct 2 ms 380 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 508 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 7 ms 632 KB Output is correct
21 Correct 5 ms 632 KB Output is correct
22 Correct 8 ms 632 KB Output is correct
23 Correct 10 ms 632 KB Output is correct
24 Correct 8 ms 632 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 5 ms 636 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 7 ms 636 KB Output is correct
29 Correct 7 ms 632 KB Output is correct
30 Correct 10 ms 632 KB Output is correct
31 Correct 182 ms 17520 KB Output is correct
32 Correct 246 ms 19072 KB Output is correct
33 Correct 442 ms 17884 KB Output is correct
34 Correct 566 ms 16760 KB Output is correct
35 Correct 617 ms 16760 KB Output is correct
36 Execution timed out 1060 ms 16760 KB Time limit exceeded
37 Halted 0 ms 0 KB -