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

• 問題: No.1144 Triangles
• ユーザー: hotman78
• 提出日時: 2020-07-31 09:19:36
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,251 ms / 3,000 ms
• コード長: 9,211 bytes
• コンパイル時間: 7,648 ms
• コンパイル使用メモリ: 446,204 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-05 20:32:57
• 合計ジャッジ時間: 23,772 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1,247 ms; 5,376 KB
testcase_05	AC	1,246 ms; 5,376 KB
testcase_06	AC	1,245 ms; 5,376 KB
testcase_07	AC	1,251 ms; 5,376 KB
testcase_08	AC	1,241 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	1,150 ms; 5,376 KB
testcase_15	AC	1,139 ms; 5,376 KB
testcase_16	AC	1,213 ms; 5,376 KB
testcase_17	AC	1,216 ms; 5,376 KB
testcase_18	AC	1,217 ms; 5,376 KB
testcase_19	AC	83 ms; 5,376 KB
testcase_20	AC	6 ms; 5,376 KB
testcase_21	AC	6 ms; 5,376 KB
testcase_22	AC	1,169 ms; 5,376 KB
testcase_23	AC	63 ms; 5,376 KB
testcase_24	AC	1,161 ms; 5,376 KB
testcase_25	AC	340 ms; 5,376 KB
testcase_26	AC	35 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	52 ms; 5,376 KB

コンパイルメッセージ

main.cpp:51:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   51 | inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
      |                      ^~~~
main.cpp:58:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   58 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |            ^~~~
main.cpp:58:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   58 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |                          ^~~~
main.cpp:59:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   59 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |            ^~~~
main.cpp:59:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   59 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |                          ^~~~

ソースコード

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<int64_t> range(int64_t n){vector<int64_t>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<int64_t> range(int64_t a,int64_t b){vector<int64_t>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<int64_t> range(int64_t a,int64_t b,int64_t c){vector<int64_t>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
//inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
//inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}

class mint {
  using u64 = std::uint_fast64_t;
    public:
    u64 a;
    constexpr mint(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){}
    constexpr u64 &value()noexcept{return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
    constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
    constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
    constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
    constexpr mint &operator+=(const mint rhs) noexcept {
        a += rhs.a;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint &operator-=(const mint rhs) noexcept {
        if (a<rhs.a)a += get_mod();
        a -= rhs.a;
        return *this;
    }
    constexpr mint &operator*=(const mint rhs) noexcept {
        a = a * rhs.a % get_mod();
        return *this;
    }
    constexpr mint operator++(int n) noexcept {
        a += 1;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint operator--(int n) noexcept {
        if (a<1)a += get_mod();
        a -= 1;
        return *this;
    }
    constexpr mint &operator/=(mint rhs) noexcept {
        u64 exp=get_mod()-2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    constexpr bool operator==(mint x) noexcept {
        return a==x.a;
    }
    constexpr bool operator!=(mint x) noexcept {
        return a!=x.a;
    }
	constexpr bool operator<(mint x) noexcept {
        return a<x.a;
    }
	constexpr bool operator>(mint x) noexcept {
        return a>x.a;
    }
	constexpr bool operator<=(mint x) noexcept {
        return a<=x.a;
    }
	constexpr bool operator>=(mint x) noexcept {
        return a>=x.a;
    }
    constexpr static int root(){
        mint root = 2;
        while(root.pow((get_mod()-1)>>1).a==1)root++;
        return root.a;
    }
    constexpr mint pow(long long n){
        long long x=a;
        mint ret = 1;
        while(n>0) {
            if(n&1)(ret*=x);
            (x*=x)%=get_mod();
            n>>=1;
        }
        return ret;
    }
    constexpr mint inv(){
        return pow(get_mod()-2);
    }
    static vector<mint> fac,ifac;
    static bool init;
    constexpr static int mx=10000001;
    void build(){
        init=0;
        fac.resize(mx);
        ifac.resize(mx);
        fac[0]=1,ifac[0]=1;
        for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i;
        ifac[mx-1]=fac[mx-1].inv();
        for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1);
    }
    mint comb(lint b){
        if(init)build();
        if(a==0&&b==0)return 1;
        if((lint)a<b||a<0)return 0;
        return fac[a]*ifac[a-b]*ifac[b];
    }
    mint fact(){
        if(init)build();
        return fac[a];
    }
    mint fact_inv(){
        if(init)build();
        return ifac[a];
    }
    friend ostream& operator<<(ostream& lhs, const mint& rhs) noexcept {
        lhs << rhs.a;
        return lhs;
    }
    friend istream& operator>>(istream& lhs,mint& rhs) noexcept {
        lhs >> rhs.a;
        return lhs;
    }
    constexpr static u64 get_mod(){return MOD;}
};
vector<mint> mint::fac;
vector<mint> mint::ifac;
bool mint::init=1;

int main(){
    lint n;
    cin>>n;
    vector<pair<lint,lint>> v(n);
    rep(i,n)cin>>v[i].first>>v[i].second;
    map<pair<lint,lint>,lint>m;
    vector<tuple<lint,lint,lint>>p;
    rep(i,n){
        lint x=v[i].first,y=v[i].second;
        m[{x,y}]++;
    }
    for(auto e:m){
        p.emplace_back(e.first.first,e.first.second,e.second);
    }
    mint ans=0;
    rep(i,p.size()){
        vector<tuple<lint,lint,lint>>q;
        rep(j,p.size()){
            if(i==j)continue;
            q.emplace_back(get<0>(p[j])-get<0>(p[i]),get<1>(p[j])-get<1>(p[i]),get<2>(p[j]));
        }
        auto pos=[](auto v)->lint{
            if (get<1>(v)< 0) return -1;
            if (get<1>(v) == 0 && 0 <= get<0>(v)) return 0;
            return 1;
        };
        stable_sort(all(q),[&](auto s,auto t){
            if(pos(s)!=pos(t))return pos(s)<pos(t);
            return 0<(get<0>(s)*get<1>(t)-get<1>(s)*get<0>(t));
        });
        vector<lint>tmp(3*q.size()+1);
        rep(j,q.size()*3)tmp[j+1]=tmp[j]+get<2>(q[j%q.size()]);
        lint l=0,r=0,pre=0;
        rep(j,q.size()){
            if(j&&get<0>(q[j])*get<1>(q[j-1])==get<1>(q[j])*get<0>(q[j-1])){
                ans+=mint(pre)*get<2>(p[i])*get<2>(q[j])*(get<0>(p[i])*(get<1>(p[i])+get<1>(q[j]))-get<1>(p[i])*(get<0>(p[i])+get<0>(q[j])));
                continue;
            }
            if(l<j)l=j;
            while((l!=j+(int)q.size())&&get<0>(q[j])*get<1>(q[l%q.size()])-get<1>(q[j])*get<0>(q[l%q.size()])<=0)l++;
            if(l==j+(int)q.size()){
                l=r=0;
                pre=0;
                continue;
            }
            if(r<l)r=l;
            while((r!=l+(int)q.size())&&get<0>(q[j])*get<1>(q[r%q.size()])-get<1>(q[j])*get<0>(q[r%q.size()])>0)r++;
            ans+=mint(tmp[r]-tmp[l])*get<2>(p[i])*get<2>(q[j])*(get<0>(p[i])*(get<1>(p[i])+get<1>(q[j]))-get<1>(p[i])*(get<0>(p[i])+get<0>(q[j])));
            pre=tmp[r]-tmp[l];
            if(r==l+(int)q.size()){
                l=r=0;
                continue;
            }
        }
    }
    cout<<ans<<endl;
}