oj.uz

답안 #171459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171459 2019-12-28T17:02:23 Z ne4eHbKa 은행 (IZhO14_bank) C++17
71 / 100
 1000 ms 18980 KB 
//{ <defines>
#ifndef _LOCAL
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#endif

#include <bits/stdc++.h>
using namespace std;

#define fr(i, n) for(int i = 0; i < (n); ++i)
#define fo(n) fr(i, (n))

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int(x.size())
#define pw(x) (1 << (x))
#define PW(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset(x, y, sizeof x)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

const int oo = 2e9;
const ll OO = 4e18;
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int md = 0x3b800001;
const int MD = 1e9 + 7;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
//} </defines>
const int N = 20;
const int M = 1 << N;

int n, m, a[N], b[N], s[M];
vi f[(int)2e4 + 5];

void solve() {
    srand(time());
    cin >> n >> m;
    int sua = 0;
    fo(n) cin >> a[i], sua += a[i];
//    sort(a, a + n);
//    reverse(a, a + n);
    random_shuffle(a, a + n);
    int sub = 0;
    fo(m) cin >> b[i], sub += b[i];
    if(sua > sub) re void(cout << "NO\n");

#ifdef _LOCAL
    for(auto &p : f) p.clear();
#endif

    fo(1 << m) {
        fr(j, m) ifn(i & pw(j)) s[i ^ pw(j)] = s[i] + b[j];
        f[s[i]].pb(i);
    }

    unordered_set<int> G, H; unordered_set<int> *g = &G, *h = &H;
    g -> insert(0);
    fo(n) {
        if(g -> empty() || f[a[i]].empty()) re void(cout << "NO\n");
        h -> clear();
        for(int t : *g) for(int j : f[a[i]]) ifn(j & t) h -> insert(j ^ t);
        swap(g, h);
    }
    cout << (g -> empty() ? "NO\n" : "YES\n");
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    fo(tests) {
		cerr << "case #" << i+1 << endl;
		solve();
	}
#else
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
#endif
	return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 115 ms 11212 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 120 ms 10676 KB Output is correct
9 Correct 133 ms 10872 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 5 ms 1144 KB Output is correct
5 Correct 115 ms 11212 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 120 ms 10676 KB Output is correct
9 Correct 133 ms 10872 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 2 ms 892 KB Output is correct
13 Correct 3 ms 888 KB Output is correct
14 Correct 2 ms 760 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 888 KB Output is correct
18 Correct 2 ms 888 KB Output is correct
19 Correct 2 ms 888 KB Output is correct
20 Correct 4 ms 1016 KB Output is correct
21 Correct 4 ms 1016 KB Output is correct
22 Correct 5 ms 1144 KB Output is correct
23 Correct 4 ms 1016 KB Output is correct
24 Correct 4 ms 1016 KB Output is correct
25 Correct 5 ms 1016 KB Output is correct
26 Correct 4 ms 1016 KB Output is correct
27 Correct 4 ms 1016 KB Output is correct
28 Correct 4 ms 1016 KB Output is correct
29 Correct 4 ms 1144 KB Output is correct
30 Correct 2 ms 888 KB Output is correct
31 Correct 116 ms 11356 KB Output is correct
32 Correct 177 ms 10912 KB Output is correct
33 Correct 120 ms 10792 KB Output is correct
34 Correct 134 ms 10988 KB Output is correct
35 Correct 160 ms 11896 KB Output is correct
36 Correct 139 ms 11512 KB Output is correct
37 Correct 130 ms 12024 KB Output is correct
38 Correct 124 ms 11712 KB Output is correct
39 Correct 259 ms 18344 KB Output is correct
40 Correct 124 ms 11640 KB Output is correct
41 Correct 2 ms 760 KB Output is correct
42 Correct 119 ms 10460 KB Output is correct
43 Correct 120 ms 11900 KB Output is correct
44 Correct 132 ms 12068 KB Output is correct
45 Correct 115 ms 11000 KB Output is correct
46 Correct 119 ms 11992 KB Output is correct
47 Correct 127 ms 11256 KB Output is correct
48 Correct 113 ms 10616 KB Output is correct
49 Correct 112 ms 10900 KB Output is correct
50 Correct 587 ms 18980 KB Output is correct
51 Correct 120 ms 10616 KB Output is correct
52 Correct 136 ms 10084 KB Output is correct
53 Execution timed out 1076 ms 16036 KB Time limit exceeded
54 Halted 0 ms 0 KB -