oj.uz

답안 #468050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
468050 2021-08-26T08:58:27 Z KhoaHo 은행 (IZhO14_bank) C++17
100 / 100
 134 ms 8640 KB 
#include <bits/stdc++.h>
using namespace std;
///define-zone
#define task "test"
#define vec vector
#define priq priority_queue
#define pf push_front
#define pb push_back
#define popb pop_back
#define popf pop_front
#define SZ(a) a.begin(), a.end()
#define SZZ(a, begin, end) a + begin, a + begin + end
#define fi first
#define se second
#define BIT(n) (1 << n)

///typedef-zone
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldb;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

///code-mau
template <class val>
inline val gcd(val a, val b) { return (a ? gcd(b % a, a) : b); }
template <class val>
inline val fmul(val a, val b, val m)
{
    if (!b)
        return 0;
    if (!(b - 1))
        return a;
    if (b % 2)
        return (fmul(a, b / 2, m) * 2 + a) % m;
    else
        return (fmul(a, b / 2, m) * 2) % m;
}
template <class val>
inline bool getBit(val pos, val mask) { return ((mask >> pos) & 1); }
void fastio()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
}
void init()
{
    freopen(task ".inp", "r", stdin);
    freopen(task ".out", "w", stdout);
}
const int N = int(1e6) + 1;
int dp[(1 << 20)], f[(1 << 20)], a[21], b[21], n, m;
int main()
{
    fastio();
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < m; i++)
        cin >> b[i];
    memset(dp, -1, sizeof(dp));
    memset(f, -1, sizeof(f));
    dp[0] = f[0] = 0;
    for (int mask = 0; mask < BIT(m); mask++)
    {
        for (int i = 0; i < m; i++)
        {
            if (!getBit(i, mask))
                continue;
            int pre = (mask ^ (1 << i));
            if (dp[pre] < 0)
                continue;
            int cur = f[pre] + b[i];
            int target = a[dp[pre]];
            if (cur < target)
            {
                dp[mask] = dp[pre];
                f[mask] = cur;
            }
            else if (cur == target)
            {
                dp[mask] = dp[pre] + 1;
                f[mask] = 0;
            }
        }
        if (dp[mask] == n)
        {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
    return 0;
}

Compilation message

bank.cpp: In function 'void init()':
bank.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     freopen(task ".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bank.cpp:51:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     freopen(task ".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8396 KB Output is correct
2 Correct 5 ms 8396 KB Output is correct
3 Correct 4 ms 8396 KB Output is correct
4 Correct 4 ms 8396 KB Output is correct
5 Correct 74 ms 8496 KB Output is correct
6 Correct 5 ms 8396 KB Output is correct
7 Correct 5 ms 8396 KB Output is correct
8 Correct 5 ms 8396 KB Output is correct
9 Correct 102 ms 8396 KB Output is correct
10 Correct 5 ms 8396 KB Output is correct
11 Correct 4 ms 8396 KB Output is correct
12 Correct 4 ms 8396 KB Output is correct
13 Correct 4 ms 8396 KB Output is correct
14 Correct 5 ms 8396 KB Output is correct
15 Correct 4 ms 8396 KB Output is correct
16 Correct 5 ms 8424 KB Output is correct
17 Correct 5 ms 8444 KB Output is correct
18 Correct 5 ms 8396 KB Output is correct
19 Correct 5 ms 8396 KB Output is correct
20 Correct 6 ms 8524 KB Output is correct
21 Correct 6 ms 8396 KB Output is correct
22 Correct 6 ms 8396 KB Output is correct
23 Correct 6 ms 8396 KB Output is correct
24 Correct 7 ms 8640 KB Output is correct
25 Correct 6 ms 8396 KB Output is correct
26 Correct 6 ms 8512 KB Output is correct
27 Correct 5 ms 8412 KB Output is correct
28 Correct 6 ms 8396 KB Output is correct
29 Correct 6 ms 8396 KB Output is correct
30 Correct 5 ms 8396 KB Output is correct
31 Correct 119 ms 8508 KB Output is correct
32 Correct 127 ms 8500 KB Output is correct
33 Correct 87 ms 8512 KB Output is correct
34 Correct 78 ms 8496 KB Output is correct
35 Correct 76 ms 8520 KB Output is correct
36 Correct 75 ms 8512 KB Output is correct
37 Correct 75 ms 8396 KB Output is correct
38 Correct 78 ms 8396 KB Output is correct
39 Correct 4 ms 8396 KB Output is correct
40 Correct 77 ms 8500 KB Output is correct
41 Correct 76 ms 8396 KB Output is correct
42 Correct 134 ms 8396 KB Output is correct
43 Correct 78 ms 8496 KB Output is correct
44 Correct 76 ms 8512 KB Output is correct
45 Correct 5 ms 8436 KB Output is correct
46 Correct 105 ms 8500 KB Output is correct
47 Correct 76 ms 8396 KB Output is correct
48 Correct 5 ms 8524 KB Output is correct
49 Correct 75 ms 8524 KB Output is correct
50 Correct 112 ms 8396 KB Output is correct
51 Correct 78 ms 8396 KB Output is correct
52 Correct 81 ms 8396 KB Output is correct
53 Correct 132 ms 8512 KB Output is correct
54 Correct 121 ms 8396 KB Output is correct
55 Correct 113 ms 8496 KB Output is correct
56 Correct 106 ms 8516 KB Output is correct
57 Correct 111 ms 8496 KB Output is correct
58 Correct 107 ms 8396 KB Output is correct