제출 #500205

#제출 시각아이디문제언어결과실행 시간메모리
500205armashka은행 (IZhO14_bank)C++17
19 / 100
108 ms532 KiB
#include <bits/stdc++.h> //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); #define all(v) v.begin(),v.end() #define pb push_back #define sz size() #define ft first #define sd second using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef unsigned long long ull; const int N = 1e5 + 5; const ll M = 1e8; const ll inf = 1e18; const ll mod = 1e9; const double Pi = acos(-1); ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;} ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;} ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); } bool odd(ll n) { return (n % 2 == 1); } bool even(ll n) { return (n % 2 == 0); } ll n, m, a[25], b[25]; vector <ll> v[25]; bool used[N]; void dfs(ll vv, ll dis) { int to = vv + 1; used[vv] = 1; for (auto x : v[to]) { ll next = dis ^ x; if (__builtin_popcount(next) ==__builtin_popcount(dis) + __builtin_popcount(next)) { //cout << vv << " " << to << "-> " << dis << "\n"; dfs(to, dis ^ x); } } } const void solve(/*Armashka*/) { cin >> n >> m; for (int i = 1; i <= n; ++ i) cin >> a[i]; for (int j = 1; j <= m; ++ j) cin >> b[j]; for (int mask = 0; mask < (1 << (m + 1)); ++ mask) { ll sum = 0; for (int i = 1; i <= m; ++ i) { if (mask & (1 << i)) sum += b[i]; } for (int i = 1; i <= n; ++ i) { if (sum == a[i]) v[i].pb(mask); } } for (auto x : v[1]) { dfs(1, x); } /*for (int i = 1; i <= n; ++ i) { for (auto x : v[i]) cout << x << " "; cout << "\n"; }*/ if (used[n]) cout << "YES\n"; else cout << "NO\n"; } signed main() { fast; //freopen("threesum.in", "r", stdin); //freopen("threesum.out", "w", stdout); int tt = 1; //cin >> tt; while (tt --) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...