oj.uz

답안 #899549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899549 2024-01-06T12:29:04 Z nasir_bashirov 은행 (IZhO14_bank) C++11
100 / 100
 86 ms 8792 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#include <bits/stdc++.h>
using namespace std;
 
#define db long double
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio\
    ios_base::sync_with_stdio(0);\
    cin.tie(0);\
    cout.tie(0)\
  
const int inf = -1e9;
int a[25], b[25], n, m;
vii dp((1 << 20) + 5, {0, 0});

signed main(){
    fastio;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= m; i++){
        cin >> b[i];
    }
    for(int mask = 1; mask < (1 << m); mask++){
        for(int j = 0; j < m; j++){
            if((1 << j) & mask){
                int out = mask ^ (1 << j);
                if(a[dp[out].first + 1] == dp[out].second + b[j + 1]){
                    if(dp[mask].first < dp[out].first + 1)  dp[mask] = {dp[out].first + 1, 0};
                }
                else{
                    if(dp[mask].first <= dp[out].first)  dp[mask] = {dp[out].first, dp[out].second + b[j + 1]};
                }
            }
        }
    }
    int mx = 0;
    for(int mask = 0; mask < (1 << m); mask++){
        mx = max(dp[mask].first, mx);
    }
    if(mx == n) cout << "YES";
    else   cout << "NO";
}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 72 ms 8540 KB Output is correct
6 Correct 2 ms 8536 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 76 ms 8540 KB Output is correct
9 Correct 72 ms 8536 KB Output is correct
10 Correct 3 ms 8692 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8536 KB Output is correct
15 Correct 2 ms 8540 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 3 ms 8536 KB Output is correct
21 Correct 3 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8540 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 3 ms 8540 KB Output is correct
29 Correct 3 ms 8540 KB Output is correct
30 Correct 3 ms 8540 KB Output is correct
31 Correct 79 ms 8540 KB Output is correct
32 Correct 75 ms 8536 KB Output is correct
33 Correct 78 ms 8540 KB Output is correct
34 Correct 76 ms 8536 KB Output is correct
35 Correct 78 ms 8792 KB Output is correct
36 Correct 72 ms 8540 KB Output is correct
37 Correct 73 ms 8536 KB Output is correct
38 Correct 72 ms 8540 KB Output is correct
39 Correct 71 ms 8536 KB Output is correct
40 Correct 75 ms 8540 KB Output is correct
41 Correct 72 ms 8536 KB Output is correct
42 Correct 85 ms 8536 KB Output is correct
43 Correct 76 ms 8540 KB Output is correct
44 Correct 72 ms 8540 KB Output is correct
45 Correct 86 ms 8536 KB Output is correct
46 Correct 80 ms 8540 KB Output is correct
47 Correct 73 ms 8536 KB Output is correct
48 Correct 78 ms 8536 KB Output is correct
49 Correct 73 ms 8536 KB Output is correct
50 Correct 66 ms 8540 KB Output is correct
51 Correct 74 ms 8536 KB Output is correct
52 Correct 76 ms 8536 KB Output is correct
53 Correct 76 ms 8540 KB Output is correct
54 Correct 74 ms 8540 KB Output is correct
55 Correct 67 ms 8540 KB Output is correct
56 Correct 67 ms 8540 KB Output is correct
57 Correct 71 ms 8536 KB Output is correct
58 Correct 66 ms 8540 KB Output is correct