oj.uz

답안 #467773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
467773 2021-08-24T12:19:13 Z quocnghia32 은행 (IZhO14_bank) C++14
100 / 100
 143 ms 16840 KB 
#include <bits/stdc++.h>
#define TASK "Bank"
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define READFILE freopen(TASK".INP","r",stdin)
#define WRITEFILE freopen(TASK".OUT","w",stdout)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rep(i,a,b) for(int i=a;i>=b;i--)
#define pb push_back
#define ENDL '\n'
#define debug(x) cout<<#x<<" = "<<x<<ENDL
#define fi first
#define se second
#define ever (;true;)
#define all(x) x.begin(),x.end()
#define sz(a) ((int)(a).size())
#define ms(a,x) memset(a,x,sizeof(a))
#define int long long

using namespace std;
typedef vector <int> vi;
typedef pair <int,int> ii;
typedef vector <ii> vpi;
typedef pair <int,ii> iii;
const int N = 25;
const int oo=0x3f;
const int mod=1e9+7;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
int a[N], cost[N], trace[(1<<20)+5], b[N];
ii dp[(1<<20)+5];
void init(){
  FAST;
}
bool cmp(ii a, ii b){
    return (a.fi<b.fi || a.fi==b.fi && a.se<b.se);
}
void tracee(int mask){
    b[trace[mask]-1]=1;
    if (trace[mask]!=0) tracee(trace[mask]);
}
signed main()
{
  init();
    int n,m;
    cin >> n >> m;
    For(i,0,n-1) cin >> a[i];
    For(i,0,m-1) cin >> cost[i];
    int mm=1<<m;
    for (int mask=0; mask<mm; mask++){
        For(i,0,m-1){
            if ((mask>>i)&1){
                ii p=dp[mask^(1<<i)];
                if (p.se+cost[i]==a[p.fi]){
                    {
                        dp[mask]={p.fi+1,0};

                    }
                }
                else dp[mask]=max(dp[mask],{p.fi,p.se+cost[i]});
            }
        }
    }
    if (dp[mm-1].fi==n) {
        cout << "YES" ;
    } else cout << "NO";
  return 0;
}

Compilation message

bank.cpp: In function 'bool cmp(ii, ii)':
bank.cpp:35:37: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   35 |     return (a.fi<b.fi || a.fi==b.fi && a.se<b.se);
      |                                     ^

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 98 ms 16632 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 111 ms 16720 KB Output is correct
9 Correct 112 ms 16632 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 98 ms 16632 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 111 ms 16720 KB Output is correct
9 Correct 112 ms 16632 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 2 ms 460 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 2 ms 460 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 107 ms 16604 KB Output is correct
32 Correct 117 ms 16608 KB Output is correct
33 Correct 121 ms 16644 KB Output is correct
34 Correct 109 ms 16700 KB Output is correct
35 Correct 106 ms 16676 KB Output is correct
36 Correct 111 ms 16688 KB Output is correct
37 Correct 103 ms 16592 KB Output is correct
38 Correct 118 ms 16664 KB Output is correct
39 Correct 114 ms 16628 KB Output is correct
40 Correct 98 ms 16708 KB Output is correct
41 Correct 96 ms 16608 KB Output is correct
42 Correct 129 ms 16636 KB Output is correct
43 Correct 105 ms 16620 KB Output is correct
44 Correct 98 ms 16616 KB Output is correct
45 Correct 133 ms 16600 KB Output is correct
46 Correct 143 ms 16708 KB Output is correct
47 Correct 103 ms 16656 KB Output is correct
48 Correct 115 ms 16724 KB Output is correct
49 Correct 101 ms 16716 KB Output is correct
50 Correct 117 ms 16596 KB Output is correct
51 Correct 116 ms 16640 KB Output is correct
52 Correct 100 ms 16716 KB Output is correct
53 Correct 117 ms 16712 KB Output is correct
54 Correct 130 ms 16652 KB Output is correct
55 Correct 109 ms 16612 KB Output is correct
56 Correct 92 ms 16740 KB Output is correct
57 Correct 91 ms 16840 KB Output is correct
58 Correct 92 ms 16652 KB Output is correct