2017多校联合第8场1008/hdu 6140Hybrid Crystals(思维)
2017-08-18 09:36
561 查看
Hybrid Crystals
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 384 Accepted Submission(s): 240
Problem Description
> Kyber crystals, also called the living crystal or simply the kyber, and known as kaiburr crystals in ancient times, were rare, Force-attuned crystals that grew in nature and were found on scattered planets across the galaxy. They were used by the Jedi and
the Sith in the construction of their lightsabers. As part of Jedi training, younglings were sent to the Crystal Caves of the ice planet of Ilum to mine crystals in order to construct their own lightsabers. The crystal's mix of unique lustre was called "the
water of the kyber" by the Jedi. There were also larger, rarer crystals of great power and that, according to legends, were used at the heart of ancient superweapons by the Sith.
>
> — Wookieepedia
Powerful, the Kyber crystals are. Even more powerful, the Kyber crystals get combined together. Powered by the Kyber crystals, the main weapon of the Death Star is, having the firepower of thousands of Star Destroyers.
Combining Kyber crystals is not an easy task. The combination should have a specific level of energy to be stablized. Your task is to develop a Droid program to combine Kyber crystals.
Each crystal has its level of energy (i-th
crystal has an energy level of ai).
Each crystal is attuned to a particular side of the force, either the Light or the Dark. Light crystals emit positive energies, while dark crystals emit negative energies. In particular,
* For a light-side crystal of energy level ai,
it emits +ai units
of energy.
* For a dark-side crystal of energy level ai,
it emits −ai units
of energy.
Surprisingly, there are rare neutral crystals that can be tuned to either dark or light side. Once used, it emits either +ai or −ai units
of energy, depending on which side it has been tuned to.
Given n crystals'
energy levels ai and
types bi (1≤i≤n), bi=N means
the i-th
crystal is a neutral one, bi=L means
a Light one, and bi=D means
a Dark one. The Jedi Council asked you to choose some crystals to form a larger hybrid crystal. To make sure it is stable, the final energy level (the sum of the energy emission of all chosen crystals) of the hybrid crystal must be exactly k.
Considering the NP-Hardness of this problem, the Jedi Council puts some additional constraints to the array such that the problem is greatly simplified.
First, the Council puts a special crystal of a1=1,b1=N.
Second, the Council has arranged the other n−1 crystals
in a way that
ai≤∑j=1i−1aj[bj=N]+∑j=1i−1aj[bi=L∩bj=L]+∑j=1i−1aj[bi=D∩bj=D](2≤i≤n).
[cond] evaluates
to 1 if cond holds,
otherwise it evaluates to 0.
For those who do not have the patience to read the problem statements, the problem asks you to find whether there exists a set S⊆{1,2,…,n} and
values si for
all i∈S such
that
∑i∈Sai∗si=k,
where si=1 if
the i-th
crystal is a Light one, si=−1 if
the i-th
crystal is a Dark one, and si∈{−1,1} if
the i-th
crystal is a neutral one.
Input
The first line of the input contains an integer T,
denoting the number of test cases.
For each test case, the first line contains two integers n (1≤n≤103)
and k (|k|≤106).
The next line contains n integer a1,a2,...,an (0≤ai≤103).
The next line contains n character b1,b2,...,bn (bi∈{L,D,N}).
Output
If there exists such a subset, output "yes", otherwise output "no".
Sample Input
2 5 9 1 1 2 3 4 N N N N N 6 -10 1 0 1 2 3 1 N L L L L D
Sample Output
yes no
Source
2017 Multi-University Training Contest - Team 8
Recommend
liuyiding | We have carefully selected several similar problems for you: 6143 6142 6141 6140 6139
Statistic | Submit | Discuss | Note
题意:L是加的数,D是减的数,N可加可减。给定ai和k问,是否能满足从ai中选一个集合,使得集合里的数的和为k。
给定的ai和字符串满足
ai≤∑j=1i−1aj[bj=N]+∑j=1i−1aj[bi=L∩b
4000
j=L]+∑j=1i−1aj[bi=D∩bj=D](2≤i≤n).
答案就是-D - N <= k <= L+N
#include <iostream> #include <algorithm> #include <cstdio> #include <cmath> #include <cstring> #include <string> #include <string.h> #include <map> #include <set> #include <queue> #include <deque> #include <list> #include <bitset> #include <stack> #include <stdlib.h> #define lowbit(x) (x&-x) #define e exp(1.0) const int mod=1e9+7; const int inf=0x3f3f3f; //ios::sync_with_stdio(false); // auto start = clock(); // cout << (clock() - start) / (double)CLOCKS_PER_SEC; typedef long long ll; typedef long long LL; using namespace std; int a[1005]; char b[1005]; int main() { int T; cin>>T; while(T--) { int sum1=0; int sum2=0; int n,k; cin>>n>>k; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) { cin>>b[i]; if(b[i]=='N')sum1+=a[i],sum2+=a[i]; if(b[i]=='L')sum1+=a[i]; if(b[i]=='D')sum2+=a[i]; } if(k>0) { if(sum1>=k)cout<<"yes"<<endl; else cout<<"no"<<endl; } else { k=-k; if(sum2>=k)cout<<"yes"<<endl; else cout<<"no"<<endl; } } return 0; }
相关文章推荐
- 2017多校八 1008题 hdu 6140 Hybrid Crystals 推理
- HDU 2017 多校联合训练赛8 1008 6140 Hybrid Crystals
- HDU 6140 Hybrid Crystals【题意】【思维】
- HDU_6140 Hybrid Crystals 【思维】
- HDU - 6140 Hybrid Crystals(思维)
- HDU 6140 17多校8 Hybrid Crystals(思维题)
- HDU 6140 Hybrid Crystals【思维】
- hdu 6140 Hybrid Crystals 思维
- Hdu 6140 Hybrid Crystals【思维】
- 2017 HDU 6140 多校联合赛 Hybrid Crystals
- HDU 6140 Hybrid Crystals(思维)
- 2017多校八 1008题 hdu 6140 Hybrid Crystals 推理
- HDU 6140 Hybrid Crystals
- hdu 6140 Hybrid Crystals 阅读题 OR bitset 优化01背包
- HDU 6140 Hybrid Crystals
- 2017多校第8场 HDU 6138 Fleet of the Eternal Throne 思维,暴力
- 2017多校联合第二场 1008题 hdu 6052 To my boyfriend 计数 单调队列
- HDU 6140 Hybrid Crystals【阅读题】【水题】
- 【多校训练】hdu 6140 Hybrid Crystals
- HDU 6140 Hybrid Crystals(zz)