oj.uz

Submission #824319

# Submission time Handle Problem Language Result Execution time Memory
824319 2023-08-14T02:24:43 Z christinelynn Bank (IZhO14_bank) C++17
19 / 100
 9 ms 324 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void print(string Z) {
    cout << Z << endl;
}
ll arr[23];
ll arr2[23];
ll ps[23];
bool flag[23];
ll N, M;
bool check(ll idx, ll nd, ll ret) {
    if(ret == nd) {
        flag[idx-1] = 1;
        check(0, nd-arr2[idx-1], ret);
        return 1;
    }
    else if(flag[idx]) {
        return check(idx+1, nd, ret);
    }
    else if(idx > M || ret > nd) {
        return 0;
    }
    else {
        return (check(idx+1, nd, ret+arr2[idx]) || check(idx+1, nd, ret));
    }
}
int main() {
     ios_base::sync_with_stdio(0);
     cin.tie(0);
     cout.tie(0);
    cin >> N >> M;
    for(int i=0; i<N; i++) {
        cin >> arr[i];
    }
    for(int i=0; i<M; i++) {
        cin >> arr2[i];
        if(i == 0) {
            ps[i] = arr2[i];
        }
        else {
            ps[i] = ps[i-1] + arr2[i];
        }
    }
    sort(arr2, arr2+M);
    bool X = 1;
    for(int i=0; i<N; i++) {
         X = X && check(0, arr[i], 0);
    }
    if(X) {
        print("YES");
    }
    else {
        print("NO");
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 9 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 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 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -