Contest Duration: ~ (local time) (120 minutes) Back to Home

Submission #7060642

Source Code Expand

Copy
```#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<algorithm> // sort
#include<map> // pair
#include<cmath>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
const ll mod = 1e9+7;
const int INF = 1e9;
const ll INFLONG = 1e18;
ll tmp1,tmp2;
int main(){
vector<pair<double,double>> vec(3);
rep(i,3){
cin >> tmp1 >> tmp2;
vec[i] = make_pair(tmp1,tmp2);
}
double x1,x2,y1,y2;
x1 = vec[1].first - vec[0].first;
x2 = vec[2].first - vec[0].first;
y1 = vec[1].second - vec[0].second;
y2 = vec[2].second - vec[0].second;
cout << abs(x1*y2 - x2*y1) / 2 << endl;
}
```

#### Submission Info

Submission Time 2019-08-21 19:02:43+0900 C - 直訴 ojiso C++14 (GCC 5.4.1) 0 1030 Byte WA 1 ms 256 KB

#### Test Cases

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