题目

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she could only use exactly two coins to pay the exact amount. Since she has as many as 10^5 coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find two coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (<=10^5,the total number of coins) and M(<=10^3, the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers no more than 500. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the two face values V1 and V2 (separated by a space) such that V1 + V2 = M and V1 <= V2. If such a solution is not unique, output the one with the smallest V1. If there is no solution, output “No Solution” instead.

Sample Input 1:

8 15

1 2 8 7 2 4 11 15

Sample Output 1:

4 11

Sample Input 2:

7 14

1 8 7 2 4 11 15

Sample Output 2:

No Solution

题目分析

每笔交易只能使用两枚硬币交易,已知一些硬币面值,挑选两枚硬币V1,V2进行支付,要求满足两个条件必须V1+V2=M(交易金额),V1<=V2,如果可以找到V1,V2,打印;否则,打印"No Solution"

解题思路

思路 01 (最优、hash)

查找M-coins[i]时间复杂度为O(1)

  1. int ts[1001],保存输入硬币面值出现次数
  2. int coins[N],保存输入硬币
  3. 输入时,统计面值出现次数记录在ts中
  4. sort(对coins进行升序排序)
  5. 遍历输入硬币,判断 M-当前硬币面值 的面值是否在输入的硬币中出现过
    • 如果coins[i]==M-coins[i],M-coins[i]面值最少出现两次
    • 如果coins[i]<M-coins[i],M-coins[i]面值最少出现一次
    • 如果coins[i]>M-coins[i],不满足条件A1<=A2

思路 02(二分查找,可对比思路01)

查找M-coins[i]时间复杂度为O(logn)

  1. 对输入的硬币,进行排序sort(对coins进行升序排序)
  2. 遍历coins[i],并使用二分思想查找M-coins[i]是否在数组的i+1到N-1位置,如果有打印,否则跳过继续寻找M-coins[i+1]

易错点

  1. A1<=A2(自己bug)
  2. ts大小设置应为1001,而不是501(题目已知:1<面值<=500,但是0<M<=1000),因为ts记录的是面值,所以可能搜索最大面值M=999(M=1000,v1=1)出现次数的情况,若ts大小设置为500,将会下标将会越界。(自己bug)

Code

Code 01(最优、hash)

#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc,char * argv[]) {
int N,M;
scanf("%d %d",&N,&M);
int coins[N]= {0};
int values[1001]= {0};
for(int i=0; i<N; i++) {
scanf("%d",&coins[i]);
values[coins[i]]++;
}
sort(coins,coins+N);
int i;
for(i=0; i<N; i++) {
if((coins[i]==M-coins[i]&&values[coins[i]]>=2)
||(coins[i]<M-coins[i]&&values[M-coins[i]]>=1)) { //!= 第二个点错误
printf("%d %d", coins[i], M-coins[i]);
break;
}
}
if(i==N)printf("No Solution");
return 0;
}

Code 02(非最优不推荐、二分查找)

#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char * argv[]) {
int N,M;
scanf("%d %d", &N,&M);
int coins[N]= {0};
for(int i=0; i<N; i++) {
scanf("%d",&coins[i]);
}
sort(coins,coins+N);
bool flag = false;
for(int i=0; i<N; i++) {
//二分查找是否存在 M-coins[i];
int left = i+1,right=N-1;
int mid = left+((right-left)>>1);
while(left<=right) {
mid = left+((right-left)>>1);
if(coins[mid]==M-coins[i]) {
break;
} else if(coins[mid]>M-coins[i]) {
right = mid-1;
} else {
left = mid+1;
}
}
if(left>right)continue; //没有找到 M-coins[i];
else { //已找到 M-coins[i],打印,并退出(因为按照coins[i]升序顺序查找,所以第一次找到的就是最小值)
printf("%d %d",coins[i],coins[mid]);
flag = true;
break;
}
}
if(!flag)printf("No Solution");
return 0; }

PAT Advanced 1048 Find Coins (25) [Hash散列]的更多相关文章

  1. PAT Advanced 1134 Vertex Cover (25) [hash散列]

    题目 A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at ...

  2. PAT Advanced 1048 Find Coins (25 分)

    Eva loves to collect coins from all over the universe, including some other planets like Mars. One d ...

  3. PAT Advanced 1084 Broken Keyboard (20) [Hash散列]

    题目 On a broken keyboard, some of the keys are worn out. So when you type some sentences, the charact ...

  4. PAT Advanced 1050 String Subtraction (20) [Hash散列]

    题目 Given two strings S1 and S2, S = S1 – S2 is defined to be the remaining string afer taking all th ...

  5. PAT Advanced 1041 Be Unique (20) [Hash散列]

    题目 Being unique is so important to people on Mars that even their lottery is designed in a unique wa ...

  6. PAT甲 1048. Find Coins (25) 2016-09-09 23:15 29人阅读 评论(0) 收藏

    1048. Find Coins (25) 时间限制 50 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Eva loves t ...

  7. PAT 甲级 1048 Find Coins (25 分)(较简单,开个数组记录一下即可)

    1048 Find Coins (25 分)   Eva loves to collect coins from all over the universe, including some other ...

  8. PAT甲题题解-1078. Hashing (25)-hash散列

    二次方探测解决冲突一开始理解错了,难怪一直WA.先寻找key%TSize的index处,如果冲突,那么依此寻找(key+j*j)%TSize的位置,j=1~TSize-1如果都没有空位,则输出'-' ...

  9. PAT Basic 1047 编程团体赛(20) [Hash散列]

    题目 编程团体赛的规则为:每个参赛队由若⼲队员组成:所有队员独⽴⽐赛:参赛队的成绩为所有队员的成绩和:成绩最⾼的队获胜.现给定所有队员的⽐赛成绩,请你编写程序找出冠军队. 输⼊格式: 输⼊第⼀⾏给出⼀ ...

随机推荐

  1. Web前端开发CSS规范总结

    作为Web前端开发必备语言,CSS为大家广为熟知,今天就跟大家分享下CSS规范总结,Web前端的小伙伴们看过来吧! CSS样式的权值(权重) 权值等级的定义 第一等:代表内联样式,如: style=” ...

  2. 第二十篇ORM查询与SQL语句

    ORM查询与SQL语句 多表操作 创建模型 实例:我们来假定下面这些概念,字段和关系 作者模型:一个作者有姓名和年龄. 作者详细模型:把作者的详情放到详情表,包含生日,手机号,家庭住址等信息.作者详情 ...

  3. PHP操作MYSQL数据库(10.11 第十九天)

    一.连接及断开数据库 1.使用mysqli 扩展(推荐),只针对mysql数据库 面向对象的方式 $con = new mysqli(ip,user,password); if($con->co ...

  4. Ubuntu Vi指令

    Ubuntu在不更新源的情况下是没办法使用Vim指令的只能使用Vi指令 所有我也就记录了下来 vi / vim命令: 插入内容: i: 插入光标前一个字符 I: 插入行首 a: 插入光标后一个字符 A ...

  5. 洛谷 P1435 回文字串

    题目传送门 解题思路: 就是求一个字符串的最长回文子序列的长度,然后用整个的长度减去最长回文子序列的长度 AC代码: #include<iostream> #include<cstd ...

  6. 剑指offer_12.31_Day_1

    不用加减乘除做加法 题目描述 写一个函数,求两个整数之和,要求在函数体内不得使用+.-.*./四则运算符号.   不用四则运算,必然是依靠位运算. 位运算包括,与,或,异或,取反,左移,右移. 分别为 ...

  7. 201909-2 小明种苹果(续) Java

    思路: 待补充 import java.util.*; public class Main { public static void main(String[] args) { Scanner sc ...

  8. docker创建redis容器

    1.拉取最新的redis镜像 docker pull redis; 2.创建存放redis数据的目录 mkdir /redis/data 3.查询redis镜像id docker images; RE ...

  9. c++程序—变量

    #include<iostream> using namespace std; int main() { int a = 10; cout << "a=" ...

  10. 51nod 1438:方阵与完全平方数

    1438 方阵与完全平方数 题目来源: mostleg 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题  收藏  关注 如果一个由正整数组成的n*n的方阵,满足以下 ...