oj.uz

답안 #90909

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90909 2018-12-25T07:08:24 Z inom 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 704 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
 
#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define int long long
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
 
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();
 
const int N = 25;
const int INF = 1e15;
const int MAXN = 4 * N;
const int MOD = 998244353;
 
int TN = 1;
 
int n, m, x;
int a[N], b[N], cnt[MAXN * 10];
 
void rec(int cur, int pos) {
    if (cur == x) {
        printf("YES\n"); exit(false);
    }
    if (cur > x) {
        return;
    }
    if (pos > m) {
        return;
    }
    rec(cur + b[pos], pos + 1);
    rec(cur, pos + 1);
}
 
void subtask1() {
    cin >> x;
    for (int i = 1; i <= m; i++) {
        cin >> b[i];
    }
    rec(0, 1);
    printf("NO\n");
    exit(false);
}

void get() {
    int sum = 0, j = 1;
    for (int i = 1; i <= m; i++) {
        sum += b[i];
        if (sum == a[j]) {
            j++; sum = 0;
            if (j == n + 1) {
                cout << "YES\n"; exit(false);
            }
        }
        else if (sum > a[j]) {
            return;
        }
    }
    return;
}

void subtask2() {
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i];
    }
    sort(b + 1, b + 1 + m);
    get();
    while (next_permutation(b + 1, b + 1 + m)) {
        get();
    }
    cout << "NO\n"; exit(false);
}

void tupoy_rakhshon(int pos) {
    if (pos == n + 1) {
        cout << "YES\n"; exit(false);
    }
    if (!a[pos]) {
        tupoy_rakhshon(pos + 1);
    }
    for (int i = a[pos]; i > 0; i--) {
        if (cnt[i] > 0) {
            a[pos] -= i; cnt[i]--;
            tupoy_rakhshon(pos);
            a[pos] += i; cnt[i]++;
        }
    }
}

void subtask3() {
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i]; cnt[b[i]]++;
    }
    tupoy_rakhshon(1);
    cout << "NO\n"; exit(false);
}

signed main() {
    // in; out;  // cin >> TN;
    cin >> n >> m;
    if (n == 1) {
        subtask1();
    }
    if (n <= 10 && m <= 10) {
        subtask2();
    }
    subtask3();
    return 0;
}

Compilation message

bank.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 4 ms 504 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 488 KB Output is correct
8 Correct 2 ms 488 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 2 ms 520 KB Output is correct
11 Correct 5 ms 520 KB Output is correct
12 Correct 2 ms 544 KB Output is correct
13 Correct 5 ms 704 KB Output is correct
14 Correct 22 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 2 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 29 ms 704 KB Output is correct
19 Correct 4 ms 704 KB Output is correct
20 Correct 2 ms 704 KB Output is correct
21 Correct 2 ms 704 KB Output is correct
22 Correct 2 ms 704 KB Output is correct
23 Correct 2 ms 704 KB Output is correct
24 Correct 2 ms 704 KB Output is correct
25 Correct 2 ms 704 KB Output is correct
26 Correct 8 ms 704 KB Output is correct
27 Correct 17 ms 704 KB Output is correct
28 Correct 2 ms 704 KB Output is correct
29 Correct 2 ms 704 KB Output is correct
30 Correct 2 ms 704 KB Output is correct
31 Correct 2 ms 704 KB Output is correct
32 Correct 2 ms 704 KB Output is correct
33 Correct 3 ms 704 KB Output is correct
34 Correct 2 ms 704 KB Output is correct
35 Correct 14 ms 704 KB Output is correct
36 Correct 2 ms 704 KB Output is correct
37 Correct 10 ms 704 KB Output is correct
38 Correct 2 ms 704 KB Output is correct
39 Correct 2 ms 704 KB Output is correct
40 Correct 2 ms 704 KB Output is correct
41 Correct 2 ms 704 KB Output is correct
42 Execution timed out 1070 ms 704 KB Time limit exceeded
43 Halted 0 ms 0 KB -