結果
問題 | No.2331 Maximum Quadrilateral |
ユーザー |
![]() |
提出日時 | 2023-05-28 15:00:53 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,527 ms / 2,000 ms |
コード長 | 2,527 bytes |
コンパイル時間 | 4,927 ms |
コンパイル使用メモリ | 163,352 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-12-27 04:08:36 |
合計ジャッジ時間 | 29,875 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 45 |
コンパイルメッセージ
main.cpp:47:17: warning: implicit conversion from 'double' to 'R' (aka 'int') changes value from 1.0E-12 to 0 [-Wliteral-conversion] 47 | constexpr R eps=1e-12; | ~~~ ^~~~~ main.cpp:48:16: warning: implicit conversion from 'double' to 'R' (aka 'int') changes value from 3.141592653589793 to 3 [-Wliteral-conversion] 48 | constexpr R pi=3.141592653589793238; | ~~ ^~~~~~~~~~~~~~~~~~~~ 2 warnings generated.
ソースコード
#include <iostream>#include <vector>#include <set>#include <queue>#include <stack>#include <math.h>#include <cassert>#include <bitset>#include <map>#include <algorithm>#include <iterator>#include <string>#include <utility>#include <numeric>#include <regex>#include <complex>#include <atcoder/all>using namespace atcoder;using namespace std;using ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}#define reps(i,a,n) for(int i=(a);i<(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()ll myceil(ll a,ll b){return (a+b-1)/b;}using R=int;using Point=complex<R>;constexpr R eps=1e-12;constexpr R pi=3.141592653589793238;inline bool equal(const R &a,const R &b){return fabs(a-b)<eps;}Point unit_vector(const Point &a){return a/abs(a);}R dot(const Point &a,const Point &b){//内積return a.real()*b.real()+a.imag()*b.imag();}R cross(const Point &a,const Point &b){//外積return a.real()*b.imag()-a.imag()*b.real();}Point rotate(const Point &a,const R t){return Point(cos(t)*a.real()-sin(t)*a.imag(),sin(t)*a.real()+cos(t)*a.imag());}struct Line{Point a,b;Line(Point a,Point b):a(a),b(b){}Line(R A,R B,R C){assert(!(equal(A,0)&&equal(B,0)));if(equal(A,0)){a=Point(0,C/B),b=Point(1,C/B);}else if(equal(B,0)){a=Point(C/A,0),b=Point(C/A,1);}else{a=Point(C/A,0),b=Point(0,C/B);}}};int main(){int n;cin>>n;vector<Point>a(n);rep(i,n){R x,y;cin>>x>>y;a[i]={x,y};}int ans=0;rep(i,n-1)reps(j,i+1,n){vector<R>s,t;rep(k,n){if(k==i||k==j)continue;R area=cross(a[i]-a[k],a[j]-a[k]);if(area>0)s.push_back(area);else t.push_back(-area);}sort(all(s),[&](auto x,auto y){return x>y;});sort(all(t),[&](auto x,auto y){return x>y;});if(s.empty()||t.empty())continue;chmax(ans,s[0]+t[0]);}cout<<ans<<endl;}