답안 #885346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885346 2023-12-09T13:55:47 Z asli_bg 은행 (IZhO14_bank) C++11
100 / 100
93 ms 8792 KB
#include<bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll;
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(),x.end()
 
typedef pair<int,int> pii;
 
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef vector<ll> vll;
 
#define mid (l+r)/2
#define alt cout<<endl
 
const int MAXN=25;
const int INF=1e9;
 
int32_t main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    //ifstream cin ("movie.in");
    //ofstream cout ("movie.out");
 
    int n,m;
    cin>>n>>m;
 
    vii dp (1<<m);
 
    int people[n], money[m];
 
    FOR(i,n){
        cin>>people[i];
    }
 
    FOR(i,m){
        cin>>money[i];
    }
 
    dp[0]={0,0};

    bool flag=false;

        FORE(s,0,(1<<m)){
            if(dp[s].fi==n){
                flag=true;
                break;
            }
            
            FOR(j,m){
                if(s & (1<<j)) continue;
                pii temp;
                if(people[dp[s].fi]==dp[s].se+money[j]){
                    temp={dp[s].fi+1,0};
                }
                else{
                    temp={dp[s].fi,dp[s].se+money[j]};
                }

                dp[s | (1<<j)]=max(dp[s| (1<<j)],temp);

            }

            
 
        }
 
    if(flag) cout<<"YES";
    else cout<<"NO";
 
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 91 ms 8536 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 93 ms 8540 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 472 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 91 ms 8536 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 93 ms 8540 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 472 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 344 KB Output is correct
31 Correct 78 ms 8540 KB Output is correct
32 Correct 80 ms 8540 KB Output is correct
33 Correct 86 ms 8540 KB Output is correct
34 Correct 76 ms 8536 KB Output is correct
35 Correct 77 ms 8540 KB Output is correct
36 Correct 90 ms 8540 KB Output is correct
37 Correct 75 ms 8540 KB Output is correct
38 Correct 93 ms 8696 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 74 ms 8540 KB Output is correct
41 Correct 93 ms 8536 KB Output is correct
42 Correct 92 ms 8792 KB Output is correct
43 Correct 80 ms 8640 KB Output is correct
44 Correct 92 ms 8540 KB Output is correct
45 Correct 3 ms 8536 KB Output is correct
46 Correct 87 ms 8540 KB Output is correct
47 Correct 86 ms 8540 KB Output is correct
48 Correct 2 ms 8536 KB Output is correct
49 Correct 90 ms 8540 KB Output is correct
50 Correct 80 ms 8540 KB Output is correct
51 Correct 82 ms 8648 KB Output is correct
52 Correct 81 ms 8536 KB Output is correct
53 Correct 91 ms 8536 KB Output is correct
54 Correct 80 ms 8540 KB Output is correct
55 Correct 78 ms 8540 KB Output is correct
56 Correct 83 ms 8536 KB Output is correct
57 Correct 89 ms 8540 KB Output is correct
58 Correct 81 ms 8536 KB Output is correct