#522156 (C++14) No.1144 Triangles

提出ソース

結果

問題	No.1144 Triangles
ユーザー	xllend3
提出日時	2020-07-31 22:29:14
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,589 bytes
コンパイル時間	1,721 ms
コンパイル使用メモリ	175,816 KB
実行使用メモリ	4,504 KB
最終ジャッジ日時	2023-09-21 00:53:05
合計ジャッジ時間	9,825 ms
ジャッジサーバーID （参考情報）	judge11 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	2 ms 4,380 KB
testcase_04	AC	542 ms 4,380 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	1 ms 4,376 KB
testcase_10	AC	1 ms 4,376 KB
testcase_11	WA	-
testcase_12	AC	1 ms 4,380 KB
testcase_13	AC	2 ms 4,376 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	530 ms 4,380 KB
testcase_18	WA	-
testcase_19	AC	33 ms 4,376 KB
testcase_20	AC	3 ms 4,376 KB
testcase_21	AC	3 ms 4,380 KB
testcase_22	AC	524 ms 4,380 KB
testcase_23	AC	30 ms 4,380 KB
testcase_24	AC	514 ms 4,380 KB
testcase_25	AC	159 ms 4,376 KB
testcase_26	AC	17 ms 4,376 KB
testcase_27	AC	190 ms 4,380 KB
testcase_28	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define rep(i,a,n) for(int i=(a);i<=(n);++i)
#define dep(i,a,n) for(int i=(a);i>=(n);--i)
#define eps 1e-8
#define pi 3.1415926535897
#define sqr(x) ((x)*(x))
#define SZ(x) ((int)(x).size())
#define CPY(a,b) memcpy(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define POSIN(x,y) (1<=(x)&&(x)<=m&&1<=(y)&&(y)<=n)
#define ALL(x) (x).begin(),(x).end()
#define COUT(S,x) cout<<fixed<<setprecision(x)<<S<<endl
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#else
#define debug(...) 
#define dbg(x) 
#endif
template<typename T> bool MAX(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool MIN(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
typedef long long ll;
typedef double lf;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<lf,lf> pff;
typedef complex<double> CD;
typedef vector<int> VI;
typedef vector<ll> VL;
const int inf=0x3f3f3f3f;
const int mo=1000000007;
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
template<class T1,class T2>inline void gn(T1&r,T2&s){gn(r),gn(s);}
template<class T1,class T2,class T3>inline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);}
template<class T1,class T2,class T3,class T4>inline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};
ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
//*******************************************

const int N=111111,M=111111;
int l,m,n,t,C;
pii a[N];
ll det(pll a,pll b){return 1ll*a.X*b.Y-1ll*a.Y*b.X;}
inline bool cmp(const pii &a,const pii &b){
	if(a.X>0&&b.X<0)return 1;
	else if(a.X<0&&b.X>0)return 0;
	return det(a,b)>0;
}
pll su[N];
int main(){
#ifdef LOCAL
	freopen("F.in","r",stdin);//freopen("F.out","w",stdout);
#endif
	scanf("%d",&n);rep(i,1,n)scanf("%d%d",&a[i].X,&a[i].Y);
	ll ans=0;
	rep(k,1,n){
		vector<pll>V;
		rep(j,1,n)if(j!=k)V.pb(a[j]-a[k]);
		sort(V.begin(),V.end(),cmp);
		// for(auto i:V)printf("%d %d\n",i.X,i.Y);puts("");
		rep(i,0,n-2)V.pb(V[i]);
		rep(i,1,2*n-2)su[i]=su[i-1]+V[i-1];
		int pt=0;
		ll res=0;
		rep(i,0,n-2){
			while(pt==i||det(V[i],V[pt])>0){
				++pt;
			}
			// printf("%d %d %lld %lld\n",i,pt,abs(det(su[pt]-su[i],V[i])),abs(det(su[i+n-1]-su[pt],V[i])));
			res+=(abs(det(su[pt]-su[i],V[i]))+abs(det(su[i+n-1]-su[pt],V[i])));
			res%=mo;
		}
		// rep(i,0,n-2)rep(j,0,n-2)printf("%d%c",det(V[i],V[j]),j==n-2?'\n':' ');
		ll chk=0;
		rep(i,0,n-2)rep(j,0,n-2)chk+=abs(det(V[i],V[j]));
		// printf("%d %lld %lld\n",k,res,chk);
		upmo(ans,res);
	}
	printf("%lld\n",ans*powmod(6,mo-2)%mo);
	return 0;
}

yukicoder

結果

テストケース

ソースコード