hdu6140Hybrid Crystals(水)
来源:互联网 发布:数据透视表多条件筛选 编辑:程序博客网 时间:2024/05/22 04:43
Hybrid Crystals
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 667 Accepted Submission(s): 429
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 levelai , it emits +ai units of energy.
* For a dark-side crystal of energy levelai , 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.
Givenn 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 ofa1=1,b1=N .
Second, the Council has arranged the othern−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 setS⊆{1,2,…,n} and values si for all i∈S such that
∑i∈Sai∗si=k,
wheresi=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.
>
> — 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 (
* For a light-side crystal of energy level
* For a dark-side crystal of energy level
Surprisingly, there are rare neutral crystals that can be tuned to either dark or light side. Once used, it emits either
Given
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
Second, the Council has arranged the other
For those who do not have the patience to read the problem statements, the problem asks you to find whether there exists a set
where
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 integersn (1≤n≤103 ) and k (|k|≤106 ).
The next line containsn integer a1,a2,...,an (0≤ai≤103 ).
The next line containsn character b1,b2,...,bn (bi∈{L,D,N} ).
For each test case, the first line contains two integers
The next line contains
The next line contains
Output
If there exists such a subset, output "yes", otherwise output "no".
Sample Input
25 9 1 1 2 3 4N N N N N 6 -101 0 1 2 3 1N L L L L D
Sample Output
yesno
Source
2017 Multi-University Training Contest - Team 8
统计是否存在一个值能让n个水晶对应的类转换而成。N代表中性,能正能负,D代表负,L代表正
统计下界和上界,如果值在中间则存在
/** by z_guibin*/#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <queue>#include <iostream>using namespace std;int num[20100];int main(){ int t,n,k; int a[1001]; char b[1001]; scanf("%d",&t); while(t--) { getchar(); memset(num,0,sizeof(num)); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); scanf("%d %d",&n,&k); for(int i=1; i<=n; i++) { scanf("%d",&a[i]); } //getchar(); for(int i=1; i<=n; i++) { cin>>b[i]; //getchar(); } //getchar(); int down=-1,up=1; for(int i=1;i<=n;i++) { if(b[i]=='N') { up+=a[i]; down-=a[i]; } else if(b[i]=='L') { up+=a[i]; } else if(b[i]=='D') { down-=a[i]; } } if(up>=k&&down<=k) cout<<"yes"<<endl; else cout<<"no"<<endl; } return 0;}
阅读全文
0 0
- hdu6140Hybrid Crystals(水)
- HDU6140Hybrid Crystals(证明题)
- Hybrid Crystals(HDU 6140)
- HDU 6140 Hybrid Crystals(思维)
- HDU 6140 Hybrid Crystals (玄学背包)
- HDU 6140 Hybrid Crystals(坑题)
- HDU 6140 Hybrid Crystals(坑)
- HDU 6140 Hybrid Crystals(zz)
- HDU 6140 Hybrid Crystals(思维)
- hdu 6140 Hybrid Crystals(数学+思维)
- HDU 6140 Hybrid Crystals(坑题+水题)
- HDU 6140 Hybrid Crystals(01背包)
- Hdu6140 Hybrid Crystals(2017多校第8场)
- Hybrid Crystals
- HDU 6140 Hybrid Crystals (2017 Multi-Univ Training Contest 8)
- Hybrid Crystals (2017多校 第八场) (思维题 视力题)
- 2017多校联合第8场1008/hdu 6140Hybrid Crystals(思维)
- HDU 6140 Hybrid Crystals
- nyoj 20 吝啬的国度
- 爬虫实战——爬百思不得姐
- 自定义View(四) Graphics2D 实现动态效果
- pyHook, pythoncom编写键盘鼠标监控器
- c++常用知识点1
- hdu6140Hybrid Crystals(水)
- C++函数返回值发生的对象复制
- 第一个.NetCore 2.0程序
- Java微信公众平台开发之将本地开发环境映射到公网访问
- gridControl
- flex-layout Responsive API
- HDU6154-CaoHaha's staff
- sysConfig.bat 闪退问题及此处不应有 \Java\jdk1.7.0_79问题的解决
- 使用python的BeautifulSoup库解析页面应选择适当容错能力的解析器