Cake Assembly Line

合集 - 刷题集(97)
1.妖梦拼木棒2.[USACO1.2]回文平方数 Palindromic Squares3.[COCI2012-2013#1] LJUBOMORA4.火柴棒等式5.Kieszonkowe6.[COCI2014-2015#5] TRAKTOR7.硬币翻转8.[蓝桥杯 2020 省 AB1] 走方格9.P2097 资料分发10.[AHOI2005]约数研究11.[NOIP2004 普及组] 火星人12.我焯,原神(这真是个题)13.滑雪 OJ365114.CV的人有福啦!YTU贪心训练2(部分注释)15.砝码称重16.警钟长鸣-----找零钱17.[USACO09OCT]Barn Echoes G18.【CSGRound2】光骓者的荣耀19.初见蓝桥杯20.[蓝桥杯 2022 省 B] 扫雷21.开餐馆22.P9241 [蓝桥杯 2023 省 B] 飞机降落23.P7083 [NWRRC2013] Energy Tycoon24.高精度25.P7954 [COCI2014-2015#6] PAPRIKA26.(输出路径搜索)[USACO06OCT] Cows on Skates G27.畜栏保留问题28.(贪心+搜索+剪枝)P8801 [蓝桥杯 2022 国 B] 最大数字29.蓝桥杯 入门----普及-30.[NOIP2016 提高组] 玩具谜题31.[NOIP2002 提高组] 字串变换(无向图查重)32.[NOIP2000 提高组] 单词接龙33.POJ 硬币34.动态规划学习 1(最长上升子序列问题)35.动态规划学习 2(背包问题及其变形)36. 切割回文37.[NOIP2001 提高组] 数的划分(剪枝)38.字符串转换数字,sscanf和sprintf大法39.[CTSC1997] 选课(树状DP)40. k 倍区间(同余定理,组合数)41.[蓝桥杯 2018 省 AB] 全球变暖42.马的遍历(对bfs的更深一层探讨)43.找零钱44.Pasha Maximizes45.Newspaper Headline46.Balanced Ternary String47.(数论)素数,质数48.(数论) 约数49.Helping the Nature50.(博弈论)Even Number Addicts51.Present52.Mr. Kitayuta's Colorful Graph(二维并查集,弱化版)53.Edgy Trees(dfs,并查集,快速幂,树形结构,红黑树)54.并查集55.再谈 前缀和,差分,离散化56.Best Cow Fences(前缀和+特殊二分)57.二分58.同类型,类背包动态规划,选地dp59.Primes on Interval(欧拉筛+二分+滑动窗口)60.字符串(KMP , Trie树 , STL)61.Codeforces1 #879 div.262.Add Modulo 10(数论,思维,数学,规律)63.期末考试YTU4035: Shmily(数学,等差数列)64.[POI2006] OKR-Periods of Words65.Getting Zero(Bfs)66.快速幂67.Dreaming of Freedom(数论,贪心)68.Scoring Subsequences69.Dolce Vita
70.Cake Assembly Line
71.Constructive Problem72.Forever Winter73.Maximum Sum(前缀和)74.Contrast Value(数学规律)75.Lamps(STL+双端队列)76.Long Long77.Sum in Binary Tree78.Apple Tree(树状搜索,树形DP)79.Strong Password(贪心思想)80.Come Together81.Notepad82.Hamiltonian Wall83.7.17作业84.逛画展(双指针)85.#88586.树状数组87.Subsequence Addition88.7.22作业89.Diverse Substrings90.Tracking Segments(二分,区间前缀)91.最大食物链计数92.线段树193.[TJOI2007] 线段(状态机)94.#87895.测试196.李白打酒97.砍竹子
收起
Cake Assembly Line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A cake assembly line in a bakery was once again optimized, and now n cakes are made at a time! In the last step, each of the n cakes should be covered with chocolate.

Consider a side view on the conveyor belt, let it be a number line. The i-th cake occupies the segment [ai−w,ai+w][−,+] on this line, each pair of these segments does not have common points. Above the conveyor, there are n dispensers, and when a common button is pressed, chocolate from the i-th dispenser will cover the conveyor segment [bi−h,bi+h][−ℎ,+ℎ]. Each pair of these segments also does not have common points.

Cakes and dispensers corresponding to the first example.

The calibration of this conveyor belt part has not yet been performed, so you are to make it. Determine if it's possible to shift the conveyor so that each cake has some chocolate on it, and there is no chocolate outside the cakes. You can assume that the conveyour is long enough, so the cakes never fall. Also note that the button can only be pressed once.

In the first example we can shift the cakes as shown in the picture.
Input

Each test contains multiple test cases. The first line contains the number of test cases t (1≤t≤1051≤≤105). The description of the test cases follows.

The first line of each test case contains three integers n, w, and hℎ (1≤n≤1051≤≤105; 1≤w,h≤1051≤,ℎ≤105; h≤wℎ≤) — the number of cakes and dispensers, as well as the halfwidths of cakes and segments on which the chocolate is dispensed.

The second line contains n integers a11, a22, ..., an (1≤ai≤1091≤≤109) — the positions of the cakes centers. It is guaranteed that ai+w<ai+1−w+<+1− for all i.

The third line contains n integers b11, b22, ..., bn (1≤bi≤1091≤≤109) — the positions of the dispensers. It is guaranteed that bi+h<bi+1−h+ℎ<+1−ℎ for all i.

It is guaranteed that the sum of n over all test cases does not exceed 105105.

Output

For each test case output "YES", if it's possible to shift the conveyor in such a way that each cake ends up with some chocolate, and no chocolate is outside the cakes, and "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Example
input
Copy
4
3 10 5
65 95 165
40 65 145
5 2 1
1 6 11 16 21
4 9 14 19 24
3 3 2
13 22 29
5 16 25
4 4 1
27 36 127 136
35 50 141 144
output
Copy
YES
YES
NO
YES
Note

The first example is shown in the figures in the statement.

In the second example, we can move the conveyor, for example, so that the centers of the cakes are at 4,9,14,19,244,9,14,19,24.

In the third example, we can't move the conveyor accordingly.

复制代码
//设向右为正方向
//蛋糕如果需要移动到最右端点,那就是rb-ra
//最左端点的话就是lb-la
//蛋糕只需要向右移动{l,r}这个区间就是合法的
//对于每个蛋糕都有一个这样的区间,只需要判断每个区间是否都有交集就可以了
#include <bits/stdc++.h>
//#define int long long
using namespace std;
const int N=1e5+10,mod=1e9+7;
string s;
long long n,t,a[N],b[N],res,num,ans,w,h,l=-1e9,r=1e9;
bool vis[N];
int main()
{
    std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>t;
    while(t--){
        cin>>n>>w>>h;
        l=-1e9,r=1e9;
        for(int i=0;i<n;i++) cin>>a[i];
        for(int i=0;i<n;i++) cin>>b[i];
        for(int i=0;i<n;i++){
            l=max(l,b[i]+h-a[i]-w),r=min(r,b[i]-h-a[i]+w);//判断是否有交集
            if(l>r){
                cout<<"NO"<<endl;
                goto nexts;
            }
        }
        cout<<"YES"<<endl;
        nexts:;
    }
    return 0;
}
复制代码

 


__EOF__

本文作者：Sakurajimamai
本文链接：https://www.cnblogs.com/o-Sakurajimamai-o/p/17513875.html
关于博主：评论和私信会在第一时间回复。或者直接私信我。
版权声明：本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！
声援博主：如果您觉得文章对您有帮助，可以点击文章右下角【推荐】一下。您的鼓励是博主的最大动力！
posted @   o-Sakurajimamai-o  阅读(18)  评论(0)  编辑  收藏  举报
相关博文：
·  Maximum Sum(前缀和)
·  Come Together
·  CF1654C Alice and Cakes 题解
·  C. Alice and the Cake_思维-堆
·  Wrapping Chocolate(ABC 245 E)
阅读排行：
· winform 绘制太阳，地球，月球 运作规律
· AI与.NET技术实操系列（五）：向量存储与相似性搜索在 .NET 中的实现
· 超详细：普通电脑也行Windows部署deepseek R1训练数据并当服务器共享给他人
· 【硬核科普】Trae如何「偷看」你的代码？零基础破解AI编程运行原理
· 上周热点回顾（3.3-3.9）
-- --
点击右上角即可分享
微信分享提示