当前位置:网站首页>D. Game With Array
D. Game With Array
2022-08-10 20:44:00 【秦小咩】
D. Game With Array
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Petya and Vasya are competing with each other in a new interesting game as they always do.
At the beginning of the game Petya has to come up with an array of NN positive integers. Sum of all elements in his array should be equal to SS. Then Petya has to select an integer KK such that 0≤K≤S0≤K≤S.
In order to win, Vasya has to find a non-empty subarray in Petya's array such that the sum of all selected elements equals to either KK or S−KS−K. Otherwise Vasya loses.
You are given integers NN and SS. You should determine if Petya can win, considering Vasya plays optimally. If Petya can win, help him to do that.
Input
The first line contains two integers NN and SS (1≤N≤S≤1061≤N≤S≤106) — the required length of the array and the required sum of its elements.
Output
If Petya can win, print "YES" (without quotes) in the first line. Then print Petya's array in the second line. The array should contain NN positive integers with sum equal to SS. In the third line print KK. If there are many correct answers, you can print any of them.
If Petya can't win, print "NO" (without quotes).
You can print each letter in any register (lowercase or uppercase).
Examples
input
Copy
1 4
output
Copy
YES 4 2
input
Copy
3 4
output
Copy
NO
input
Copy
3 8
output
Copy
YES 2 1 5 4
样例可不是白给的,从看样例到解决问题只需五分钟
根据两个YES和一个NO猜测是m与n是大于二倍关系才能完成表示,并通过手写几个小样例发现确实是这样,而且2倍的时候也能表示
再考虑通解,抓住大于2倍的特点,我们前n-1个全部填上1,剩下全部填上m-(n-1)
再把k选成m/2这样的话,无论怎么表示,要么小于m/2,要么大于m/2
做多了思路自然产生
#include<iostream>
#include<cstdio>
#include<cstring>
# include<iomanip>
#include<algorithm>
#define mo 998244353;
using namespace std;
typedef long long int ll;
int main()
{
int n,m;
cin>>n>>m;
if(m>=2*n)
{
cout<<"YES"<<endl;
int up=m/2;
for(int i=1;i<n;i++)
{
cout<<1<<" ";
}
cout<<m-(n-1)<<endl;
cout<<m/2<<endl;
}
else
{
cout<<"NO"<<endl;
}
return 0;
}
边栏推荐
- 2021 CybricsCTF
- Auto.js中APP应用相关指令
- (12) findContours function hierarchy explanation
- MySQL查询数据库中的表和字段
- 【语义分割】2016-SegNet TPAMI
- @Autowired annotation --required a single bean, but 2 were found causes and solutions
- Pt/CeO2 monatomic nanoparticles enzyme | H - rGO - Pt @ Pd NPs enzyme | carbon nanotube load platinum nanoparticles peptide modified nano enzyme | leukemia antagonism FeOPtPEG composite nano enzyme
- Before implementing MES management system, these three questions to consider
- The most complete GIS related software in history (CAD, FME, ArcGIS, ArcGISPro)
- ansible各个模块的详解和使用
猜你喜欢
paddle 35 paddledetection保存训练过程中的log信息
Iridium Ruthenium Alloy/Iridium Oxide Biomimetic Nanozyme | Palladium Nanozyme | GMP-Pd Nanozyme | Gold-Palladium Composite Nanozyme | Ternary Metal Pd-M-Ir Nanozyme |shell nanozyme
找的笔试题的复盘(一)
[email prot"/>
Transferrin-modified osthole long-circulating liposomes/PEG-PLGA nanoparticles loaded with notoginsenoside R1 ([email prot
QSslSocket has not been declared
win7开机有画面进系统黑屏怎么办
CMU博士论文 | 视频多模态学习:探索模型和任务复杂性
Single-click to cancel the function
壁仞推出全球最大算力芯片,号称以7nm超越英伟达4nm最新GPU
【图像分类】2019-MoblieNetV3 ICCV
随机推荐
"Distributed Microservice E-commerce" Topic (1) - Project Introduction
"POJ 3666" Making the Grade problem solution (two methods)
Auto.js中的悬浮窗
The servlet mapping path matching resolution
Web3中值得关注的基础设施
CMU博士论文 | 视频多模态学习:探索模型和任务复杂性
三子棋的设计和代码
测试开发【Mock 平台】08 开发:项目管理(四)编辑功能和Component抽离
【网络通信四】ping工具源码cmake工程编译以及运行说明
Redis命令手册
【go】依赖注入
OPPO Enco X2 迎来秋季产品升级 旗舰体验全面拉满
机器学习笔记:t-SNE
论配置化系统的配置
“蔚来杯“2022牛客暑期多校训练营7 F
win7开机有画面进系统黑屏怎么办
Kyligence 通过 SOC 2 Type II 审计,以可信赖的企业级产品服务全球客户
cordova installation error Command failed: powershell solution
2021DASCTF实战精英夏令营暨DASCTF July X CBCTF 4th
JS中的filter、map、reduce