# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
88434 | 2018-12-05T21:43:03 Z | xiaowuc1 | 은행 (IZhO14_bank) | C++14 | 1000 ms | 15468 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int n, m; int bases[20]; vector<int> masks[1001]; unordered_set<int> solve(vector<int> v, int leftover) { unordered_set<int> ret; ret.insert(0); for(int i = 0; i < v.size(); i++) { unordered_set<int> nret; for(int out2: ret) { for(int out: masks[v[i]]) { if(out&out2) continue; if(__builtin_popcount(out | out2) + (leftover + v.size()-i-1) > m) continue; nret.insert(out | out2); } } ret = nret; } return ret; } void solve() { cin >> n >> m; vector<int> a, b; for(int i = 0; i < n; i++) { int t; cin >> t; (i%2 ? a : b).push_back(t); } for(int i = 0; i < m; i++) cin >> bases[i]; for(int mask = 1; mask < (1<<m); mask++) { int v = 0; int t = mask; while(v <= 1000 && t) { v += bases[__builtin_ctz(t)]; t &= t-1; } if(v <= 1000) masks[v].push_back(mask); } unordered_set<int> reta = solve(a, b.size()); unordered_set<int> retb = solve(b, a.size()); for(int outa: reta) { for(int outb: retb) { if((outa&outb) == 0) { cout << "YES\n"; return; } } } cout << "NO\n"; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
4 | Correct | 2 ms | 776 KB | Output is correct |
5 | Correct | 26 ms | 6744 KB | Output is correct |
6 | Correct | 2 ms | 6744 KB | Output is correct |
7 | Correct | 2 ms | 6744 KB | Output is correct |
8 | Correct | 27 ms | 6744 KB | Output is correct |
9 | Correct | 27 ms | 6744 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 6744 KB | Output is correct |
2 | Correct | 2 ms | 6744 KB | Output is correct |
3 | Correct | 2 ms | 6744 KB | Output is correct |
4 | Correct | 2 ms | 6744 KB | Output is correct |
5 | Correct | 2 ms | 6744 KB | Output is correct |
6 | Correct | 2 ms | 6744 KB | Output is correct |
7 | Correct | 2 ms | 6744 KB | Output is correct |
8 | Correct | 2 ms | 6744 KB | Output is correct |
9 | Correct | 2 ms | 6744 KB | Output is correct |
10 | Correct | 2 ms | 6744 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 6744 KB | Output is correct |
2 | Correct | 2 ms | 6744 KB | Output is correct |
3 | Correct | 2 ms | 6744 KB | Output is correct |
4 | Correct | 2 ms | 6744 KB | Output is correct |
5 | Correct | 3 ms | 6744 KB | Output is correct |
6 | Correct | 2 ms | 6744 KB | Output is correct |
7 | Correct | 2 ms | 6744 KB | Output is correct |
8 | Correct | 2 ms | 6744 KB | Output is correct |
9 | Correct | 2 ms | 6744 KB | Output is correct |
10 | Correct | 2 ms | 6744 KB | Output is correct |
11 | Correct | 2 ms | 6744 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 552 KB | Output is correct |
4 | Correct | 2 ms | 776 KB | Output is correct |
5 | Correct | 26 ms | 6744 KB | Output is correct |
6 | Correct | 2 ms | 6744 KB | Output is correct |
7 | Correct | 2 ms | 6744 KB | Output is correct |
8 | Correct | 27 ms | 6744 KB | Output is correct |
9 | Correct | 27 ms | 6744 KB | Output is correct |
10 | Correct | 2 ms | 6744 KB | Output is correct |
11 | Correct | 2 ms | 6744 KB | Output is correct |
12 | Correct | 2 ms | 6744 KB | Output is correct |
13 | Correct | 2 ms | 6744 KB | Output is correct |
14 | Correct | 2 ms | 6744 KB | Output is correct |
15 | Correct | 2 ms | 6744 KB | Output is correct |
16 | Correct | 2 ms | 6744 KB | Output is correct |
17 | Correct | 2 ms | 6744 KB | Output is correct |
18 | Correct | 2 ms | 6744 KB | Output is correct |
19 | Correct | 2 ms | 6744 KB | Output is correct |
20 | Correct | 2 ms | 6744 KB | Output is correct |
21 | Correct | 2 ms | 6744 KB | Output is correct |
22 | Correct | 2 ms | 6744 KB | Output is correct |
23 | Correct | 2 ms | 6744 KB | Output is correct |
24 | Correct | 3 ms | 6744 KB | Output is correct |
25 | Correct | 2 ms | 6744 KB | Output is correct |
26 | Correct | 2 ms | 6744 KB | Output is correct |
27 | Correct | 2 ms | 6744 KB | Output is correct |
28 | Correct | 2 ms | 6744 KB | Output is correct |
29 | Correct | 2 ms | 6744 KB | Output is correct |
30 | Correct | 2 ms | 6744 KB | Output is correct |
31 | Correct | 28 ms | 6744 KB | Output is correct |
32 | Correct | 83 ms | 6916 KB | Output is correct |
33 | Correct | 20 ms | 6916 KB | Output is correct |
34 | Correct | 8 ms | 6916 KB | Output is correct |
35 | Correct | 10 ms | 6916 KB | Output is correct |
36 | Correct | 9 ms | 6916 KB | Output is correct |
37 | Correct | 15 ms | 6916 KB | Output is correct |
38 | Correct | 18 ms | 6916 KB | Output is correct |
39 | Correct | 30 ms | 6916 KB | Output is correct |
40 | Correct | 24 ms | 6916 KB | Output is correct |
41 | Correct | 20 ms | 6916 KB | Output is correct |
42 | Correct | 60 ms | 6916 KB | Output is correct |
43 | Correct | 23 ms | 6916 KB | Output is correct |
44 | Correct | 8 ms | 6916 KB | Output is correct |
45 | Correct | 27 ms | 6916 KB | Output is correct |
46 | Correct | 26 ms | 6916 KB | Output is correct |
47 | Correct | 9 ms | 6916 KB | Output is correct |
48 | Correct | 27 ms | 6916 KB | Output is correct |
49 | Correct | 26 ms | 6916 KB | Output is correct |
50 | Correct | 228 ms | 13812 KB | Output is correct |
51 | Correct | 40 ms | 13812 KB | Output is correct |
52 | Correct | 216 ms | 13812 KB | Output is correct |
53 | Correct | 648 ms | 15468 KB | Output is correct |
54 | Correct | 39 ms | 15468 KB | Output is correct |
55 | Correct | 244 ms | 15468 KB | Output is correct |
56 | Correct | 276 ms | 15468 KB | Output is correct |
57 | Execution timed out | 1074 ms | 15468 KB | Time limit exceeded |
58 | Halted | 0 ms | 0 KB | - |