Sacrament of the sum

关注

原创最新推荐文章于 2024-09-05 08:29:03 发布 609 阅读 AI 写同款· GEO 优化 ›

避坑指南：WSL2网络模式修改导致无法上网的解决方案（附备份还原技巧）本文深入解析WSL2默认网络隔离机制，并提供三种安全的端口互通方案，重点推荐通过配置Windows防火墙规则实现稳定访问。同时，针对网络配置修改可能引发的无法上网问题，给出了从重置配置到系统级备份的完整恢复指南，确保开发环境安全可靠。阅读详情

F - Sacrament of the sum

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Description

— The Brother of mine, the Head of Monastic Order wants to know tomorrow about the results long-term researches. He wants to see neither more nor less than the Summering Machine! Even moreover, he wants our Machine — only a machine — to demonstrate its comprehension of the Sacrament of the Sum as deeply as it is possible. He wants our Machine to find two numbers that give the sum equal to the Sacred Number 10 000.

— Tsh-sh-sh! This is madness that borders on blasphemy! How can the Machine calculate the Sacred Number? Twenty seven years we work on it, but we've could teach it to tell if the sum of two introduced numbers greater or lower than 10 000. Can an ordinary mortal find two numbers that there sum will be equal to 10 000?

— But we'll have to do it with the help of our Machine, even if it is not capable. Otherwise we'll have... let's say, big problems, if it is possible to call boiling oil like this. However, I have an idea. Do you remember, last week we've entered two numbers -7 and 13 into the Machine, and it answered that their sum is lower than 10 000. I don't know how to check this, but nothing's left for us than to believe to the fruit of our work. Let's enter now a greater number than -7 and start up the Machine again. We'll do like this again and again until we find a number that being added to 13 will give us 10 000. The only thing we are to do is to prepare an ascending list of numbers.

— I don't believe in this... Let's start with the sum that is obviously greater than the Sacred Number and we'll decrease one of the summand. So we have more chances to avoid boilin... big problems.

Haven't come to an agreement, the Brothers went away to their cells. By next day everyone of them has prepared a list of numbers that, to his opinion, could save them... Can both of the lists save them together?

Your program should decide, if it is possible to choose from two lists of integers such two numbers that their sum would be equal to 10 000.

Input

You are given both of these lists one by one. Format of each of these lists is as follows: in the first line of the list the quantity of numbers Ni of the i-th list is written. Further there is an i-th list of numbers each number in its line (Ni lines).The following conditions are satisfied: 1 <= Ni <= 50 000, each element of the lists lays in the range from -32768 to 32767. The first list is ascending and the second one is descending.

Output

You should write "YES" to the standard output if it is possible to choose from the two lists of integers such two numbers that their sum would be equal to 10 000. Otherwise you should write "NO".

Sample Input

Sample Output

YES

Hint

This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

这道题求两组数之和能否等于10000，是“Can you find it?”的简化版。

代码：

<div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">#include<cstdio></span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">using namespace std;</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">int L1,L2;</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">],b[50010];
int main()</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">int a[5001</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">0{</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">while(scanf("%d",&L1)!=EOF){</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">   scanf("%d",&a[i]);
    </span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    for(int i=0;i<L1;i++){</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    </span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;"> }</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    scanf("%d",&L2);</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    for(int i=0;i<L2;i++){</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">t i=0;i<L1;i++){
    int l</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">        scanf("%d",&b[i]);</span></div><span style="font-family:SimSun;font-size:14px;">    }
int mark=0;
</span><div style="text-align: left;"></div><span style="font-family:SimSun;font-size:14px;">for(
i
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">n=0,r=L2-1,mid;</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    while(l<=r){</span></div><span style="font-family:SimSun;font-size:14px;">    mid=(l+r)/2;
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">]==10000)
</span></div><span style="font-family:SimSun;font-size:14px;">    if(a[i]+b[mi
d</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">id]>10000)
        l=mid</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">       {printf("YES\n");</span></div><span style="font-family:SimSun;font-size:14px;">        mark=1;
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    else if(a[i</span></div><span style="font-family:SimSun;font-size:14px;">        break;}
</span><div style="text-align: left;"></div><span style="font-family:SimSun;font-size:14px;">]+b
[
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">m+1;</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">    else</span></div><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">        r=mid-1;</span></div><span style="font-family:SimSun;font-size:14px;">    }
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">(mark!=0)
     </span></div><span style="font-family:SimSun;font-size:14px;">    i
f   break;
}
</span><div style="text-align: left;"><span style="font-family:SimSun;font-size:14px;">rintf("NO\n</span></div><span style="font-family:SimSun;font-size:14px;">if(mark==0)
p"</span><span style="font-family:SimSun;font-size:14px;">);
}
</span><div style="text-align: left;"></div><span style="font-family:SimSun;font-size:14px;">return 0;
</span><div style="text-align: left;"></div><span style="font-family:SimSun;font-size:14px;">}
</span>