-
Notifications
You must be signed in to change notification settings - Fork 0
/
1921A_Square.cpp
65 lines (57 loc) · 1.37 KB
/
1921A_Square.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define optimize() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fraction() \
cout.unsetf(ios::floatfield); \
cout.precision(10); \
cout.setf(ios::fixed, ios::floatfield);
#define file() \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;
#define endl '\n'
#define PB push_back
#define coy cout << "YES" << endl;
#define con cout << "NO" << endl;
#define ain(A, NN) \
for (ll I = 0; I < NN; I++) \
cin >> A[I]
using namespace std;
int main()
{
optimize();
ll t;
cin >> t;
while (t--)
{
int x[4], y[4];
for (int i = 0; i < 4; i++)
{
cin >> x[i] >> y[i];
}
sort(x, x + 4);
sort(y, y + 4);
int side = max(x[2] - x[1], y[2] - y[1]);
int area = side * side;
cout << area << endl;
}
return 0;
}