oj.uz

Submission #171007

# Submission time Handle Problem Language Result Execution time Memory
171007 2019-12-27T03:36:24 Z beksultan04 Bank (IZhO14_bank) C++14
100 / 100
 642 ms 30832 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i,n) for (i=0;i<(n);++i)
#define rep1(i,n) for (i=1;i<=(n);++i)
#define ret return
#define nemeshay ios::sync_with_stdio(0),cin.tie(0);
const int N=30,INF=1e9+7;
int a[N],b[N],n,m;
bool vis[25][(1<<21)];
bool dp[25][(1<<21)];
int sum[(1<<21)];
vector<int> v[21];
bool possible(int s,int j){
    if (j==n)ret 1;
    if (vis[j][s])ret dp[j][s];
    vis[j][s]=1;
    bool flag=0;

    for (int i=0;i<v[j].size();++i)
        if (!(s&v[j][i]))flag |= possible(s|v[j][i],j+1);
    ret dp[j][s]=flag;
}


int sum_bin(int a){
    int i,c=0;
    for (i=0;i<m;++i)
        if ((a&(1<<i)))
            c+=b[i];
    ret c;
}

main(){
    int i,c=1,j;
    cin>>n>>m;
    rep(i,n)scanf("%d",&a[i]);
    rep(i,m)scanf("%d",&b[i]);
    for (i=1;i<(1<<m);++i){
        int x=sum_bin(i);
        for (j=0;j<n;++j)
            if (x==a[j])
                v[j].pb(i);
    }

    if (possible(0,0))
        cout <<"YES";

    else cout <<"NO";
}

Compilation message

bank.cpp: In function 'bool possible(int, int)':
bank.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<v[j].size();++i)
                  ~^~~~~~~~~~~~
bank.cpp: At global scope:
bank.cpp:42:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
bank.cpp: In function 'int main()':
bank.cpp:43:11: warning: unused variable 'c' [-Wunused-variable]
     int i,c=1,j;
           ^
bank.cpp:45:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     rep(i,n)scanf("%d",&a[i]);
             ~~~~~^~~~~~~~~~~~
bank.cpp:46:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     rep(i,m)scanf("%d",&b[i]);
             ~~~~~^~~~~~~~~~~~

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 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 80 ms 480 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 80 ms 424 KB Output is correct
9 Correct 79 ms 376 KB Output is correct

Subtask #2
25.0 / 25.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.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 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 80 ms 480 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 80 ms 424 KB Output is correct
9 Correct 79 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 ms 508 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 84 ms 1956 KB Output is correct
32 Correct 170 ms 4500 KB Output is correct
33 Correct 91 ms 3192 KB Output is correct
34 Correct 92 ms 760 KB Output is correct
35 Correct 92 ms 632 KB Output is correct
36 Correct 101 ms 616 KB Output is correct
37 Correct 81 ms 508 KB Output is correct
38 Correct 86 ms 376 KB Output is correct
39 Correct 114 ms 8568 KB Output is correct
40 Correct 91 ms 504 KB Output is correct
41 Correct 101 ms 376 KB Output is correct
42 Correct 97 ms 7048 KB Output is correct
43 Correct 91 ms 1784 KB Output is correct
44 Correct 96 ms 376 KB Output is correct
45 Correct 87 ms 3324 KB Output is correct
46 Correct 91 ms 4216 KB Output is correct
47 Correct 97 ms 636 KB Output is correct
48 Correct 79 ms 376 KB Output is correct
49 Correct 80 ms 504 KB Output is correct
50 Correct 320 ms 30712 KB Output is correct
51 Correct 93 ms 888 KB Output is correct
52 Correct 102 ms 7028 KB Output is correct
53 Correct 642 ms 15968 KB Output is correct
54 Correct 321 ms 29944 KB Output is correct
55 Correct 273 ms 30684 KB Output is correct
56 Correct 276 ms 30832 KB Output is correct
57 Correct 275 ms 28792 KB Output is correct
58 Correct 274 ms 28664 KB Output is correct