【2019浙江省赛 - B】Element Swapping(思维,数学)

题干:

DreamGrid has an integer sequence  and he likes it very much. Unfortunately, his naughty roommate BaoBao swapped two elements  and  () in the sequence when DreamGrid wasn't at home. When DreamGrid comes back, he finds with dismay that his precious sequence has been changed into !

What's worse is that DreamGrid cannot remember his precious sequence. What he only remembers are the two values

Given the sequence after swapping and the two values DreamGrid remembers, please help DreamGrid count the number of possible element pairs  BaoBao swaps.

Note that as DreamGrid is poor at memorizing numbers, the value of  or  might not match the sequence, and no possible element pair can be found in this situation.

Two element pairs  () and  () are considered different if  or .

Input

There are multiple test cases. The first line of the input contains an integer , indicating the number of test cases. For each test case:

The first line contains three integers ,  and  (), indicating the length of the sequence and the two values DreamGrid remembers.

The second line contains  integers  (), indicating the sequence after swapping. It's guaranteed that  and .

It's guaranteed that the sum of  of all test cases will not exceed .

Output

For each test case output one line containing one integer, indicating the number of possible element pairs BaoBao swaps.

Sample Input

2
6 61 237
1 1 4 5 1 4
3 20190429 92409102
1 2 3

Sample Output

2
0

Hint

For the first sample test case, it’s possible that BaoBao swaps the 2nd and the 3rd element, or the 5th and the 6th element.

解题报告:

两数作差不难发现,y的差除以x的差,就是a[i]+a[j],,所以分情况讨论就行了。注意除数为0的情况和x相同y不相同的时候(好坑啊、、)

(%%%wjh大佬)

AC代码:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
//ll f[1000];
ll a[200000],b[200000];
map<ll,ll> mp;
map<ll,ll> ::iterator it;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		mp.clear();
		ll n,x,y;
		scanf("%lld%lld%lld",&n,&x,&y);
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&a[i]);
			mp[a[i]]++;
			b[i]=a[i]*a[i];
		}
		ll x2=0,y2=0;
		for(ll i=1;i<=n;i++)
		{
			x2+=a[i]*i;
			y2+=b[i]*i;
		}
		if(x==x2)
		{
			if(y!=y2)
			{
				puts("0");
				continue;
			} 
			ll ans=0;
			for(it=mp.begin();it!=mp.end();it++)
			{
				ll num=it->second;
				ans+=num*(num-1)/2;
			}
			printf("%lld\n",ans);
			continue;
		}
		ll ans=0;
		if(abs(y-y2)%abs(x-x2)!=0)
		{
			puts("0");
			continue;
		}
		ll tmp=(y-y2)/(x-x2);
		ll dx=x-x2;
		ll dy=y-y2;
		for(int i=1;i<=n;i++)
		{
			ll aj=tmp-a[i];
			ll dt=a[i]-aj;
			ll dij;
			if(dt==0)
			{
				continue;
			}
			if(abs(dx)%abs(dt)!=0)
			continue;
			dij=dx/dt;
			ll wj=i+dij;
			if(wj<=i) continue;
			if(aj==a[wj]&&(x==(x2+wj*a[i]+i*a[wj]-i*a[i]-wj*a[wj]))&&(y==(y2-i*b[i]-wj*b[wj]+wj*b[i]+i*b[wj])))
			ans++;
			else
			continue;
		}
		printf("%lld\n",ans);
	}
	return 0;
}
/*
8
6 61 237
1 1 4 5 1 4
3 20190429 92409102
1 2 3
*/   

 

全部评论

相关推荐

06-27 12:54
已编辑
门头沟学院 Java
累了,讲讲我的大学经历吧,目前在家待业。我是一个二本院校软件工程专业。最开始选专业是觉得计算机感兴趣,所以选择了他。本人学习计算机是从大二暑假结束开始的,也就是大三开始。当时每天学习,我个人认为Java以及是我生活的一部分了,就这样持续学习了一年半,来到了大四上学期末,大概是在12月中旬,我终于找的到了一家上海中厂的实习,但我发现实习生的工作很枯燥,公司分配的活也不多,大多时间也是自己在自学。就这样我秋招末才找到实习。时间来到了3月中旬,公司说我可以转正,但是转正工资只有7000,不过很稳定,不加班,双休,因为要回学校参加答辩了,同时当时也是心高气傲,认为可以找到更好的,所以放弃了转正机会,回学校准备论文。准备论文期间就也没有投递简历。然后时间来到了5月中旬,这时春招基本也结束了,然后我开始投递简历,期间只是约到了几家下场面试。工资也只有6-7k,到现在我不知道该怎么办了。已经没有当初学习的心劲了,好累呀,但是又不知道该干什么去。在家就是打游戏,boss简历投一投。每天日重一次。26秋招都说是针对26届的人,25怎么办。我好绝望。要不要参加考公、考研、央国企这些的。有没有大佬可以帮帮我。为什么感觉别人找工作都是顺其自然的事情,我感觉自己每一步都在艰难追赶。八股文背了又忘背了又忘,我每次都花很长时间去理解他,可是现在感觉八股、项目都忘完了。真的已经没有力气再去学习了。图片是我的简历,有没有大哥可以指正一下,或者说我应该走哪条路,有点不想在找工作了。
码客明:太累了就休息一下兄弟,人生不会完蛋的
如果实习可以转正,你会不...
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务