P10330 [UESTCPC 2024] 黑白珠串
1.大雪球2.E. Final Countdown3.D. Divisible Pairs4.F. Chat Screenshots5.G. One-Dimensional Puzzle6.P8775 [蓝桥杯 2022 省 A] 青蛙过河7.Watering an Array8.Dora and Search9.P1137 旅行计划10.P3067 [USACO12OPEN] Balanced Cow Subsets G11.P4799 [CEOI2015 Day2] 世界冰球锦标赛12.A. Brick Wall13.B. Minimize Inversions14.C. XOR-distance15.A. Moving Chips16.B. Monsters Attack!17.C. Find B18.D. Slimes19.C. Turtle Fingers: Count the Values of k20.D. Turtle Tenacity: Continual Mods21.D. Vlad and Division22.C. LR-remainders23.P5322 [BJOI2019] 排兵布阵24.P2946 [USACO09MAR] Cow Frisbee Team S25.P1156 垃圾陷阱26.P1064 [NOIP2006 提高组] 金明的预算方案27.P3047 [USACO12FEB] Nearby Cows G28.P5020 [NOIP2018 提高组] 货币系统29.P3957 [NOIP2017 普及组] 跳房子30.P1550 [USACO08OCT] Watering Hole G31.P1525 [NOIP2010 提高组] 关押罪犯32.P1379 八数码难题33.P6121 [USACO16OPEN] Closing the Farm G34.P2341 [USACO03FALL / HAOI2006] 受欢迎的牛 G35.P9632 [ICPC2020 Nanjing R] K Co-prime Permutation36.P9825 [ICPC2020 Shanghai R] Fibonacci37.P2034 选择数字38.P7072 [CSP-J2020] 直播获奖39.P1714 切蛋糕40.P4147 玉蟾宫41.P2866 [USACO06NOV] Bad Hair Day S42.P2032 扫描43.P1884 [USACO12FEB] Overplanting S44.D. Lonely Mountain Dungeons45.F. Microcycle46.E. Increasing Subsequences__247.D. Valiant's New Map48.Array Repetition49.F. Rudolf and Imbalance50.D. Exam in MAC51.G. Rudolf and Subway52.C. Ehab and Path-etic MEXs53.A. String Transformation 154.D. Solve The Maze55.B. Array Fix56.B. Equal XOR57.F. Maximum White Subtree58.P1652 圆59.P2181 对角线60.P1325 雷达安装61.P3194 [HNOI2008] 水平可见直线62.B - Make Many Triangles63.[ARC172A] Chocolate64.C. Theofanis' Nightmare65.D. Birthday Gift66.C. Arrow Path67.P1265 公路修建68.P1284 三角形牧场69.Kirill and Mushrooms70.C. Sasha and the Casino71.P1470 [USACO2.3] 最长前缀 Longest Prefix72.P5536 【XR-3】核心城市73.P5836 [USACO19DEC] Milk Visits S74.P4391 [BOI2009] Radio Transmission 无线传输75.P3435 [POI2006] OKR-Periods of Words76.P5960 【模板】差分约束77.P3052 [USACO12MAR] Cows in a Skyscraper G78.E. Long Inversions79.C. Deep Down Below80.C. Rings81.F. Unfair Game82.G. GCD on a grid83.C. Inversion Graph84.Increase Subarray Sums85.D. Cross Coloring86.M. Triangle Construction87.D2. Set To Max (Hard Version)88.C. Array Game89.F. Alex's whims90.Queue Sort91.P1908 逆序对92.P5094 [USACO04OPEN] MooFest G 加强版93.P5149 会议座位94.P10337 [UESTCPC 2024] 操作序列
95.P10330 [UESTCPC 2024] 黑白珠串
96.P10252 线性变换97.P3901 数列找不同98.P10288 [GESP样题 八级] 区间99.P5677 [GZOI2017] 配对统计1.极限构造法 ,黑珠数量
再观察样例,发现刚好把1全部放左边,0全部放右边时等号成立
code
#include<bits/stdc++.h>
using namespace std;
int x,y[100005];
int main()
{
int k;
cin>>k;
int one=0,zero=0;
for(int i=1;i<=k;i++)
{
cin>>x>>y[i];
one=max(one,y[i]);
zero=max(zero,x-y[i]);
}
cout<<one+zero<<endl;
for(int i=1;i<=one;i++) cout<<1;
for(int i=1;i<=zero;i++) cout<<0;
puts("");
for(int i=1;i<=k;i++)
{
cout<<one-y[i]<<endl;
}
return 0;
}
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)