oj.uz

답안 #461520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
461520 2021-08-10T03:49:11 Z Yuisuyuno 은행 (IZhO14_bank) C++14
100 / 100
 183 ms 16836 KB 
//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 25
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m;
int pp[N], s[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=0; i<n; i++) cin >> pp[i];
    for(int i=0; i<m; i++) cin >> s[i];
}

int dp[1<<20];
int lef[1<<20];

void proc()
{
    memset(dp, -1, sizeof dp);
    memset(lef, -1, sizeof lef);
    dp[0]  = 0;
    lef[0] = 0;
    int mm = (1<<m);
    for(int msk = 0; msk < mm; msk++){
        for(int i=0; i<m; i++){
            if (msk&(1<<i) == 0) continue;
            int pre = msk^(1<<i);
            if (dp[pre]==-1) continue;
            int new_amt = lef[pre]+s[i];
            int cur_tar = pp[dp[pre]];
            if (new_amt < cur_tar){
                lef[msk] = new_amt;
                dp[msk] = dp[pre];
            }
            else if (new_amt == cur_tar){
                lef[msk] = 0;
                dp[msk] = dp[pre]+1;
            }
        }
        if (dp[msk]==n){
            cout << "YES";
            return;
        }
    }
    cout<<"NO";
}

signed main()
{
    readfile();
    proc();
    return 0;
}

Compilation message

bank.cpp: In function 'void proc()':
bank.cpp:56:28: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   56 |             if (msk&(1<<i) == 0) continue;
      |                     ~~~~~~~^~~~
bank.cpp: In function 'void readfile()':
bank.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(Task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16716 KB Output is correct
2 Correct 7 ms 16716 KB Output is correct
3 Correct 8 ms 16640 KB Output is correct
4 Correct 7 ms 16716 KB Output is correct
5 Correct 49 ms 16716 KB Output is correct
6 Correct 8 ms 16716 KB Output is correct
7 Correct 8 ms 16612 KB Output is correct
8 Correct 8 ms 16632 KB Output is correct
9 Correct 167 ms 16716 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16716 KB Output is correct
2 Correct 7 ms 16716 KB Output is correct
3 Correct 8 ms 16640 KB Output is correct
4 Correct 7 ms 16716 KB Output is correct
5 Correct 49 ms 16716 KB Output is correct
6 Correct 8 ms 16716 KB Output is correct
7 Correct 8 ms 16612 KB Output is correct
8 Correct 8 ms 16632 KB Output is correct
9 Correct 167 ms 16716 KB Output is correct
10 Correct 7 ms 16716 KB Output is correct
11 Correct 8 ms 16716 KB Output is correct
12 Correct 9 ms 16716 KB Output is correct
13 Correct 8 ms 16656 KB Output is correct
14 Correct 7 ms 16716 KB Output is correct
15 Correct 8 ms 16716 KB Output is correct
16 Correct 8 ms 16716 KB Output is correct
17 Correct 8 ms 16700 KB Output is correct
18 Correct 7 ms 16716 KB Output is correct
19 Correct 7 ms 16716 KB Output is correct
20 Correct 8 ms 16612 KB Output is correct
21 Correct 8 ms 16716 KB Output is correct
22 Correct 9 ms 16716 KB Output is correct
23 Correct 9 ms 16716 KB Output is correct
24 Correct 8 ms 16704 KB Output is correct
25 Correct 8 ms 16612 KB Output is correct
26 Correct 9 ms 16716 KB Output is correct
27 Correct 9 ms 16716 KB Output is correct
28 Correct 9 ms 16716 KB Output is correct
29 Correct 8 ms 16660 KB Output is correct
30 Correct 9 ms 16716 KB Output is correct
31 Correct 150 ms 16716 KB Output is correct
32 Correct 166 ms 16708 KB Output is correct
33 Correct 58 ms 16716 KB Output is correct
34 Correct 48 ms 16716 KB Output is correct
35 Correct 49 ms 16704 KB Output is correct
36 Correct 48 ms 16712 KB Output is correct
37 Correct 48 ms 16700 KB Output is correct
38 Correct 48 ms 16716 KB Output is correct
39 Correct 8 ms 16620 KB Output is correct
40 Correct 49 ms 16716 KB Output is correct
41 Correct 54 ms 16704 KB Output is correct
42 Correct 115 ms 16836 KB Output is correct
43 Correct 51 ms 16716 KB Output is correct
44 Correct 49 ms 16716 KB Output is correct
45 Correct 8 ms 16716 KB Output is correct
46 Correct 90 ms 16704 KB Output is correct
47 Correct 49 ms 16716 KB Output is correct
48 Correct 8 ms 16716 KB Output is correct
49 Correct 51 ms 16704 KB Output is correct
50 Correct 164 ms 16836 KB Output is correct
51 Correct 51 ms 16704 KB Output is correct
52 Correct 53 ms 16716 KB Output is correct
53 Correct 182 ms 16716 KB Output is correct
54 Correct 183 ms 16716 KB Output is correct
55 Correct 168 ms 16704 KB Output is correct
56 Correct 163 ms 16716 KB Output is correct
57 Correct 164 ms 16716 KB Output is correct
58 Correct 165 ms 16720 KB Output is correct