Submission #361584

# Submission time Handle Problem Language Result Execution time Memory
361584 2021-01-30T16:44:14 Z shahriarkhan Bank (IZhO14_bank) C++14
100 / 100
434 ms 89156 KB
#include<bits/stdc++.h>
using namespace std ;

int main()
{
    int n , m ;
    scanf("%d%d",&n,&m) ;
    int a[n+1] , b[m+1] , vis[n+1][1<<m] ;
    for(int i = 1 ; i <= n ; ++i) scanf("%d",&a[i]) ;
    for(int i = 1 ; i <= m ; ++i) scanf("%d",&b[i]) ;
    vector<int> pos[n+1] , dp ;
    for(int i = 1 ; i < (1<<m) ; ++i)
    {
        int sum = 0 ;
        for(int j = 0 ; j < m ; ++j)
        {
            if(i&(1<<j)) sum += b[j+1] ;
        }
        for(int j = 1 ; j <= n ; ++j)
        {
            if(a[j]==sum) pos[j].push_back(i) ;
        }
    }
    for(int i = 0 ; i <= n ; ++i)
    {
        for(int j = 0 ; j < (1<<m) ; ++j)
        {
            vis[i][j] = 0 ;
        }
    }
    dp.push_back(0) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        vector<int> dp2 ;
        for(int j : dp)
        {
            for(int k : pos[i])
            {
                if(j&k) continue ;
                if(!vis[i][j|k])
                {
                    dp2.push_back(j|k) ;
                    vis[i][j|k] = 1 ;
                }
            }
        }
        dp = dp2 ;
        if(dp.empty())
        {
            puts("NO") ;
            return 0 ;
        }
    }
    puts("YES") ;
    return 0 ;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |     scanf("%d%d",&n,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~
bank.cpp:9:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     for(int i = 1 ; i <= n ; ++i) scanf("%d",&a[i]) ;
      |                                   ~~~~~^~~~~~~~~~~~
bank.cpp:10:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     for(int i = 1 ; i <= m ; ++i) scanf("%d",&b[i]) ;
      |                                   ~~~~~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 81 ms 8556 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 78 ms 8704 KB Output is correct
9 Correct 79 ms 8556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 876 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1260 KB Output is correct
5 Correct 2 ms 1004 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 2 ms 876 KB Output is correct
11 Correct 2 ms 1260 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 81 ms 8556 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 78 ms 8704 KB Output is correct
9 Correct 79 ms 8556 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 2 ms 620 KB Output is correct
22 Correct 2 ms 1004 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 2 ms 1004 KB Output is correct
25 Correct 2 ms 748 KB Output is correct
26 Correct 2 ms 620 KB Output is correct
27 Correct 4 ms 620 KB Output is correct
28 Correct 2 ms 876 KB Output is correct
29 Correct 2 ms 876 KB Output is correct
30 Correct 2 ms 1260 KB Output is correct
31 Correct 82 ms 12652 KB Output is correct
32 Correct 134 ms 17132 KB Output is correct
33 Correct 101 ms 33276 KB Output is correct
34 Correct 113 ms 45564 KB Output is correct
35 Correct 115 ms 49684 KB Output is correct
36 Correct 145 ms 86524 KB Output is correct
37 Correct 81 ms 12652 KB Output is correct
38 Correct 88 ms 20844 KB Output is correct
39 Correct 124 ms 38612 KB Output is correct
40 Correct 112 ms 45420 KB Output is correct
41 Correct 143 ms 86508 KB Output is correct
42 Correct 106 ms 25068 KB Output is correct
43 Correct 105 ms 37228 KB Output is correct
44 Correct 128 ms 66028 KB Output is correct
45 Correct 85 ms 16748 KB Output is correct
46 Correct 96 ms 29036 KB Output is correct
47 Correct 128 ms 66028 KB Output is correct
48 Correct 77 ms 8556 KB Output is correct
49 Correct 78 ms 8556 KB Output is correct
50 Correct 237 ms 88652 KB Output is correct
51 Correct 114 ms 45676 KB Output is correct
52 Correct 116 ms 45676 KB Output is correct
53 Correct 434 ms 46560 KB Output is correct
54 Correct 262 ms 88576 KB Output is correct
55 Correct 241 ms 88652 KB Output is correct
56 Correct 236 ms 89156 KB Output is correct
57 Correct 234 ms 89052 KB Output is correct
58 Correct 238 ms 85120 KB Output is correct