Submission #7065898
Source Code Expand
#include <stdio.h>
#include <iostream>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef std::pair<ll,ll> pl;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
const ll MOD = 1e9 + 7;
const ll INF = MOD * MOD;
const long double PI = 3.14159265359;
const long double EPS = 1e-9;
ll gcd(ll m, ll n){
ll a = max(m, n);
ll b = min(m, n);
while(b != 1 && b != 0){ a %= b; swap(a, b);}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n){ return m / gcd(m, n) * n;}
ll power_mod(ll a, ll power, ll mod){
ll value = 1;
while(power != 0){
if(power & 1) value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod){
return power_mod(a, mod - 2, mod);
}
ll power_normal(ll a, ll power){
ll value = 1;
while(power != 0){
if(power & 1) value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll combination(ll n, ll r){
ll numerator = 1;
ll denomenator = 1;
for(ll i = 0; i < r ; i++){
(numerator *= ll(n - i)) %= MOD;
(denomenator *= modinv(i + 1, MOD)) %= MOD;
}
return (numerator * denomenator) % MOD;
}
ll bin_search_range(ll key, ll S[], ll left, ll right) {
while (right >= left) {
ll mid = left + (right - left) / 2;
if (S[mid] >= key && S[mid - 1] < key) return mid;
else if (S[mid - 1] >= key) right = mid - 1;
else if (S[mid] < key) left = mid + 1;
}
return right + 1;
}
ll bin_search(ll key, ll A[], ll left, ll right){
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end.
while(right >= left){
ll mid = left + (right - left) / 2;
if (A[mid] == key) return mid;
else if (A[mid] > key) right = mid - 1;
else if (A[mid] < key) left = mid + 1;
}
return -1;
}
#define rep(i, n) for(ll (i) = 0; (i) < (n) ; (i)++ )
#define For(i, a, b) for(ll (i) = (a); (i) < (b) ; (i)++ )
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define toLower(c) char((c)+0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a,b) cout << (a) << " " << (b) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) if ((condition)) prl("Yes"); else prl("No");
#define YN(condition) if ((condition)) prl("YES"); else prl("NO");
#define rpr(i,n,ans) rep((i),(n)) prs((ans[(i)]))
#define cpr(i,n,ans) rep((i),(n)) prl((ans[(i)]))
#define in1(a) cin >> (a)
#define in2(a,b) cin >> (a) >> (b)
#define in3(a,b,c) cin >> (a) >> (b) >> (c)
#define in4(a,b,c,d) cin >> (a) >> (b) >> (c) >> (d)
#define rin1(i,n,a) rep((i),(n)) cin >> (a[(i)])
#define rin2(i,n,a,b) rep((i),(n)) cin >> (a[(i)]) >> (b[(i)])
#define rin3(i,n,a,b,c) rep((i),(n)) cin >> (a[(i)]) >> (b[(i)]) >> (c[(i)])
#define matin(i,h,j,w,a) rep((i),(h)) rep((j),(w)) cin >> a[i][j]
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for(auto &(kv): (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define beto(a,b,c) (a) < (b) && (b) < (c)
#define betc(a,b,c) (a) <= (b) && (b) <= (c)
#define rsort(a,n) sort(a,a+n,greater<>())
#define Forchar(c,a,z) for(char (c) = (a); (c) <= (z); (c)++)
#define cntchar(s,c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) cout << fixed << setprecision(digits) << (num) << endl;
const ll MAX_N = 100000;
int main(void){
double x[3],y[3];
rin2(i,3,x,y);
double answer = 0;
prl_nd(0.5 * abs((x[1] - x[0]) * (y[2] - y[0]) - (y[1] - y[0]) * (x[2] - x[0])), 4);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 直訴 |
User |
nabenabe0928 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4426 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
all |
Score / Max Score |
100 / 100 |
Status |
|
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 |