답안 #435426

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435426 2021-06-23T10:11:27 Z UHA 은행 (IZhO14_bank) C++14
100 / 100
301 ms 26116 KB
#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vvll vector<vector<ll>>
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define N 100005
using namespace std;
const int MOD=1e9+7;
const int mod=1e9+9;
const int p=31;

bool dp[1<<20][21];
int A[21],sum[1<<20],n,m,B[21],k;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m;
    for(int i=1;i<=n;++i){cin>>A[i];A[i]+=A[i-1];}
    for(int i=0;i<m;++i){cin>>B[i];dp[1<<i][0]=1;}

    for(int i=1;i<(1<<m);++i)
    {
        sum[i]=sum[i^(i&-i)]+B[__lg(i&-i)];
        k=0;
        for(int j=1;j<=n;++j)if(sum[i]==A[j]){k=j;}
        if(k&&dp[i][k-1])dp[i][k]=1;
        for(int j=0;j<m;++j)
            if(!(i&(1<<j)))
                for(int k=0;k<=n;++k)
                   dp[i^(1<<j)][k]|=dp[i][k];
    }
    if(dp[(1<<m)-1][n])cout<<"YES\n";
    else cout<<"NO\n";
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 103 ms 25920 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Correct 100 ms 25924 KB Output is correct
9 Correct 98 ms 25896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 3 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 3 ms 716 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 103 ms 25920 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 360 KB Output is correct
8 Correct 100 ms 25924 KB Output is correct
9 Correct 98 ms 25896 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 3 ms 716 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 3 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 3 ms 716 KB Output is correct
31 Correct 109 ms 25932 KB Output is correct
32 Correct 127 ms 25824 KB Output is correct
33 Correct 164 ms 25928 KB Output is correct
34 Correct 189 ms 25832 KB Output is correct
35 Correct 189 ms 25844 KB Output is correct
36 Correct 266 ms 25944 KB Output is correct
37 Correct 114 ms 25908 KB Output is correct
38 Correct 148 ms 25888 KB Output is correct
39 Correct 154 ms 25856 KB Output is correct
40 Correct 170 ms 25944 KB Output is correct
41 Correct 301 ms 26116 KB Output is correct
42 Correct 159 ms 25880 KB Output is correct
43 Correct 168 ms 25876 KB Output is correct
44 Correct 236 ms 25944 KB Output is correct
45 Correct 139 ms 25960 KB Output is correct
46 Correct 142 ms 25908 KB Output is correct
47 Correct 270 ms 25900 KB Output is correct
48 Correct 102 ms 25924 KB Output is correct
49 Correct 98 ms 25836 KB Output is correct
50 Correct 263 ms 25924 KB Output is correct
51 Correct 173 ms 25924 KB Output is correct
52 Correct 180 ms 25896 KB Output is correct
53 Correct 182 ms 25948 KB Output is correct
54 Correct 276 ms 25960 KB Output is correct
55 Correct 286 ms 25860 KB Output is correct
56 Correct 278 ms 25960 KB Output is correct
57 Correct 295 ms 25924 KB Output is correct
58 Correct 257 ms 25840 KB Output is correct