#597715 (C++17) No.1144 Triangles

• 問題: No.1144 Triangles
• ユーザー: mugen_1337
• 提出日時: 2020-12-27 01:17:05
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,615 ms / 3,000 ms
• コード長: 6,543 bytes
• コンパイル時間: 2,551 ms
• コンパイル使用メモリ: 217,820 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-25 05:06:40
• 合計ジャッジ時間: 23,184 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	1,615 ms; 6,944 KB
testcase_05	AC	1,591 ms; 6,944 KB
testcase_06	AC	1,593 ms; 6,940 KB
testcase_07	AC	1,611 ms; 6,944 KB
testcase_08	AC	1,603 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	2 ms; 6,944 KB
testcase_11	AC	2 ms; 6,940 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	2 ms; 6,944 KB
testcase_14	AC	1,466 ms; 6,940 KB
testcase_15	AC	1,458 ms; 6,940 KB
testcase_16	AC	1,563 ms; 6,940 KB
testcase_17	AC	1,587 ms; 6,940 KB
testcase_18	AC	1,575 ms; 6,940 KB
testcase_19	AC	117 ms; 6,940 KB
testcase_20	AC	7 ms; 6,944 KB
testcase_21	AC	7 ms; 6,944 KB
testcase_22	AC	1,490 ms; 6,940 KB
testcase_23	AC	83 ms; 6,940 KB
testcase_24	AC	1,463 ms; 6,944 KB
testcase_25	AC	469 ms; 6,940 KB
testcase_26	AC	45 ms; 6,944 KB
testcase_27	AC	388 ms; 6,940 KB
testcase_28	AC	289 ms; 6,940 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template<ll Mod>
struct ModInt{
    long long x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=Mod) x-=Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=Mod-p.x)>=Mod)x-=Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1ll*x*p.x%Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this)*=p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a=x,b=Mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};
using mint=ModInt<mod>;
 
 
template<int MAX>
struct comcalc{
    vector<mint> fact,finv,inv;
    comcalc():fact(MAX),finv(MAX),inv(MAX){
        fact[0]=mint(1),fact[1]=mint(1),finv[0]=mint(1),finv[1]=mint(1),inv[1]=mint(1);
        for(int i=2;i<MAX;i++){
            fact[i]=fact[i-1]*mint(i);
            inv[i]=mint(0)-inv[mod%i]*(mint(mod/i));
            finv[i]=finv[i-1]*inv[i];
        }
    }
    mint com(int n,int k){
        if(n<k) return mint(0);
        if(n<0 or k<0) return mint(0);
        return fact[n]*(finv[k]*finv[n-k]);
    }
    mint fac(int n){
        return fact[n];
    }
    // 重複組み合わせ:n種類の物から重複を許し，k個選ぶ
    mint nHk(int n,int k){
        return com(n+k-1,k);
    }
    // 玉n区別，箱k区別，各箱1個以上O(k)
    mint F12_dis_dis_one(int n,int k){
        if(n<k)return mint(0);
        mint ret=0;
        for(int i=0;i<=k;i++){
            mint add=com(k,i)*(mint(i).pow(n));
            if((k-i)%2) ret-=add;
            else        ret+=add;
        }
        return ret;
    }
    /* sum combination(n+x, x), x=l to r
       https://www.wolframalpha.com/input/?i=sum+combination%28n%2Bx+%2Cx%29%2C+x%3Dl+to+r&lang=ja 
       check n+x < [COM_PRECALC_MAX]    */
    mint sum_of_comb(int n,int l,int r){
        if(l>r)return mint(0);
        mint ret=mint(r+1)*com(n+r+1,r+1)-mint(l)*com(l+n,l);
        ret/=mint(n+1);
        return ret;
    }
};

// using ld=long double;
using ld=double;
const ld pi=acosl(-1);

signed main(){
    int n;cin>>n;
    vector<ll> X(n),Y(n);
    rep(i,n) cin>>X[i]>>Y[i];


    mint res=0;
    rep(o,n){
        vector<pair<ll,ll>> v;
        for(int i=o+1;i<n;i++) v.emplace_back(X[i]-X[o],Y[i]-Y[o]);
        // rep(i,n)if(o!=i) v.emplace_back(X[i]-X[o],Y[i]-Y[o]);

        sort(ALL(v),[](pair<ll,ll> a,pair<ll,ll> b){
            return atan2(ld(a.second),ld(a.first))<atan2(ld(b.second),ld(b.first));
        });

        deque<pair<ll,ll>> l,r;
        ll lsx=0,lsy=0,rsx=0,rsy=0;

        auto pf_l=[&](){
            lsx-=l.front().first,lsy-=l.front().second;
            auto ret=l.front();l.pop_front();
            return ret;
        };

        auto pb_l=[&](pair<ll,ll> p){
            lsx+=p.first,lsy+=p.second;
            l.push_back(p);
            return ;
        };

        auto pf_r=[&](){
            rsx-=r.front().first,rsy-=r.front().second;
            auto ret=r.front();r.pop_front();
            return ret;
        };

        auto pb_r=[&](pair<ll,ll> p){
            rsx+=p.first,rsy+=p.second;
            r.push_back(p);
            return ;
        };

        auto check=[&](pair<ll,ll> a,pair<ll,ll> b){
            ld ar=atan2(a.second,a.first);
            ld br=atan2(b.second,b.first);
            br-=ar;
            while(br<=0) br+=2*pi;
            while(br>=2*pi) br-=pi;

            // cout<<"("<<a.first<<", "<<a.second<<") ? ("<<b.first<<", "<<b.second<<") "<<(br<=pi)<<endl;
            // cout<<ar<<" "<<br<<endl;
            return br<=pi;
        };

        for(int i=0;i<(int)v.size();i++) pb_r(v[i]);

        ll tres=0;
        rep(_,(int)v.size()){
            pair<ll,ll> cur;

            if(l.empty()) cur=pf_r();
            else          cur=pf_l();

            while(!r.empty() and check(cur,r.front())){
                auto p=pf_r();
                pb_l(p);
            }
            // cout<<"cur : "<<cur.first<<", "<<cur.second<<endl;
            // cout<<"l : ";
            // for(auto p:l) cout<<"("<<p.first<<", "<<p.second<<") ";
            // cout<<endl;
            // cout<<"r : ";
            // for(auto p:r) cout<<"("<<p.first<<", "<<p.second<<") ";
            // cout<<endl;

            tres+=cur.first*lsy-lsx*cur.second;
            tres-=cur.first*rsy-rsx*cur.second;

            // pb_r(cur);
        }
        // cout<<o<<" : "<<tres<<endl;
        res+=mint(tres);
    }
    cout<<res<<endl;
    return 0;
}