CF 261A. Pashmak and Garden
2016-04-21 18:55
369 查看
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int x1,x2,y1,y2;
int x3,y3,x4,y4;
int mark1=0,mark=0;
cin>>x1>>y1>>x2>>y2;
if(x1==x2)
{
int d=abs(y1-y2);
x3=x1+d;
x4=x1+d;
if(x3>1000)
{
x3=x1-d;
x4=x1-d;
if(x3<-1000){cout<<-1<<endl;mark=1;}
}
if(!mark)cout<<x3<<" "<<y1<<" "<<x4<<" "<<y2<<endl;
}
else
if(y1==y2)
{
int d=abs(x1-x2);
y3=y1+d;
y4=y1+d;
if(y3>1000||y4>1000)
{
y3=y1-d;
y4=y1-d;
if(y3<-1000||y4<-10000){cout<<-1<<endl;mark1=1;}
}
if(!mark1)cout<<x1<<" "<<y3<<" "<<x2<<" "<<y4<<endl;
}
else
{
int d=abs(x1-x2);
int t=abs(y1-y2);
if(t!=d)cout<<-1<<endl;
else
{
cout<<x1<<" "<<y2<<" "<<x2<<" "<<y1<<endl;
}
}
return 0;
}
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int x1,x2,y1,y2;
int x3,y3,x4,y4;
int mark1=0,mark=0;
cin>>x1>>y1>>x2>>y2;
if(x1==x2)
{
int d=abs(y1-y2);
x3=x1+d;
x4=x1+d;
if(x3>1000)
{
x3=x1-d;
x4=x1-d;
if(x3<-1000){cout<<-1<<endl;mark=1;}
}
if(!mark)cout<<x3<<" "<<y1<<" "<<x4<<" "<<y2<<endl;
}
else
if(y1==y2)
{
int d=abs(x1-x2);
y3=y1+d;
y4=y1+d;
if(y3>1000||y4>1000)
{
y3=y1-d;
y4=y1-d;
if(y3<-1000||y4<-10000){cout<<-1<<endl;mark1=1;}
}
if(!mark1)cout<<x1<<" "<<y3<<" "<<x2<<" "<<y4<<endl;
}
else
{
int d=abs(x1-x2);
int t=abs(y1-y2);
if(t!=d)cout<<-1<<endl;
else
{
cout<<x1<<" "<<y2<<" "<<x2<<" "<<y1<<endl;
}
}
return 0;
}
相关文章推荐
- HDU 1181 变形课
- 使用grunt实现css压缩
- #267B. Fedor and New Game-----每日两道水(1)
- PCA的数学原理
- HDU1241 Oil Deposits
- 英语演讲
- ACM牡丹江区域赛
- HDU 5059 help him
- HDU4802 GPA
- 快速排序的递归形式与非递归形式(C++版)
- HDU4496 D-City
- HDU4736-Fibonacci Tree
- 安卓游戏 h5游戏 安卓activity+webview+h5=2048程序员版 只有程序员才能玩的懂的2048升级版html离线小游戏 2048安卓程序员版 android2048
- 常见面试之机器学习算法思想简单梳理
- do-while随机求十个数的和
- HDU4493 Tutor
- HDU2771 Stealing Harry Potter\'s Precious(bfs+dfs)
- HDU 2962 Trucking
- HDU 1839 Delay Constrained Maximum Capacity Path
- HDU 5055 Bob and math problem