oj.uz

답안 #90950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90950 2018-12-25T09:30:11 Z inom 은행 (IZhO14_bank) C++14
71 / 100
 1000 ms 8184 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 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;
bool us[N];
int a[N], b[N];
map<int, vector<int> > v;

void printbin(int x) {
    while (x) {
        printf("%d", x % 2);
        x /= 2;
    }
}

void rec(int pos, int mask) {
    /*
    printf("rec(%d, ", pos);
    printbin(mask);
    printf(")\n");
    */
    if (pos == n + 1) {
        printf("YES\n");
        exit(0);
    }

    for (int i = 0; i < v[a[pos]].size(); i++) {
        int cur = v[a[pos]][i];
        if ((mask & cur) == cur) {
            rec(pos + 1, mask ^ cur);
        }
    }
}

signed main() {
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 0; i < m; i++) {
        scanf("%d", &b[i]);
    }

    for (int mask = 1; mask < (1 << m); mask++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if (mask & (1 << j))
                sum += b[j];
        }
        v[sum].pb(mask);
    }
    /*
    for (int i = 1; i <= n; i++) {
        printf("%d : ", a[i]);
        for (int j = 0; j < v[a[i]].size(); j++) {
            int tmp = v[a[i]][j];
            printbin(tmp);
            printf(" ");
        }
        printf("\n");
    }
    */
    rec(1, (1 << m) - 1);
    puts("NO");
    return 0;
}

Compilation message

bank.cpp:22:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)
 
bank.cpp:27:17: warning: overflow in implicit constant conversion [-Woverflow]
 const int INF = 1e15;
                 ^~~~
bank.cpp: In function 'void rec(int, int)':
bank.cpp:56:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v[a[pos]].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~
bank.cpp: In function 'int main()':
bank.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
bank.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &b[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 120 ms 6884 KB Output is correct
6 Correct 2 ms 6884 KB Output is correct
7 Correct 2 ms 6884 KB Output is correct
8 Correct 102 ms 6884 KB Output is correct
9 Correct 105 ms 6884 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 120 ms 6884 KB Output is correct
6 Correct 2 ms 6884 KB Output is correct
7 Correct 2 ms 6884 KB Output is correct
8 Correct 102 ms 6884 KB Output is correct
9 Correct 105 ms 6884 KB Output is correct
10 Correct 2 ms 6884 KB Output is correct
11 Correct 2 ms 6884 KB Output is correct
12 Correct 2 ms 6884 KB Output is correct
13 Correct 2 ms 6884 KB Output is correct
14 Correct 2 ms 6884 KB Output is correct
15 Correct 2 ms 6884 KB Output is correct
16 Correct 2 ms 6884 KB Output is correct
17 Correct 2 ms 6884 KB Output is correct
18 Correct 2 ms 6884 KB Output is correct
19 Correct 2 ms 6884 KB Output is correct
20 Correct 5 ms 6884 KB Output is correct
21 Correct 4 ms 6884 KB Output is correct
22 Correct 6 ms 6884 KB Output is correct
23 Correct 3 ms 6884 KB Output is correct
24 Correct 4 ms 6884 KB Output is correct
25 Correct 6 ms 6884 KB Output is correct
26 Correct 5 ms 6884 KB Output is correct
27 Correct 5 ms 6884 KB Output is correct
28 Correct 6 ms 6884 KB Output is correct
29 Correct 5 ms 6884 KB Output is correct
30 Correct 3 ms 6884 KB Output is correct
31 Correct 129 ms 7112 KB Output is correct
32 Correct 99 ms 7112 KB Output is correct
33 Correct 147 ms 7112 KB Output is correct
34 Correct 181 ms 7164 KB Output is correct
35 Correct 202 ms 8184 KB Output is correct
36 Correct 191 ms 8184 KB Output is correct
37 Correct 159 ms 8184 KB Output is correct
38 Correct 149 ms 8184 KB Output is correct
39 Correct 71 ms 8184 KB Output is correct
40 Correct 136 ms 8184 KB Output is correct
41 Correct 155 ms 8184 KB Output is correct
42 Execution timed out 1073 ms 8184 KB Time limit exceeded
43 Halted 0 ms 0 KB -