답안 #598424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598424	2022-07-18T10:51:55 Z	Belgutei	은행 (IZhO14_bank)	C++17	100 / 100	551 ms	36184 KB

bank

#include <bits/stdc++.h>

using namespace std;

typedef pair<long long, long long> Point;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
#define MOD 1000000007
#define MOD1 1000000009
#define sqr(x) sqr((x)*(x))

void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#ifdef BE_DEBUG
#define debug(...) cerr << "\033[1;31m(" << #__VA_ARGS__ << "):\033[0m", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

const int N = 1100005;
int n,m;
int a[30], b[30];
vector<int> v[1005];
bool check[N][30], ans;

int go(int val) {
    int ret = 0;
    int cnt = 0;
    while(val > 0) {
        if(val % 2 == 1) ret += b[cnt];
        val /= 2;
        cnt ++;
    }
    return ret;
}

int main() {
    IOS
    cin >> n >> m;
    for(int i = 0; i < n; i ++) cin >> a[i];
    for(int i = 0; i < m; i ++) cin >> b[i];
    for(int i = 0; i < (1 << m); i ++) {
        int val = go(i);
        if(val <= 1000) {
            v[val].pb(i);
        }
    }
    for(int i = 0; i < n; i ++) {
        if(i == 0) {
            for(auto x: v[a[i]]) {
                check[x][i] = 1;
                if(i == n - 1) ans = 1;
            }

            continue;
        }
        //
        for(int j = 0; j < (1 << m); j ++) {
            if(check[j][i - 1] == 0) continue;
            for(auto x: v[a[i]]) {
                if((x & j) == 0) {
                    check[x | j][i] = 1;
                    if(i == n - 1) ans = 1;
                }
            }
        }
        //
    }
    
    if(ans == 1) {
        cout << "YES";
    }
    else cout << "NO";
}

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	65 ms	6668 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	77 ms	25620 KB	Output is correct
9	Correct	65 ms	6348 KB	Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	2 ms	980 KB	Output is correct
5	Correct	65 ms	6668 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	77 ms	25620 KB	Output is correct
9	Correct	65 ms	6348 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	388 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	2 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	2 ms	340 KB	Output is correct
31	Correct	69 ms	9852 KB	Output is correct
32	Correct	205 ms	29960 KB	Output is correct
33	Correct	63 ms	2684 KB	Output is correct
34	Correct	61 ms	480 KB	Output is correct
35	Correct	65 ms	460 KB	Output is correct
36	Correct	67 ms	344 KB	Output is correct
37	Correct	64 ms	572 KB	Output is correct
38	Correct	62 ms	568 KB	Output is correct
39	Correct	93 ms	31744 KB	Output is correct
40	Correct	63 ms	2008 KB	Output is correct
41	Correct	67 ms	888 KB	Output is correct
42	Correct	81 ms	23760 KB	Output is correct
43	Correct	71 ms	2844 KB	Output is correct
44	Correct	68 ms	344 KB	Output is correct
45	Correct	75 ms	20756 KB	Output is correct
46	Correct	65 ms	7464 KB	Output is correct
47	Correct	67 ms	424 KB	Output is correct
48	Correct	64 ms	15956 KB	Output is correct
49	Correct	66 ms	6132 KB	Output is correct
50	Correct	197 ms	35908 KB	Output is correct
51	Correct	70 ms	6692 KB	Output is correct
52	Correct	84 ms	20900 KB	Output is correct
53	Correct	551 ms	35968 KB	Output is correct
54	Correct	211 ms	35828 KB	Output is correct
55	Correct	190 ms	35904 KB	Output is correct
56	Correct	214 ms	36128 KB	Output is correct
57	Correct	190 ms	36168 KB	Output is correct
58	Correct	194 ms	36184 KB	Output is correct

답안 #598424

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0