oj.uz

답안 #757011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
757011 2023-06-12T12:21:56 Z amine_aroua 은행 (IZhO14_bank) C++17
71 / 100
 1000 ms 89924 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 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;
}

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 724 KB Output is correct
4 Correct 4 ms 1104 KB Output is correct
5 Correct 58 ms 11528 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 62 ms 10288 KB Output is correct
9 Correct 57 ms 10692 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 3 ms 1364 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 3 ms 1620 KB Output is correct
4 Correct 3 ms 1748 KB Output is correct
5 Correct 2 ms 1492 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 2 ms 1364 KB Output is correct
10 Correct 2 ms 1364 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct

Subtask #4
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 724 KB Output is correct
4 Correct 4 ms 1104 KB Output is correct
5 Correct 58 ms 11528 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 62 ms 10288 KB Output is correct
9 Correct 57 ms 10692 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 3 ms 1364 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 3 ms 1620 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1492 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 2 ms 1364 KB Output is correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 66 ms 15428 KB Output is correct
32 Correct 882 ms 18868 KB Output is correct
33 Correct 74 ms 35652 KB Output is correct
34 Correct 78 ms 48352 KB Output is correct
35 Correct 81 ms 53428 KB Output is correct
36 Correct 118 ms 89924 KB Output is correct
37 Correct 66 ms 16268 KB Output is correct
38 Correct 63 ms 24184 KB Output is correct
39 Execution timed out 1079 ms 39476 KB Time limit exceeded
40 Halted 0 ms 0 KB -