oj.uz

답안 #752950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752950 2023-06-04T10:34:17 Z Magikarp4000 은행 (IZhO14_bank) C++17
100 / 100
 120 ms 8532 KB 
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 20;
int n,m;
int a[MAXN], b[MAXN], dp[1<<MAXN], dp1[1<<MAXN];

signed main() {
    cin >> n >> m;
    FOR(i,0,n) cin >> a[i];
    FOR(i,0,m) cin >> b[i];
    FOR(s,0,1<<m) dp[s] = dp1[s] = -INF;
    dp[0] = -1;
    dp1[0] = 0;
    FOR(s,0,1<<m) {
        FOR(j,0,m) {
            if (s&(1<<j)) {
                if (dp[s^(1<<j)] == n-1 || dp[s^(1<<j)] == -INF) continue;
                int x = dp[s^(1<<j)];
                int rem = dp1[s^(1<<j)]+b[j];
                if (rem > a[dp[s^(1<<j)]+1]) continue;
                if (dp1[s^(1<<j)]+b[j] == a[dp[s^(1<<j)]+1]) {
                    x++; rem = 0;
                }
                if (x > dp[s]) {
                    dp[s] = x;
                    dp1[s] = rem;
                }
                else if (x == dp[s]) dp1[s] = rem;
            }
        }
    }
    FOR(s,0,1<<m) {
        if (dp[s] == n-1 && dp1[s] == 0) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 3 ms 468 KB Output is correct
5 Correct 61 ms 8488 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 91 ms 8484 KB Output is correct
9 Correct 82 ms 8492 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 3 ms 468 KB Output is correct
5 Correct 61 ms 8488 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 91 ms 8484 KB Output is correct
9 Correct 82 ms 8492 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 432 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 432 KB Output is correct
27 Correct 2 ms 432 KB Output is correct
28 Correct 2 ms 436 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 120 ms 8492 KB Output is correct
32 Correct 101 ms 8404 KB Output is correct
33 Correct 77 ms 8532 KB Output is correct
34 Correct 58 ms 8488 KB Output is correct
35 Correct 57 ms 8404 KB Output is correct
36 Correct 62 ms 8488 KB Output is correct
37 Correct 89 ms 8492 KB Output is correct
38 Correct 60 ms 8488 KB Output is correct
39 Correct 72 ms 8488 KB Output is correct
40 Correct 56 ms 8404 KB Output is correct
41 Correct 60 ms 8404 KB Output is correct
42 Correct 111 ms 8488 KB Output is correct
43 Correct 64 ms 8504 KB Output is correct
44 Correct 57 ms 8500 KB Output is correct
45 Correct 106 ms 8488 KB Output is correct
46 Correct 98 ms 8484 KB Output is correct
47 Correct 60 ms 8496 KB Output is correct
48 Correct 78 ms 8488 KB Output is correct
49 Correct 70 ms 8484 KB Output is correct
50 Correct 81 ms 8488 KB Output is correct
51 Correct 58 ms 8404 KB Output is correct
52 Correct 61 ms 8404 KB Output is correct
53 Correct 115 ms 8496 KB Output is correct
54 Correct 102 ms 8404 KB Output is correct
55 Correct 76 ms 8484 KB Output is correct
56 Correct 92 ms 8404 KB Output is correct
57 Correct 77 ms 8404 KB Output is correct
58 Correct 78 ms 8500 KB Output is correct