oj.uz

Submission #537761

# Submission time Handle Problem Language Result Execution time Memory
537761 2022-03-15T13:16:14 Z inksamurai Kućice (COCI21_kucice) C++17
40 / 110
 1000 ms 340 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3HspL4A ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vec(int);
void print(){cout<<"\n";}
template<class T,class...E>
void print(const T&v,const E&...u){cout<<v<<' ',print(u...);}
// e 
 
//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};
using mint=modint<1000'000'007>;
 
using ld=long double;
 
struct P{
	ld x,y;
	P(ld _x=0,ld _y=0):x(_x),y(_y){}
	P operator+(const P &p){ return {x+p.x,y+p.y}; }
	P operator-(const P &p){ return {x-p.x,y-p.y}; }
	P operator*(ld d){ return {x*d,y*d}; }
	P operator/(ld d){ return {x/d,y/d}; } // d!=0
	bool operator==(const P &p)const{ return x==p.x and y==p.y; }	
	bool operator<(const P &p)const{ return x!=p.x?x<p.x:y<p.y; }	
 
	ld norm(){ return x*x+y*y; }
	ld abs(){ return sqrt(norm()); }
};
ld dist(P a,P b){
	return (a-b).abs();
}
ld ccw(P a,P b,P c){
	return a.x*(b.y-c.y)+b.x*(c.y-a.y)+c.x*(a.y-b.y);
}
 
int sgn(int x){
	return (x<0?-1:1);
}
 
bool cmpup(P a,P b){
	if(sgn(a.x)!=sgn(b.x)){
		return sgn(a.x)<sgn(b.x);
	}
	return (a.y*b.x>b.y*a.x);
}

bool cmplo(P a,P b){
	if(sgn(a.x)!=sgn(b.x)){
		return sgn(a.x)<sgn(b.x);
	}
	return (a.y*b.x<b.y*a.x);	
}

signed main(){
_3HspL4A;
	int n;
	cin>>n;
	vec(P) a;
	rep(i,n){
		int x,y; cin>>x>>y;
		a.pb(P(x,y));
	}
	mint ans=0;
 
	auto quq=[&](int pivot){
		vec(P) hi,lo;
		rep(i,n){
			if(i==pivot) continue;
			P pnt=a[i]-a[pivot];
			if(pnt.y>=0) hi.pb(pnt);
			else lo.pb(pnt);
		}
		sort(hi.begin(),hi.end(),cmpup);
		sort(lo.begin(),lo.end(),cmplo);
		P pnt(0,0);
		int nhi=sz(hi),nlo=sz(lo);
		rep(i,nhi){
			int now=0;
			for(auto p:lo){
				if(ccw(hi[i],pnt,p)>=0){
					now+=1;
				}
			}
			now+=nhi-i-1;
			// for(auto p:hi){
			// 	if(p==hi[i]) continue;
			// 	if(ccw(hi[i],pnt,p)>=0){
			// 		now+=1;
			// 	}	
			// }
			// assert(now==nhi-i-1);
			ans-=mint(2).pow(now);
		}
		per(i,nlo){
			int now=0;
			for(auto p:hi){
				if(ccw(lo[i],p,pnt)<0){
					// print(lo[i].x,lo[i].y,p.x,p.y);
					now+=1;
				}
			}
			now+=i;
			// for(auto p:lo){
			// 	if(p==lo[i]) continue;
			// 	if(ccw(lo[i],p,pnt)<0){
			// 		// print(lo[i].x,lo[i].y,p.x,p.y);
			// 		now+=1;
			// 	}	
			// }
			// assert(now==i);
			ans-=mint(2).pow(now);
		}
		ans-=1;
	};
	
	rep(i,n){
		quq(i);
		// break;
	}
	ans+=mint(2).pow(n)*n;
	print(ans.x);
//
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Execution timed out 1080 ms 340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Execution timed out 1089 ms 340 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 220 KB Output is correct
22 Correct 6 ms 216 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 7 ms 212 KB Output is correct
25 Correct 5 ms 216 KB Output is correct
26 Correct 6 ms 324 KB Output is correct
27 Correct 6 ms 212 KB Output is correct
28 Correct 5 ms 212 KB Output is correct
29 Correct 6 ms 340 KB Output is correct
30 Correct 6 ms 212 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Execution timed out 1080 ms 340 KB Time limit exceeded
7 Halted 0 ms 0 KB -