結果

問題 No.1144 Triangles
ユーザー rniyarniya
提出日時 2020-07-31 23:04:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,365 bytes
コンパイル時間 1,919 ms
コンパイル使用メモリ 181,284 KB
実行使用メモリ 15,160 KB
最終ジャッジ日時 2024-07-06 20:50:49
合計ジャッジ時間 5,731 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
15,048 KB
testcase_01 AC 8 ms
14,976 KB
testcase_02 AC 8 ms
14,976 KB
testcase_03 AC 9 ms
14,848 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 8 ms
14,972 KB
testcase_10 AC 8 ms
14,976 KB
testcase_11 AC 8 ms
14,936 KB
testcase_12 AC 8 ms
14,976 KB
testcase_13 AC 8 ms
14,848 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 22 ms
14,972 KB
testcase_20 AC 10 ms
14,972 KB
testcase_21 AC 9 ms
14,976 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 16 ms
14,848 KB
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    cout << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<long long Modulus> class modint{
    public:
    long long a;
    constexpr modint(const long long x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){}
    constexpr long long &value() noexcept{return a;}
    constexpr const long long &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        long long exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept{
        long long a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX=5e5+10;
vector<mint> fac(MAX),finv(MAX),inv(MAX);
void COMinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;++i){
        fac[i]=fac[i-1]*i;
        inv[i]=-inv[MOD%i]*(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
mint COM(int n,int k){
    if (n<k||n<0||k<0) return 0;
    return fac[n]*finv[k]*finv[n-k];
}

// Be careful with the value of MAX and conducting COMinit()

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> x(n),y(n);
    for (int i=0;i<n;++i) cin >> x[i] >> y[i];
    auto f=[&](pair<ll,ll> a,pair<ll,ll> b){return a.first*b.second<a.second*b.first;};
    auto g=[&](pair<ll,ll> a,pair<ll,ll> b){return a.first*b.second>a.second*b.first;};
    mint ans=0;
    mint cnt=0;
    for (int i=0;i<n;++i){
        vector<pair<ll,ll>> pos,neg;
        mint zerosum=0;
        for (int j=i+1;j<n;++j){
            if (y[j]-y[i]>0) pos.emplace_back(x[j]-x[i],y[j]-y[i]);
            else if (y[j]-y[i]<0) neg.emplace_back(x[j]-x[i],y[j]-y[i]);
            else zerosum+=x[j]-x[i];
        }
        sort(ALL(pos),f); sort(ALL(neg),f);
        mint sumx=0,sumy=0,absum=0;
        for (int i=0;i<pos.size();++i){
            ans+=sumy*pos[i].first-sumx*pos[i].second;
            sumx+=pos[i].first; sumy+=pos[i].second;
            absum+=abs(pos[i].second);
        }
        sumx=0,sumy=0;
        for (int i=0;i<neg.size();++i){
            ans+=sumy*neg[i].first-sumx*neg[i].second;
            sumx+=neg[i].first; sumy+=neg[i].second;
            absum+=abs(neg[i].second);
        }
        ans+=zerosum*absum;
        int m=neg.size();
        vector<mint> prex(m+1,0),prey(m+1,0);
        for (int i=0;i<m;++i){
            prex[i+1]=prex[i]+neg[i].first;
            prey[i+1]=prey[i]+neg[i].second;
        }
        for (int i=0;i<pos.size();++i){
            int lb=-1,ub=m;
            while(ub-lb>1){
                int mid=(ub+lb)>>1;
                (g(pos[i],neg[mid])?ub:lb)=mid;
            }
            ans+=(prey[m]-2*prey[ub])*pos[i].first-(prex[m]-2*prex[ub])*pos[i].second;
        }
        // for (int j=i+1;j<n;++j){
        //     for (int k=j+1;k<n;++k){
        //         cnt+=abs((x[j]-x[i])*(y[k]-y[i])-(x[k]-x[i])*(y[j]-y[i]));
        //     }
        // }
        // debug(cnt,ans);
    }
    cout << ans << '\n';
}
0