Submission #973883

# Submission time Handle Problem Language Result Execution time Memory
973883 2024-05-02T12:14:42 Z Bilal_Coder Bank (IZhO14_bank) C++17
46 / 100
63 ms 436 KB
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n , m;
    scanf("%d %d" , &n , &m);
    vector<int> a(n) , b(m);
    for (auto & x : a)scanf("%d" , &x);
    for (auto & x : b)scanf("%d" , &x);
    for (auto x : a){
        bool flag = false;
        for (int mask = 0; mask < (1 << m); mask++){
            int sum = 0;

            for (int i = 0; i < m; i++)
                if (mask & (1 << i))sum += b[i];

            if (sum == x){
                flag = true;
                break;
            }
        }
        if (!flag){
            puts("NO");
            return 0;
        }
    }
    puts("YES");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |     scanf("%d %d" , &n , &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
bank.cpp:8:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     for (auto & x : a)scanf("%d" , &x);
      |                       ~~~~~^~~~~~~~~~~
bank.cpp:9:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     for (auto & x : b)scanf("%d" , &x);
      |                       ~~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 63 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 63 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 436 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 63 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 63 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -