题解:水题长信心,注意下相邻的两个点距离可能不为1就行了。
#include<iostream>
using namespace std;
int x[2],y[2],t,p;
int main()
{
cin >>x[0]>>y[0]>>x[1]>>y[1];
int t=x[1]-x[0],p=y[1]-y[0];
if ((t!=0 && p!=0 && t*t!=p*p)||(t==0 && p==0))
{
cout<<-1<<endl;
return 0;
}
if (t==0 && p!=0)
{
cout <<x[0]+p<<" "<<y[0]<<" "<<x[1]+p<<" "<<y[1];
return 0;
}
if (t!=0 && p==0)
{
cout <<x[0]<<" "<<y[0]+t<<" "<<x[1]<<" "<<y[1]+t;
return 0;
}
cout <<x[0]+t<<" "<<y[0]<<" "<<x[1]-t<<" "<<y[1];
return 0;
}