oj.uz

Submission #892457

# Submission time Handle Problem Language Result Execution time Memory
892457 2023-12-25T11:16:18 Z I_FloPPed21 Bank (IZhO14_bank) C++14
71 / 100
 362 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
int n, m ;
int v[ 22 ], b [ 22 ] ;


vector<int> posib [ 22 ] ;
vector<int> posixor[ 22 ] ;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m ;

    for ( int i = 1; i <= n  ; i ++ )
    {
        cin >> v[ i ] ;
    }

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


    posixor [ 1 ] .push_back(0);


    for ( int i = 1 ; i <= n ; i ++ )
    {
        for ( int j = 0 ; j < ( 1 << m ) ; j ++ )
        {
            int sum = 0 ;
            for ( int f = 1 ; f <= m ; f ++ )
            {
                if ( j & ( 1 << ( f - 1 ) ) )
                    sum += b[ f ] ;
            }

            if ( sum == v[ i ] )
            {
                posib [ i ] .push_back( j ) ;

            }
        }

        if ( posib[ i ] .size() == 0 || posixor [ i ] .size() == 0  )
        {
            cout << "NO" << '\n';
            return 0 ;
        }

        for ( int d = 0 ; d < posixor [ i ] .size() ; d ++ )
        {
            long long j = posixor [ i ][ d ] ;

            for  (int k = 0 ; k < posib [ i ] .size() ; k ++ )
            {


                if ( (( j ) & ( posib [ i ][ k ] )) == 0 )
                {


                    if ( i == n )
                    {
                        cout << "YES" << '\n';
                        return 0  ;
                    }

                    int val = (posib [ i ][ k ] | ( j  ));

                    posixor [ i + 1] .push_back(val);


                }
            }
        }
        posixor[i].clear();
        posib[i].clear();


    }
    cout << "NO" << '\n';

    return 0;
}

Compilation message

bank.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
bank.cpp: In function 'int main()':
bank.cpp:55:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |         for ( int d = 0 ; d < posixor [ i ] .size() ; d ++ )
      |                           ~~^~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:59:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             for  (int k = 0 ; k < posib [ i ] .size() ; k ++ )
      |                               ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 392 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 14 ms 348 KB Output is correct
32 Correct 61 ms 2540 KB Output is correct
33 Correct 55 ms 456 KB Output is correct
34 Correct 69 ms 348 KB Output is correct
35 Correct 73 ms 436 KB Output is correct
36 Correct 141 ms 348 KB Output is correct
37 Correct 14 ms 344 KB Output is correct
38 Correct 7 ms 456 KB Output is correct
39 Runtime error 362 ms 262144 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -