Submission #5018183


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <stack>
#include <queue>
#define llong long long
#define INF (__INT32_MAX__ / 2)
#define EPS (1e-10)

using namespace std;

bool feq(double a, double b) { return abs(a - b) < EPS; }
bool fgr(double a, double b) { return a - b >= EPS; }
bool fls(double a, double b) { return b - a >= EPS; }
bool fgeq(double a, double b) { return b - a < EPS; }
bool fleq(double a, double b) { return a - b < EPS; }


class Vector {
public:
    class CcwOption {
    public:
        static const int COUNTER_CLOCKWISE = 1;
        static const int CLOCKWISE = -1;
        static const int ONLINE_BACK = 2;
        static const int ONLINE_FRONT = -2;
        static const int ON_SEGMENT = 0;
    };

    double x, y;
    Vector() {}
    Vector(double x, double y) { this->x = x; this->y = y; }

    Vector operator + (Vector p) { return Vector(x + p.x, y + p.y); }
    Vector operator - (Vector p) { return Vector(x - p.x, y - p.y); }
    Vector operator * (double k) { return Vector(x * k, y * k); }
    Vector operator / (double k) { return Vector(x / k, y / k); }
    bool operator == (const Vector p) { return feq(x, p.x) && feq(y, p.y); }
    /*
    bool operator < (const Vector p) { return !feq(x, p.x) ? fls(x, p.x) : fls(y, p.y); }
    bool operator > (const Vector p) { return !feq(x, p.x) ? fgr(x, p.x) : fgr(y, p.y); }
    */
    bool operator < (const Vector p) { return !feq(y, p.y) ? fls(y, p.y) : fls(x, p.x); }
    bool operator > (const Vector p) { return !feq(y, p.y) ? fgr(y, p.y) : fgr(x, p.x); }

    double norm() { return x * x + y * y; }
    double abs() { return sqrt(norm()); }
    double arg() { return atan2(y, x); }
    Vector project(Vector v) { return *this * (dot(*this, v) / norm()); }   // ベクトルvの*thisへの射影
    Vector normal() { return (*this) / abs(); }
    Vector rot(double theta) { return polar(abs(), theta + arg()); }

    static double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
    static double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }
    static bool isOrthogonal(Vector a, Vector b) { return feq(dot(a, b), 0); }
    static bool isParallel(Vector a, Vector b) { return feq(cross(a, b), 0); }
    static double distance(Vector a, Vector b) { return (a - b).abs(); }
    static int ccw(Vector p0, Vector p1, Vector p2) {
        Vector a = p1 - p0;
        Vector b = p2 - p0;
        if(fgr(Vector::cross(a, b), 0))
            return CcwOption::COUNTER_CLOCKWISE;
        else if(fls(Vector::cross(a, b), 0))
            return CcwOption::CLOCKWISE;
        else if(fls(Vector::dot(a, b), 0))
            return CcwOption::ONLINE_BACK;
        else if(fls(a.norm(), b.norm()))
            return CcwOption::ONLINE_FRONT;
        else
            return CcwOption::ON_SEGMENT;
    }
    static Vector polar(double r, double a) { return Vector(r * cos(a), r * sin(a)); }
};
typedef Vector Point;


int main(int argc, char **argv) {
    Point a, b, c;
    cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y;

    printf("%lf\n", abs(Vector::cross(b - a, c - a)) / 2);    
}

Submission Info

Submission Time
Task C - 直訴
User iosink
Language C++14 (GCC 5.4.1)
Score 100
Code Size 3301 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 72
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 1 ms 256 KB
test_23.txt AC 1 ms 256 KB
test_24.txt AC 1 ms 256 KB
test_25.txt AC 1 ms 256 KB
test_26.txt AC 1 ms 256 KB
test_27.txt AC 1 ms 256 KB
test_28.txt AC 1 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 1 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 1 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 1 ms 256 KB
test_37.txt AC 1 ms 256 KB
test_38.txt AC 1 ms 256 KB
test_39.txt AC 1 ms 256 KB
test_40.txt AC 1 ms 256 KB
test_41.txt AC 1 ms 256 KB
test_42.txt AC 1 ms 256 KB
test_43.txt AC 1 ms 256 KB
test_44.txt AC 1 ms 256 KB
test_45.txt AC 1 ms 256 KB
test_46.txt AC 1 ms 256 KB
test_47.txt AC 1 ms 256 KB
test_48.txt AC 1 ms 256 KB
test_49.txt AC 1 ms 256 KB
test_50.txt AC 1 ms 256 KB
test_51.txt AC 1 ms 256 KB
test_52.txt AC 1 ms 256 KB
test_53.txt AC 1 ms 256 KB
test_54.txt AC 1 ms 256 KB
test_55.txt AC 1 ms 256 KB
test_56.txt AC 1 ms 256 KB
test_57.txt AC 1 ms 256 KB
test_58.txt AC 1 ms 256 KB
test_59.txt AC 1 ms 256 KB
test_60.txt AC 1 ms 256 KB
test_61.txt AC 1 ms 256 KB
test_62.txt AC 1 ms 256 KB
test_63.txt AC 1 ms 256 KB
test_64.txt AC 1 ms 256 KB
test_65.txt AC 1 ms 256 KB
test_66.txt AC 1 ms 256 KB
test_67.txt AC 1 ms 256 KB
test_68.txt AC 1 ms 256 KB
test_69.txt AC 1 ms 256 KB