oj.uz

답안 #520001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520001 2022-01-28T05:15:58 Z aadit_ambadkar 은행 (IZhO14_bank) C++11
100 / 100
 108 ms 3328 KB 
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
 
/*
    This code belongs to Aadit Ambadkar
    Date: 2022-01-25 21:41:41
    Problem: bank
*/
#include <bits/stdc++.h>
using namespace::std;
 
typedef long long ll;
#define F0R(i, n) for (int i = 0; i < n; i++)
#define R0F(i, n) for (int i = n-1; i >= 0; i--)
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0)
#define MOD 1000000007
#define FF first
#define SS second
 
vector<int> a;
vector<int> b;
vector<int> work[21];
int n, m;
bool works = false;
vector<vector<bool>> vis(21, vector<bool>(1048576, false));
 
void recur(int ly, int cmsk) {
    vis[ly][cmsk]=true;
    int sm = 0;
    F0R(i, m) {
        if (!(cmsk & (1 << i))) sm+=b[i];
    }
    if (sm < a[ly]) {
        return;
    }
    for (auto msk : work[ly]) {
        if ((msk & cmsk)==0) {
            if (ly==n-1) {
                cout << "YES\n";
                exit(EXIT_SUCCESS);
            }
            if (!vis[ly+1][(msk | cmsk)]) recur(ly+1, (msk | cmsk));
        }
    }
    // for (int msk = cmsk+1; msk < (1<<m); msk++) {
    //     if ((cmsk & msk) == cmsk) {  // learned by thinking
    //         int tmsk = msk ^ cmsk;
    //         int sum = 0;
    //         F0R(i, m) {
    //             if (tmsk & (1<<i)) {
    //                 sum+=b[i];
    //             }
    //             if (sum > a[ly]) break;
    //         }
    //         if (sum==a[ly]) {
    //             if (ly == n-1) {
    //                 cout << "YES\n";
    //                 exit(EXIT_SUCCESS);
    //             } else {
    //                 if (!vis[ly+1][msk]) {
    //                     recur(ly+1, msk);
    //                 }
    //             }
    //         }
    //     }
    // }
}
 
int main() {
    fastio;
    cin >> n >> m;
    
    if (n==1) {
        int k; cin >> k;
        vector<int> arr(m, 0);
        F0R(i, m) cin >> arr[i];
        sort(arr.begin(), arr.end());
        set<int> psbl;
        psbl.insert(0);
        F0R(i, m)
            for (auto it = psbl.rbegin(); it != psbl.rend(); it++) {
                psbl.insert((*it)+arr[i]);
            }
        if (psbl.count(k)) {
            cout << "YES\n";
        } else {
            cout << "NO\n";
        }
    } else {
        int x;
        F0R(i, n) {
            cin >> x;
            a.pb(x);
        }
        F0R(i, m) {
            cin >> x;
            b.pb(x);
        }
        for (int msk = 1; msk < (1<<m); msk++) {
            int sm = 0;
            F0R(i, m) {
                if (msk & (1<<i)) sm+=b[i];
            }
            F0R(i, n) {
                if (sm==a[i]) work[i].pb(msk);
            }
        }
        recur(0, 0);
        cout << "NO\n"; 
    }
}

Compilation message

bank.cpp:1: warning: ignoring '#pragma optimization_level ' [-Wunknown-pragmas]
    1 | #pragma optimization_level 3
      | 
bank.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3148 KB Output is correct
2 Correct 3 ms 3216 KB Output is correct
3 Correct 2 ms 3148 KB Output is correct
4 Correct 2 ms 3148 KB Output is correct
5 Correct 2 ms 3148 KB Output is correct
6 Correct 2 ms 3204 KB Output is correct
7 Correct 2 ms 3148 KB Output is correct
8 Correct 2 ms 3212 KB Output is correct
9 Correct 2 ms 3148 KB Output is correct
10 Correct 2 ms 3148 KB Output is correct
11 Correct 2 ms 3148 KB Output is correct
12 Correct 2 ms 3148 KB Output is correct
13 Correct 2 ms 3148 KB Output is correct
14 Correct 2 ms 3148 KB Output is correct
15 Correct 2 ms 3148 KB Output is correct
16 Correct 3 ms 3148 KB Output is correct
17 Correct 3 ms 3148 KB Output is correct
18 Correct 2 ms 3148 KB Output is correct
19 Correct 2 ms 3148 KB Output is correct
20 Correct 3 ms 3148 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 2 ms 3204 KB Output is correct
23 Correct 2 ms 3148 KB Output is correct
24 Correct 2 ms 3148 KB Output is correct
25 Correct 3 ms 3148 KB Output is correct
26 Correct 3 ms 3148 KB Output is correct
27 Correct 4 ms 3148 KB Output is correct
28 Correct 2 ms 3148 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 2 ms 3148 KB Output is correct
31 Correct 19 ms 3148 KB Output is correct
32 Correct 19 ms 3328 KB Output is correct
33 Correct 20 ms 3148 KB Output is correct
34 Correct 20 ms 3148 KB Output is correct
35 Correct 22 ms 3148 KB Output is correct
36 Correct 33 ms 3148 KB Output is correct
37 Correct 17 ms 3148 KB Output is correct
38 Correct 20 ms 3148 KB Output is correct
39 Correct 23 ms 3148 KB Output is correct
40 Correct 28 ms 3148 KB Output is correct
41 Correct 28 ms 3148 KB Output is correct
42 Correct 22 ms 3204 KB Output is correct
43 Correct 21 ms 3148 KB Output is correct
44 Correct 24 ms 3148 KB Output is correct
45 Correct 23 ms 3204 KB Output is correct
46 Correct 20 ms 3164 KB Output is correct
47 Correct 25 ms 3188 KB Output is correct
48 Correct 2 ms 3208 KB Output is correct
49 Correct 2 ms 3212 KB Output is correct
50 Correct 30 ms 3200 KB Output is correct
51 Correct 23 ms 3300 KB Output is correct
52 Correct 25 ms 3232 KB Output is correct
53 Correct 22 ms 3148 KB Output is correct
54 Correct 28 ms 3148 KB Output is correct
55 Correct 29 ms 3208 KB Output is correct
56 Correct 35 ms 3200 KB Output is correct
57 Correct 108 ms 3148 KB Output is correct
58 Correct 26 ms 3208 KB Output is correct