Submission #3818281

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend());//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define OUT(x) cout << x << endl
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<P> point(3);
    REP(i,3) cin >> point[i].first >> point[i].second;
    int a,b,c,d;
    a = abs(point[0].first - point[1].first);
    b = abs(point[0].second - point[1].second);
    c = abs(point[0].first - point[2].first);
    d = abs(point[0].second - point[2].second);
    float f_abs;
    f_abs = a*d - b*c > 0 ? a*d - b*c : b*c - a*d;
    cout <<  setprecision(2) << f_abs / 2.0 << endl;
}

Submission Info

Judge Result