oj.uz

답안 #755184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755184 2023-06-09T13:56:50 Z vjudge1 은행 (IZhO14_bank) C++17
100 / 100
 184 ms 33240 KB 
#include <bits/stdc++.h>
using namespace std;

long long dp[(1<<21)];
long long a[21];
long long b[21];
long long tong[(1<<21)];
long long vt[(1<<21)];
long long thua[(1<<21)];

signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin >> n >> m;
    for (int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    a[n+1]=10000000000;
    for (int i=1;i<=m;i++)
    {
        cin >> b[i];
    }
    dp[0]=1;
    thua[0]=a[1];
    vt[0]=1;
    for (int i=1;i<=(1<<m);i++)
    {
        for (int i2=1;i2<=m;i2++)
        {
            if (!(i&(1<<(i2-1)))) continue;
            tong[i]+=b[i2];
        }
    }
    for (int i=1;i<=(1<<m);i++)
    {
        long long tong2=0;
        for (int i2=1;i2<=n+1;i2++)
        {
            tong2=tong2+a[i2];
            if (tong2>tong[i]) 
            {
                vt[i]=i2;
                thua[i]=tong2-tong[i];
                break;
            }
        }
    }
    for (int i=1;i<=(1<<m);i++)
    {
        for (int i2=1;i2<=m;i2++)
        {
            if (!(i&(1<<(i2-1)))) continue;
            int bit=i^(1<<(i2-1));
            if (dp[bit]==0) continue;
            if (thua[bit]>=b[i2])
            {
                dp[i]=1;
            }
        }
    }
    // cout << vt[9] << " " << thua[9] << " " << tong[9] << " " << dp[9] << '\n';
    for (int i=1;i<=(1<<m);i++)
    {
        if ((dp[i]) and (vt[i]==n+1)) 
        {
            // cout << i << '\n';
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 120 ms 25012 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 160 ms 33144 KB Output is correct
9 Correct 131 ms 33164 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 3 ms 852 KB Output is correct
8 Correct 3 ms 852 KB Output is correct
9 Correct 3 ms 712 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 956 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 120 ms 25012 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 160 ms 33144 KB Output is correct
9 Correct 131 ms 33164 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 3 ms 852 KB Output is correct
27 Correct 3 ms 852 KB Output is correct
28 Correct 3 ms 712 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 956 KB Output is correct
31 Correct 147 ms 33108 KB Output is correct
32 Correct 152 ms 33144 KB Output is correct
33 Correct 150 ms 32492 KB Output is correct
34 Correct 129 ms 26188 KB Output is correct
35 Correct 131 ms 26544 KB Output is correct
36 Correct 148 ms 25120 KB Output is correct
37 Correct 132 ms 25420 KB Output is correct
38 Correct 129 ms 24968 KB Output is correct
39 Correct 144 ms 33164 KB Output is correct
40 Correct 134 ms 25076 KB Output is correct
41 Correct 131 ms 25188 KB Output is correct
42 Correct 184 ms 33076 KB Output is correct
43 Correct 135 ms 28780 KB Output is correct
44 Correct 140 ms 25000 KB Output is correct
45 Correct 181 ms 33060 KB Output is correct
46 Correct 158 ms 33080 KB Output is correct
47 Correct 137 ms 25164 KB Output is correct
48 Correct 156 ms 33240 KB Output is correct
49 Correct 133 ms 25032 KB Output is correct
50 Correct 139 ms 33096 KB Output is correct
51 Correct 131 ms 25436 KB Output is correct
52 Correct 142 ms 33092 KB Output is correct
53 Correct 155 ms 33168 KB Output is correct
54 Correct 150 ms 33148 KB Output is correct
55 Correct 142 ms 33168 KB Output is correct
56 Correct 156 ms 33156 KB Output is correct
57 Correct 143 ms 33096 KB Output is correct
58 Correct 134 ms 33100 KB Output is correct