Submission #51039065

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;
    Vec aset(n);
    for(auto&& a : aset) {
        is >> a;
    }

    Num m {0};
    is >> m;
    Vec bset(m);
    for(auto&& b : bset) {
        is >> b;
    }

    Num l {0};
    is >> l;
    Vec cset(l);
    for(auto&& c : cset) {
        is >> c;
    }

    Set ss;
    for(const auto& a : aset) {
        for(const auto& b : bset) {
            for(const auto& c : cset) {
                ss.insert(a + b + c);
            }
        }
    }

    Num q {0};
    is >> q;
    while(q-- > 0) {
        Num x {0};
        is >> x;
        if (ss.contains(x)) {
            os << "Yes\n";
        } else {
            os << "No\n";
        }
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result