# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892433 | I_FloPPed21 | Bank (IZhO14_bank) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
for ( int d = 0 ; d < posixor [ i ] .size() ; d ++ )
{
long long j = posixor [ i ][ d ] ;
if ( dp [ i - 1 ] [ j ] == true )
{
for (int k = 0 ; k < posib [ i ] .size() ; k ++ )
{
if ( (( j ) & ( posib [ i ][ k ] )) == 0 )
{
int val = (posib [ i ][ k ] | ( j ));
posixor [ i + 1] .push_back(val);
dp [ i ] [ val ] = true ;
if ( i == n )
{
cout << "YES" << '\n';
return 0 ;
}
}
}
}