oj.uz

Submission #37870

# Submission time Handle Problem Language Result Execution time Memory
37870 2017-12-28T11:09:59 Z mirbek01 Bank (IZhO14_bank) C++14
71 / 100
 1000 ms 4704 KB 
# include <bits/stdc++.h>

# define pb push_back
# define fr first
# define sc second
# define mk make_pair

using namespace std;

const int inf = 1e9 + 7;
const int N = 1e6 + 5;

typedef long long ll;

int n, m, a[N], b[N], pw[100], sum[1 << 20], used[1 << 20];
vector <int> v[30];

int main()
{
      pw[0] = 1;

      for(int i = 1; i < 30; i ++)
            pw[i] = pw[i - 1] * 2;

      cin >> n >> m;

      for(int i = 0; i < n; i ++)
            cin >> a[i];

      for(int i = 0; i < m; i ++)
            cin >> b[i];

      for(int mask = 0; mask < pw[m]; mask ++)
      {
            for(int j = 0; j < m; j ++)
            {
                  int bit = (mask & pw[j]);
                  if(bit) sum[mask] += b[j];
            }
      }

      for(int i = 0; i < n; i ++)
      {
            if(i == 0)
            {
                  for(int mask = 0; mask < pw[m]; mask ++)
                        if(sum[mask] == a[i])
                              v[i].pb(mask);
            }
            else
            {
                  for(int mask = 0; mask < pw[m]; mask ++)
                  {
                        for(int j = 0; j < v[i - 1].size(); j ++)
                        {
                              int musk = v[i - 1][j], s = sum[mask], sz = m - __builtin_popcount(mask | musk);
                              sz -= (n - (i + 1));
                              if((musk & mask) == 0 && s == a[i] && used[mask | musk] == 0 && sz >= 0)
                              {
                                    v[i].pb(mask | musk);
                                    used[mask | musk] = 1;
                              }
                        }
                  }
            }
      }

      if(v[n - 1].size())
            puts("YES");
      else
            puts("NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:54:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for(int j = 0; j < v[i - 1].size(); j ++)
                                        ~~^~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 80 ms 4608 KB Output is correct
6 Correct 2 ms 4608 KB Output is correct
7 Correct 2 ms 4608 KB Output is correct
8 Correct 80 ms 4636 KB Output is correct
9 Correct 81 ms 4704 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 80 ms 4608 KB Output is correct
6 Correct 2 ms 4608 KB Output is correct
7 Correct 2 ms 4608 KB Output is correct
8 Correct 80 ms 4636 KB Output is correct
9 Correct 81 ms 4704 KB Output is correct
10 Correct 2 ms 4704 KB Output is correct
11 Correct 2 ms 4704 KB Output is correct
12 Correct 2 ms 4704 KB Output is correct
13 Correct 2 ms 4704 KB Output is correct
14 Correct 2 ms 4704 KB Output is correct
15 Correct 2 ms 4704 KB Output is correct
16 Correct 2 ms 4704 KB Output is correct
17 Correct 2 ms 4704 KB Output is correct
18 Correct 2 ms 4704 KB Output is correct
19 Correct 2 ms 4704 KB Output is correct
20 Correct 3 ms 4704 KB Output is correct
21 Correct 4 ms 4704 KB Output is correct
22 Correct 3 ms 4704 KB Output is correct
23 Correct 3 ms 4704 KB Output is correct
24 Correct 3 ms 4704 KB Output is correct
25 Correct 3 ms 4704 KB Output is correct
26 Correct 3 ms 4704 KB Output is correct
27 Correct 3 ms 4704 KB Output is correct
28 Correct 3 ms 4704 KB Output is correct
29 Correct 3 ms 4704 KB Output is correct
30 Correct 3 ms 4704 KB Output is correct
31 Execution timed out 1062 ms 4704 KB Time limit exceeded
32 Halted 0 ms 0 KB -