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 105 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 (≤105, the total number of coins) and M (≤103, 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
作者: CHEN, Yue
单位: 浙江大学
时间限制: 150 ms
内存限制: 64 MB
代码长度限制: 16 KB
刚开始用普通做法写了一遍,意料之中的超时了..好几个测试点没过 ,因为我套了两个循环。然后看m的范围不大,就索性用hash计算v1,v2的个数了,时间大大减少了!
【超时代码】
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn];
int main()
{
cin.sync_with_stdio(false);
int n,m;
cin>>n>>m;
for(int i = 0;i < n;i++)
{
cin>>a[i];
}
sort(a,a + n);
int r = -1;
int flag = 0;
for(int i = 0 ;i < n ;i ++)
{
for(int j = i + 1 ; j < n;j++)
{
if(a[j] == m - a[i])
{
//printf("-----\n");
r = a[i];
flag = 1;
break;
}
}
if(flag)
break;
}
if(r == -1)
cout<<"No Solution"<<endl;
else
cout<<r<<" "<<m - r<<endl;
return 0;
}
【通过代码】
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 1e5 + 5;
int b[maxn];
int main()
{
cin.sync_with_stdio(false);
int n,m,x,r = -1;
cin>>n>>m;
for(int i = 0;i < n;i++)
{
cin>>x;
b[x]++;
}
for(int i = 0 ;i <= 1e3;i++)
{
if(b[i] >= 1 && b[m - i] >= 1)
{
if(i == m - i)
{
if(b[i] >= 2)
{
cout<<i<<" "<<m - i<<endl;
r = 1;
break;
}
}
else
{
cout<<i<<" "<<m - i<<endl;
r = 1;
break;
}
}
}
if(r == -1)
cout<<"No Solution"<<endl;
return 0;
}