oj.uz

답안 #594168

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594168 2022-07-12T07:25:29 Z leroycut 은행 (IZhO14_bank) C++17
100 / 100
 79 ms 8552 KB 
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;
 
const int N = 100003, mod = 1e9 + 7, inf = 1e9 + 7;

int n, m;


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    // freopen("movie.in", "r", stdin);
    // freopen("movie.out", "w", stdout);

    
    cin >> n >> m;
    vector<int> vn(n), vm(m), last((1 << m)), dp((1 << m), -1);

    for(int i = 0; i < n; ++i){
        cin >> vn[i];
    }
    for(int j = 0; j < m; ++j){
        cin >> vm[j];
    }

    dp[0] = 0;
    last[0] = 0;

    for(int s = 1; s < (1 << m); ++s){
        for(int i = 0; i < m; ++i){
            if((s & (1 << i))){
                int prev = s - (1 << i);
                if(dp[prev] == n){
                    dp[s] = n;
                    break;
                }
                if(dp[prev] == -1) continue;
                if(last[prev] + vm[i] < vn[dp[prev]]){
                    dp[s] = dp[prev];
                    last[s] = last[prev] + vm[i];
                    break;
                }
                if(last[prev] + vm[i] == vn[dp[prev]]){
                    dp[s] = dp[prev] + 1;
                    last[s] = 0;
                    // cout << prev << " lox\n";
                    break;
                }

            }
        }
        // cout << dp[s] << " " << last[s] << "\n";
    }

    if(dp[(1 << m) - 1] == n){
        cout << "YES";
    }
    else{
        cout << "NO";
    }
    // cout << dp[(1 << m) - 1];
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 572 KB Output is correct
5 Correct 70 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 28 ms 8516 KB Output is correct
9 Correct 10 ms 8492 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 320 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 1 ms 340 KB Output is correct
2 Correct 2 ms 448 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 452 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 444 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 448 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 572 KB Output is correct
5 Correct 70 ms 8532 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 28 ms 8516 KB Output is correct
9 Correct 10 ms 8492 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 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 320 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 448 KB Output is correct
22 Correct 2 ms 448 KB Output is correct
23 Correct 2 ms 448 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 452 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 444 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 25 ms 8508 KB Output is correct
32 Correct 16 ms 8532 KB Output is correct
33 Correct 73 ms 8532 KB Output is correct
34 Correct 68 ms 8532 KB Output is correct
35 Correct 74 ms 8520 KB Output is correct
36 Correct 71 ms 8532 KB Output is correct
37 Correct 73 ms 8532 KB Output is correct
38 Correct 68 ms 8532 KB Output is correct
39 Correct 10 ms 8552 KB Output is correct
40 Correct 72 ms 8532 KB Output is correct
41 Correct 71 ms 8528 KB Output is correct
42 Correct 66 ms 8532 KB Output is correct
43 Correct 79 ms 8532 KB Output is correct
44 Correct 72 ms 8536 KB Output is correct
45 Correct 70 ms 8532 KB Output is correct
46 Correct 76 ms 8424 KB Output is correct
47 Correct 72 ms 8532 KB Output is correct
48 Correct 31 ms 8532 KB Output is correct
49 Correct 70 ms 8532 KB Output is correct
50 Correct 20 ms 8532 KB Output is correct
51 Correct 73 ms 8532 KB Output is correct
52 Correct 72 ms 8532 KB Output is correct
53 Correct 21 ms 8524 KB Output is correct
54 Correct 21 ms 8552 KB Output is correct
55 Correct 20 ms 8512 KB Output is correct
56 Correct 15 ms 8532 KB Output is correct
57 Correct 15 ms 8532 KB Output is correct
58 Correct 15 ms 8424 KB Output is correct