传送门
题意
给你一个 n n n个整数的序列 a 1 , a 2 , … , a n a_{1},a_{2},…,a_{n} a1,a2,…,an。
是否存在一个 n n n个整数的序列$b_{1},b_{2},…,b_{n},使下面的性质成立?
对于每个 1 ≤ i ≤ n 1≤i≤n 1≤i≤n,存在两个(不一定是不同的)指数 j j j和 k k k( 1 ≤ j , k ≤ n 1≤j,k≤n 1≤j,k≤n),使得 a i = b j − b k a_{i}=b_{j}-b_{k} ai=bj−bk
分析
我们可以把 a i a_{i} ai看成 b i b_{i} bi这个图中,任意两个点之间的权值的绝对值,所以我们只要能构造出来一个子图,他们相加或者相减的结果为0即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N];
int n;
bool dfs(int u,int sum,bool st){
if(u > n) return sum == 0 && st;
bool flag = 0;
flag |= dfs(u + 1,sum,st);
flag |= dfs(u + 1,sum + a[u],1);
flag |= dfs(u + 1,sum - a[u],1);
return flag;
}
int main() {
int T;
read(T);
while(T--){
read(n);
for(int i = 1;i <= n;i++) read(a[i]);
if(dfs(1,0,0)) puts("YES");
else puts("NO");
}
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/