oj.uz

답안 #757065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757065 2023-06-12T13:34:31 Z amine_aroua 은행 (IZhO14_bank) C++17
100 / 100
 489 ms 90128 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(ll i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(ll i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (PPCM)

// HERE IS THE SOLUTION
int n;
vi salary;
vector<vi> values(20001);
vector<vi> dp;
bool solve(int i  , int mask)
{
    if(i == n)return 1;
    int ans = dp[i][mask];
    if(ans != -1)return ans;
    ans = 0;
    for(auto msk : values[salary[i]])
    {
        if((msk & mask) != (msk))continue;
        ans|=solve(i + 1 , (msk^mask));
    }
    return dp[i][mask] = ans;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    boost;
    int m;
    cin>>n>>m;
    vi bank(m) ;
    dp.assign(n , vi(1<<m , -1));
    salary.assign(n , 0);
    fore(i , n)
    {
        cin>>salary[i];
    }
    fore(i , m)
    {
        cin>>bank[i];
    }
    fore(mask , (1<<m) - 1)
    {
        int sum = 0;
        fore(i , m)
        {
            if((1<<i)&mask)
            {
                sum+=bank[i];
            }
        }
        values[sum].pb(mask);
    }
    bool ans  = solve(0 , (1<<m) - 1);
    if(ans)cout<<"YES"<<nl;
    else cout<<"NO"<<nl;
}

Compilation message

bank.cpp: In function 'bool solve(int, int)':
bank.cpp:49:24: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   49 |     return dp[i][mask] = ans;

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 812 KB Output is correct
4 Correct 2 ms 1104 KB Output is correct
5 Correct 58 ms 11512 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 55 ms 10252 KB Output is correct
9 Correct 57 ms 10832 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 812 KB Output is correct
4 Correct 2 ms 1104 KB Output is correct
5 Correct 58 ms 11512 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 55 ms 10252 KB Output is correct
9 Correct 57 ms 10832 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 3 ms 1576 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1448 KB Output is correct
25 Correct 2 ms 1236 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 3 ms 1364 KB Output is correct
29 Correct 3 ms 1364 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 69 ms 15436 KB Output is correct
32 Correct 119 ms 18884 KB Output is correct
33 Correct 68 ms 35620 KB Output is correct
34 Correct 81 ms 48352 KB Output is correct
35 Correct 82 ms 53472 KB Output is correct
36 Correct 95 ms 89880 KB Output is correct
37 Correct 63 ms 16324 KB Output is correct
38 Correct 67 ms 24260 KB Output is correct
39 Correct 89 ms 39592 KB Output is correct
40 Correct 74 ms 48724 KB Output is correct
41 Correct 91 ms 89284 KB Output is correct
42 Correct 68 ms 26716 KB Output is correct
43 Correct 69 ms 40836 KB Output is correct
44 Correct 87 ms 69708 KB Output is correct
45 Correct 64 ms 19080 KB Output is correct
46 Correct 68 ms 32704 KB Output is correct
47 Correct 85 ms 69192 KB Output is correct
48 Correct 57 ms 10640 KB Output is correct
49 Correct 56 ms 10612 KB Output is correct
50 Correct 270 ms 88816 KB Output is correct
51 Correct 74 ms 47752 KB Output is correct
52 Correct 77 ms 47300 KB Output is correct
53 Correct 489 ms 47780 KB Output is correct
54 Correct 286 ms 88676 KB Output is correct
55 Correct 242 ms 88792 KB Output is correct
56 Correct 267 ms 90128 KB Output is correct
57 Correct 309 ms 90052 KB Output is correct
58 Correct 272 ms 86092 KB Output is correct