oj.uz

답안 #768081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768081 2023-06-27T12:34:57 Z raysh07 은행 (IZhO14_bank) C++17
71 / 100
 1000 ms 8820 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n, m; cin >> n >> m;
    
    vector <int> a(n), b(m);
    for (auto &x : a) cin >> x;
    for (auto &x : b) cin >> x;
    
    int s1 = 0;
    vector <int> s(1 << m, 0);
    for (int i = 1; i < (1 << m); i++){
        for (int j = 0; j < m; j++){
            if (i >> j & 1) s[i] += b[j];
        }
    }
    
    vector <bool> can(1 << m, false);
    can[0] = true;
    for (auto x : a){
        s1 += x;
        vector <bool> nc(1 << m, false);
        
        for (int i = 0; i < (1 << m); i++){
            nc[i] = can[i];
            
            for (int j = 0; j < m; j++){
                if (i >> j & 1){
                    int mask = i ^ (1 << j);
                    if (nc[mask] && s[mask] >= s1 - x && s[i] <= s1){
                        nc[i] = true;
                    }
                }
            }
            
            if (nc[i] && s[i] == s1) can[i] = true;
            else can[i] = false;
        }
    }
    
    for (auto x : can) if (x == true){
        cout << "YES\n";
        return;
    }
    cout << "NO\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 146 ms 8668 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 146 ms 8796 KB Output is correct
9 Correct 135 ms 8788 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 4 ms 592 KB Output is correct
5 Correct 146 ms 8668 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 146 ms 8796 KB Output is correct
9 Correct 135 ms 8788 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 9 ms 340 KB Output is correct
21 Correct 4 ms 448 KB Output is correct
22 Correct 10 ms 452 KB Output is correct
23 Correct 14 ms 452 KB Output is correct
24 Correct 10 ms 452 KB Output is correct
25 Correct 8 ms 468 KB Output is correct
26 Correct 5 ms 456 KB Output is correct
27 Correct 4 ms 468 KB Output is correct
28 Correct 8 ms 468 KB Output is correct
29 Correct 8 ms 468 KB Output is correct
30 Correct 16 ms 468 KB Output is correct
31 Correct 215 ms 8792 KB Output is correct
32 Correct 322 ms 8820 KB Output is correct
33 Correct 584 ms 8804 KB Output is correct
34 Correct 754 ms 8792 KB Output is correct
35 Correct 825 ms 8788 KB Output is correct
36 Execution timed out 1079 ms 8780 KB Time limit exceeded
37 Halted 0 ms 0 KB -