結果
| 問題 | No.1144 Triangles |
| ユーザー |
 n_vip
|
| 提出日時 | 2020-07-31 23:10:13 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 502 ms / 3,000 ms |
| コード長 | 7,401 bytes |
| コンパイル時間 | 1,722 ms |
| コンパイル使用メモリ | 144,060 KB |
| 実行使用メモリ | 16,728 KB |
| 最終ジャッジ日時 | 2023-09-21 02:20:10 |
| 合計ジャッジ時間 | 10,059 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 54 ms
15,984 KB |
| testcase_01 | AC | 55 ms
16,032 KB |
| testcase_02 | AC | 54 ms
16,048 KB |
| testcase_03 | AC | 54 ms
16,236 KB |
| testcase_04 | AC | 495 ms
16,540 KB |
| testcase_05 | AC | 502 ms
16,496 KB |
| testcase_06 | AC | 491 ms
16,568 KB |
| testcase_07 | AC | 490 ms
16,428 KB |
| testcase_08 | AC | 500 ms
16,572 KB |
| testcase_09 | AC | 53 ms
16,028 KB |
| testcase_10 | AC | 54 ms
16,244 KB |
| testcase_11 | AC | 52 ms
16,224 KB |
| testcase_12 | AC | 53 ms
16,236 KB |
| testcase_13 | AC | 54 ms
16,180 KB |
| testcase_14 | AC | 473 ms
16,524 KB |
| testcase_15 | AC | 462 ms
16,696 KB |
| testcase_16 | AC | 498 ms
16,424 KB |
| testcase_17 | AC | 493 ms
16,584 KB |
| testcase_18 | AC | 476 ms
16,528 KB |
| testcase_19 | AC | 81 ms
16,096 KB |
| testcase_20 | AC | 53 ms
16,260 KB |
| testcase_21 | AC | 56 ms
16,232 KB |
| testcase_22 | AC | 476 ms
16,472 KB |
| testcase_23 | AC | 81 ms
16,352 KB |
| testcase_24 | AC | 459 ms
16,728 KB |
| testcase_25 | AC | 181 ms
16,376 KB |
| testcase_26 | AC | 67 ms
16,084 KB |
| testcase_27 | AC | 62 ms
16,292 KB |
| testcase_28 | AC | 133 ms
16,180 KB |
ソースコード
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T> T read(){ T re; cin>>re; return move(re);}
template<class T> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
const ll MOD=1e9+7; //998244353
ll modpow_(ll r,ll n,ll m=MOD){
ll re=1,d=r%m;
if(n<0)(n%=m-1)+=m-1;
for(;n;n/=2){
if(n&1)(re*=d)%=m;
(d*=d)%=m;
}
return re;
}
template <int mod=MOD> struct ModInt{
int v;
ModInt(int v=0):v(v){}
ModInt operator+(const ModInt &n)const{return v+n.v<mod ? v+n.v : v+n.v-mod;}
ModInt operator-(const ModInt &n)const{return v-n.v<0 ? v-n.v+mod : v-n.v;}
ModInt operator*(const ModInt &n)const{return ll(v)*n.v%mod;}
ModInt operator/(const ModInt &n)const{return ll(v)*modpow_(n.v%mod,-1,mod)%mod;}
ModInt operator+(const ll &n)const{return v+n<mod ? v+n : v+n-mod;}
ModInt operator-(const ll &n)const{return v-n<0 ? v-n+mod : v-n;}
ModInt operator*(const ll &n)const{return ll(v)*(n%mod)%mod;}
ModInt operator/(const ll &n)const{return ll(v)*modpow_(n%mod,-1,mod)%mod;}
ModInt& operator+=(const ModInt &n){v+=n.v; if(v>=mod) v-=mod; return *this;}
ModInt& operator-=(const ModInt &n){v-=n.v; if(v<0) v+=mod; return *this;}
ModInt& operator*=(const ModInt &n){v=ll(v)*n.v%mod; return *this;}
ModInt& operator/=(const ModInt &n){v=ll(v)*modpow_(n.v,-1,mod)%mod; return *this;}
ModInt& operator+=(const ll &n){v+=n; if(v>=mod) v-=mod; return *this;}
ModInt& operator-=(const ll &n){v-=n; if(v<0) v+=mod; return *this;}
ModInt& operator*=(const ll &n){v=ll(v)*n%mod; return *this;}
ModInt& operator/=(const ll &n){v=ll(v)*modpow_(n,-1,mod)%mod; return *this;}
bool operator==(const ModInt &n)const{return v==n.v;};
bool operator!=(const ModInt &n)const{return v!=n.v;};
ModInt& operator++(){ return operator+=(1); }
ModInt& operator--(){ return operator-=(1); }
ModInt operator++(int i){ ModInt tmp(*this); operator++(); return tmp; }
ModInt operator--(int i){ ModInt tmp(*this); operator--(); return tmp; }
};
#ifdef NUIP
class MINT_FRAC____{
public:
unordered_map<int,pii> dict;
MINT_FRAC____(int n){
rep(p,n+1)reps(q,1,n+1)if(__gcd(p,q)==1){
dict[1ll*p*modpow_(q,-1)%MOD]=pii(p,q);
dict[MOD-1ll*p*modpow_(q,-1)%MOD]=pii(-p,q);
}
}
} Il1Il1Il1(1000);
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){if(Il1Il1Il1.dict.count(n.v)) os<<n.v<<"("<<Il1Il1Il1.dict[n.v].X<<"/"<<Il1Il1Il1.dict[n.v].Y<<")";else os<<n.v;return os;};
#else
template<int mod> ostream& operator<<(ostream &os,const ModInt<mod> &n){return os<<n.v;};
#endif
template<int mod> ModInt<mod> operator+(const ll &n,const ModInt<mod> &m){return m.v+n<mod ? m.v+n : m.v+n-mod;}
template<int mod> ModInt<mod> operator-(const ll &n,const ModInt<mod> &m){return n-m.v<0 ? n-m.v+mod : n-m.v;}
template<int mod> ModInt<mod> operator*(const ll &n,const ModInt<mod> &m){return ll(m.v)*(n%mod)%mod;}
template<int mod> ModInt<mod> operator/(const ll &n,const ModInt<mod> &m){return ModInt<mod>(n%mod)/m;}
typedef ModInt<MOD> mint;
template <int mod> ModInt<mod> modpow(ModInt<mod> r,ll n){ ModInt<mod> re(1); if(n<0)(n%=mod-1)+=mod-1; for(;n;n/=2){if(n&1) re*=r; r*=r;} return re;}
vector<mint> fact,finv,inv;
mint comb(ll n,ll r){ if(n<r||r<0)return 0; return fact[n]*finv[n-r]*finv[r];}
class Doralion{
void Modinvs(vector<mint> &re,int n){ re.resize(n+1); re[1]=1; for(int i=2;i<=n;++i)re[i]=re[MOD%i]*(MOD-MOD/i);}
void Facts(vector<mint> &re,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*(i+1);}
void Factinvs(vector<mint> &re,const vector<mint> &inv,int n){ re.resize(n+1); re[0]=1; rep(i,n)re[i+1]=re[i]*inv[i+1];}
public:
Doralion(int n){ Modinvs(inv,n); Facts(fact,n); Factinvs(finv,inv,n);}
} doralion(1123456);
using pmm=pair<mint,mint>;
mint modpow(ll r,ll n){ return modpow_(r,n);}
using P=pll;
ll cros(const P &a,const P &b){ return a.X*b.Y-a.Y*b.X;}
bool argCmp(const P& a,const P&b){
if(!b.X && !b.Y) return 0;
if(!a.X && !a.Y) return 1;
if(a.Y*b.Y<0) return b.Y<0;
if(!a.Y && !b.Y) return a.X>0 && b.X<0;
return cros(a,b)>0;
}
mint solve(vector<P> &ps){
sort(all(ps),argCmp);
out(ps,1);
const int n=ps.size();
ps.resize(n+n);
rep(i,n) ps[i+n]=ps[i];
int r=0;
P s(0,0);
mint re=0;
int cons=0;
rep(l,n){
while(r+cons<l+n && cros(ps[l],ps[r])>=0){
s+=ps[r];
++r;
}
auto tmp=cros(ps[l],s)%MOD;
if(tmp<0) tmp+=MOD;
out(l,r,ps[l],s,tmp,1);
re+=tmp;
s-=ps[l];
// reps(i,l,r) assert(cros(ps[l],ps[i])>=0);
++cons;
if(ps[l]!=ps[l+1]) cons=0;
}
out(re,1);
return re;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cout<<fixed<<setprecision(0);
cauto n=read<int>();
cauto ps=readV<P>(n);
mint re=0;
rep(i,n){
out(i,1);
vector<P> qs;
rep(j,n)if(ps[j]!=ps[i]) qs.pb(ps[j]-ps[i]);
re+=solve(qs);
}
cout<<re*inv[3] NL;
return 0;
}