oj.uz

Submission #761742

# Submission time Handle Problem Language Result Execution time Memory
761742 2023-06-20T08:40:38 Z Alora Bank (IZhO14_bank) C++17
46 / 100
 71 ms 1372 KB 
#include <bits/stdc++.h>
#define name "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define pb push_back
#define all(v) v.begin(), v.end()
#define maxn
const int M = 1e9 + 7;
using namespace std;
int n, m, id[1003], a[22];
bool dp[22][1 << 20];
vector <int> luu[22];

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
    //freopen(name".in", "r", stdin);
   // freopen(name".out", "w", stdout);
    cin >> n >> m;
    fi(i, 1, n){
        int x; cin >> x;
        id[x] = i;
    }
    fi(i, 1, m) cin >> a[i];

    fi(msk, 1, (1 << m) - 1){
        int sum = 0;
        fi(i, 1, m) if(getbit(msk, i - 1)) sum += a[i];
        if(sum <= 1000 && id[sum] != 0) luu[id[sum]].pb(msk);
    }
    fi(i, 1, n) if(luu[i].size() == 0) {cout << "NO"; return 0;}

    dp[0][0] = 1;
    fi(i, 1, n){
        fi(msk, 0, (1 << m) - 1) if(dp[i - 1][msk]){
            for(auto tt: luu[i]) if((msk & tt) == 0){
                dp[i][msk + tt] = 1;
            }
        }
    }

    fi(msk, 1, (1 << m) - 1) if(dp[n][msk]) {cout << "YES"; return 0;}
    cout << "NO";
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:33:38: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   33 |         fi(i, 1, m) if(getbit(msk, i - 1)) sum += a[i];
      |                                    ~~^~~
bank.cpp:9:29: note: in definition of macro 'getbit'
    9 | #define getbit(i, j) ((i >> j) & 1)
      |                             ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 69 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 70 ms 1372 KB Output is correct
9 Correct 71 ms 328 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 69 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 70 ms 1372 KB Output is correct
9 Correct 71 ms 328 KB Output is correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -