oj.uz

Submission #525077

# Submission time Handle Problem Language Result Execution time Memory
525077 2022-02-10T15:58:32 Z Dilshod_Imomov Bank (IZhO14_bank) C++17
100 / 100
 158 ms 10836 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
// # define int long long
# define fi first
# define se second

using namespace std;

const int N = 2e6 + 7;
const int mod = 1e9 + 7;
// const int INF = 1e18 + 7;

int a[N], b[N], n, m;
bool used[25][N], dp[25][N];
vector < int > vc[25];
string ans = "NO";
bool rec( int i, int mask ) {
   if ( i == 0 ) {
      return 1;
   }
   if ( used[i][mask] ) {
      return dp[i][mask];
   }
   used[i][mask] = 1;
   for ( auto msk: vc[i] ) {
      if ( (msk & mask) == msk ) {
         int ok = rec( i - 1, mask ^ msk);
         if ( ok ) {
            dp[i][mask] = 1;
            break;
         }
      }
   }
   return dp[i][mask];
}

int32_t main() {
   speed;
   cin >> n >> m;
   for ( int i = 1; i <= n; i++ ) {
      cin >> a[i];
   }
   for ( int i = 0; i < m; i++ ) {
      cin >> b[i];
   }
   for ( int msk = 0; msk < (1 << m); msk++ ) {
      int cnt = 0;
      for ( int j = 0; j < m; j++ ) {
         if ( (msk >> j) & 1 ) {
            cnt += b[j];
         }
      }
      for ( int i = 1; i <= n; i++ ) {
         if ( cnt == a[i]) {
            vc[i].push_back(msk);
         }
      }
   }
   if ( rec( n, (1 << m) - 1 ) ) {
      cout << "YES\n";
   }
   else {
      cout << "NO";  
   }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 61 ms 312 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 62 ms 360 KB Output is correct
9 Correct 60 ms 332 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 61 ms 312 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 62 ms 360 KB Output is correct
9 Correct 60 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 63 ms 332 KB Output is correct
32 Correct 63 ms 436 KB Output is correct
33 Correct 67 ms 332 KB Output is correct
34 Correct 71 ms 444 KB Output is correct
35 Correct 74 ms 444 KB Output is correct
36 Correct 75 ms 568 KB Output is correct
37 Correct 62 ms 328 KB Output is correct
38 Correct 66 ms 332 KB Output is correct
39 Correct 69 ms 324 KB Output is correct
40 Correct 69 ms 332 KB Output is correct
41 Correct 75 ms 312 KB Output is correct
42 Correct 70 ms 3792 KB Output is correct
43 Correct 69 ms 2116 KB Output is correct
44 Correct 75 ms 444 KB Output is correct
45 Correct 62 ms 340 KB Output is correct
46 Correct 65 ms 588 KB Output is correct
47 Correct 77 ms 448 KB Output is correct
48 Correct 61 ms 332 KB Output is correct
49 Correct 63 ms 332 KB Output is correct
50 Correct 75 ms 584 KB Output is correct
51 Correct 80 ms 1260 KB Output is correct
52 Correct 158 ms 4832 KB Output is correct
53 Correct 70 ms 492 KB Output is correct
54 Correct 74 ms 584 KB Output is correct
55 Correct 75 ms 580 KB Output is correct
56 Correct 75 ms 596 KB Output is correct
57 Correct 97 ms 10836 KB Output is correct
58 Correct 74 ms 592 KB Output is correct