oj.uz

Submission #969216

# Submission time Handle Problem Language Result Execution time Memory
969216 2024-04-24T16:57:29 Z dosts Bank (IZhO14_bank) C++17
100 / 100
 94 ms 8792 KB 
//Dost SEFEROĞLU
#pragma GCC optimize("O3,unroll-loops,Ofast")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " << 
#define vi vector<int>
 
const int N = 5e2+1,inf = 2e9,MOD = 1e9+7;
 
 
void solve() {
    int n,m;
    cin >> n >> m;
    vi a(m+2),b(n+2);
    a[m+1] = b[n+1] = inf;
    for (int i=1;i<=n;i++) cin >> b[i];
    for (int j=1;j<=m;j++) cin >> a[j];
    sort(a.begin()+1,a.end());
    int lim = (1<<m);
    pii dp[lim];
    for (int i=0;i<lim;i++) dp[i] = {-1,0};
    pii mx = {0,-b[1]};
    dp[0] = {0,-b[1]};
    for (int i=1;i<lim;i++) {
        for (int j=0;j<m;j++) {
            if (!(i&(1<<j))) continue;
            int rem = i^(1<<j);
            int v = dp[rem].second+a[j+1];
            if (v > 0) continue;
            else if (v == 0){
                dp[i] = max(dp[i],{dp[rem].ff+1,-b[dp[rem].ff+2]});
            }
            else dp[i] = max(dp[i],{dp[rem].first,dp[rem].second+a[j+1]});
        }
        mx = max(mx,dp[i]);
    };
    cout << (mx.ff == n ? "YES\n" : "NO\n");
}
                
                            
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 74 ms 8632 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 91 ms 8540 KB Output is correct
9 Correct 83 ms 8536 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 74 ms 8632 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 91 ms 8540 KB Output is correct
9 Correct 83 ms 8536 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 1 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 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 88 ms 8632 KB Output is correct
32 Correct 83 ms 8536 KB Output is correct
33 Correct 73 ms 8632 KB Output is correct
34 Correct 76 ms 8540 KB Output is correct
35 Correct 72 ms 8540 KB Output is correct
36 Correct 76 ms 8628 KB Output is correct
37 Correct 76 ms 8788 KB Output is correct
38 Correct 78 ms 8628 KB Output is correct
39 Correct 76 ms 8536 KB Output is correct
40 Correct 71 ms 8536 KB Output is correct
41 Correct 72 ms 8536 KB Output is correct
42 Correct 78 ms 8536 KB Output is correct
43 Correct 77 ms 8636 KB Output is correct
44 Correct 71 ms 8536 KB Output is correct
45 Correct 84 ms 8540 KB Output is correct
46 Correct 78 ms 8628 KB Output is correct
47 Correct 75 ms 8632 KB Output is correct
48 Correct 83 ms 8632 KB Output is correct
49 Correct 74 ms 8536 KB Output is correct
50 Correct 84 ms 8628 KB Output is correct
51 Correct 75 ms 8632 KB Output is correct
52 Correct 70 ms 8460 KB Output is correct
53 Correct 89 ms 8540 KB Output is correct
54 Correct 85 ms 8632 KB Output is correct
55 Correct 84 ms 8780 KB Output is correct
56 Correct 94 ms 8536 KB Output is correct
57 Correct 81 ms 8628 KB Output is correct
58 Correct 80 ms 8792 KB Output is correct