Submission #935087

# Submission time Handle Problem Language Result Execution time Memory
935087 2024-02-28T15:16:37 Z ntdaccode Bank (IZhO14_bank) C++17
71 / 100
1000 ms 22100 KB
#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int mod=1e9+7;
const int M=1e6+10;
const int N=1e3+10;
int n,a[21],b[21],m;
bool dd[21][1<<20],d[21][1<<20];
bool check()
{
  fori(i,1,(1<<m)-1)
  {
    if(dd[n][i]) return true;
  }
  return false;
}
int32_t main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if(fopen("1.inp","r"))
  {
    freopen("1.inp","r",stdin);
    freopen("1.out","w",stdout);
  }
  if(fopen("bank.inp","r"))
  {
    freopen("bank.inp","r",stdin);
    freopen("bank.out","w",stdout);
  }
  cin >> n >> m;
  fori(i,1,n) cin >> a[i];
  fori(i,1,m) cin >> b[i];
  dd[0][0]=true;
  int sum=0;
  fori(i,1,n)
  {
    sum+=a[i];
    fori(mask,1,(1<<m)-1)
    {
      //cout << mask << "\n";
      int res=0;
      bool OK=0;
      fori(j,1,m)
      {
        if(mask&(1<<(j-1)))
        {
          int bit=mask^(1<<(j-1));
          if(dd[i-1][bit]||d[i][bit])
          {
            d[i][mask]=true;
            OK=1;
          }
          res+=b[j];
        }
      }
      //cout << res << " " << sum << " " << OK << "\n";
      if(res==sum&&OK) dd[i][mask]=true;
    }
  }
  if(check()) cout << "YES\n";
  else cout << "NO\n";
}


Compilation message

bank.cpp: In function 'int32_t main()':
bank.cpp:29:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     freopen("1.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
bank.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("1.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("bank.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bank.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen("bank.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 74 ms 4688 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 73 ms 6492 KB Output is correct
9 Correct 76 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 4556 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 10588 KB Output is correct
2 Correct 4 ms 6492 KB Output is correct
3 Correct 12 ms 14940 KB Output is correct
4 Correct 15 ms 4700 KB Output is correct
5 Correct 11 ms 6488 KB Output is correct
6 Correct 6 ms 4440 KB Output is correct
7 Correct 5 ms 8540 KB Output is correct
8 Correct 4 ms 6488 KB Output is correct
9 Correct 10 ms 12632 KB Output is correct
10 Correct 10 ms 12820 KB Output is correct
11 Correct 14 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 74 ms 4688 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 73 ms 6492 KB Output is correct
9 Correct 76 ms 4444 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 4556 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 8 ms 10588 KB Output is correct
21 Correct 4 ms 6492 KB Output is correct
22 Correct 12 ms 14940 KB Output is correct
23 Correct 15 ms 4700 KB Output is correct
24 Correct 11 ms 6488 KB Output is correct
25 Correct 6 ms 4440 KB Output is correct
26 Correct 5 ms 8540 KB Output is correct
27 Correct 4 ms 6488 KB Output is correct
28 Correct 10 ms 12632 KB Output is correct
29 Correct 10 ms 12820 KB Output is correct
30 Correct 14 ms 4444 KB Output is correct
31 Correct 162 ms 7372 KB Output is correct
32 Correct 241 ms 10212 KB Output is correct
33 Correct 553 ms 16584 KB Output is correct
34 Correct 786 ms 20052 KB Output is correct
35 Correct 866 ms 21184 KB Output is correct
36 Execution timed out 1055 ms 22100 KB Time limit exceeded
37 Halted 0 ms 0 KB -