oj.uz

Submission #258162

# Submission time Handle Problem Language Result Execution time Memory
258162 2020-08-05T13:02:39 Z uacoder123 Bank (IZhO14_bank) C++14
100 / 100
 300 ms 82680 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <int, int> ii;
typedef vector <int> vi;
int n,arr[20],arr1[20],m;
vi al[20];
int dp[21][(1<<21)];
int cal(int i,int a)
{
  if(i>=n)
    return 1;
  if(dp[i][a]!=-1)
    return(dp[i][a]);  
  dp[i][a]=0;
  for(int j=0;j<al[i].size();++j)
    if((a|al[i][j])==a&&cal(i+1,a^al[i][j]))
      return dp[i][a]=1;
  return dp[i][a];
}
int main()
{
  cin>>n>>m;
  for(int i=0;i<n;++i)
    cin>>arr[i];
  for(int j=0;j<m;++j)
    cin>>arr1[j];
  for(int i=0;i<=(1<<m)-1;++i)
  {
    int v=0;
    for(int j=0;j<m;++j)
      if(bit(i,j))
        v+=arr1[j];
    for(int j=0;j<n;++j)
    {
      dp[j][i]=-1;
      if(arr[j]==v)
        al[j].pb(i);
    }
  }
  if(cal(0,(1<<m)-1))
    cout<<"YES"<<endl;
  else
    cout<<"NO"<<endl;
  return 0;
}

Compilation message

bank.cpp: In function 'int cal(int, int)':
bank.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j=0;j<al[i].size();++j)
               ~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 76 ms 4472 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 77 ms 4472 KB Output is correct
9 Correct 77 ms 4472 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 2 ms 1024 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 2 ms 896 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 76 ms 4472 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 77 ms 4472 KB Output is correct
9 Correct 77 ms 4472 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 2 ms 768 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 3 ms 1024 KB Output is correct
23 Correct 2 ms 1280 KB Output is correct
24 Correct 2 ms 1024 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 896 KB Output is correct
29 Correct 2 ms 896 KB Output is correct
30 Correct 2 ms 1280 KB Output is correct
31 Correct 80 ms 8568 KB Output is correct
32 Correct 89 ms 12792 KB Output is correct
33 Correct 95 ms 29048 KB Output is correct
34 Correct 103 ms 41464 KB Output is correct
35 Correct 106 ms 45560 KB Output is correct
36 Correct 136 ms 82552 KB Output is correct
37 Correct 84 ms 8568 KB Output is correct
38 Correct 87 ms 16888 KB Output is correct
39 Correct 96 ms 33144 KB Output is correct
40 Correct 103 ms 41464 KB Output is correct
41 Correct 136 ms 82552 KB Output is correct
42 Correct 93 ms 20856 KB Output is correct
43 Correct 97 ms 33144 KB Output is correct
44 Correct 120 ms 61944 KB Output is correct
45 Correct 80 ms 12664 KB Output is correct
46 Correct 90 ms 24952 KB Output is correct
47 Correct 121 ms 61944 KB Output is correct
48 Correct 75 ms 4472 KB Output is correct
49 Correct 75 ms 4472 KB Output is correct
50 Correct 136 ms 82552 KB Output is correct
51 Correct 107 ms 41504 KB Output is correct
52 Correct 109 ms 41492 KB Output is correct
53 Correct 104 ms 41464 KB Output is correct
54 Correct 136 ms 82564 KB Output is correct
55 Correct 150 ms 82680 KB Output is correct
56 Correct 136 ms 82552 KB Output is correct
57 Correct 300 ms 82556 KB Output is correct
58 Correct 140 ms 78584 KB Output is correct