Submission #372958

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define fe(i,b) for (auto &(i):b);
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };

struct NUM{
	int up=0, down=0;
	int pm = 1;
};
NUM x, y;

#define W_pair(xx,xy,yx,yy) make_pair(make_pair((xx),(xy)),make_pair((yx),(yy)))
vector<pair<pair<int, int>, pair<int, int>>> ans;
void calc(){
	int rev_x = 1000 - x.down;
	int rev_y = 1000 - y.down;
	ans.push_back(W_pair(x.up + 1, y.up + 1, x.up + 1 + rev_x, y.up + 1 + rev_y));
	ans.push_back(W_pair(x.up + 1, y.up, x.up + 1 + rev_x, y.up - y.down));
}

int main(void){
	int w=0,h = 0;
	string X, Y;
	cin >> X >> Y;
	int i;
	for (i = 0; i < (int)X.size();i++){
		w++; 
		if (X[i] == '-')x.pm = -1;
		else if (X[i] == '.')break;
		else {x.up *= 10;x.up += X[i]-'0';
		}
	}
	for (i = 0; i < (int)Y.size(); i++){
		h++;
		if (Y[i] == '-')y.pm = -1;
		else if (Y[i] == '.')break;
		else {
			y.up *= 10; y.up += Y[i] - '0';
		}
	}
	for (i = w; i < (int)X.size(); i++){
		x.down *= 10; x.down += X[i] - '0';
	}
	for (i = h; i < (int)Y.size(); i++){
		y.down *= 10; y.down += Y[i] - '0';
	}
	calc();
	for(i=0;i<(int)ans.size();i++){
		auto tmp = ans[i];
			cout << x.pm*tmp.first.first << " " << y.pm*tmp.first.second << " " << x.pm*tmp.second.first << " " << y.pm*tmp.second.second << endl;
	}

	
	return(0);
}

Submission Info

Judge Result