Submission #521477

#	Time	Username	Problem	Language	Result	Execution time	Memory
521477		errorgorn	Kućice (COCI21_kucice)	C++17	110 / 110	175 ms	384 KiB

Main

// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

const int MOD=1000000007;

ll qexp(ll b,ll p,int m){
    ll res=1;
    while (p){
        if (p&1) res=(res*b)%m;
        b=(b*b)%m;
        p>>=1;
    }
    return res;
}

ll fix(ll i){
	i%=MOD;
	if (i<0) i+=MOD;
	return i;
}

int n;
ii arr[1005];

const double TAU=acos(0)*4;

double diff(double i,double j){
	double res=j-i;
	if (res<0) return res+TAU;
	else return res;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,0,n) cin>>arr[x].fi>>arr[x].se;
	
	ll ans=qexp(2,n-1,MOD)*n%MOD;
	
	rep(x,0,n){
		ll tot=qexp(2,n-1,MOD)-1;
		
		vector<double> v;
		rep(y,0,n) if (x!=y){
			v.pub(atan2l(arr[y].fi-arr[x].fi,arr[y].se-arr[x].se));
		}
		
		sort(all(v));
		
		//for (auto &it:v) cout<<it<<" "; cout<<endl;
		
		int idx=0;
		rep(x,0,sz(v)){
			while ((idx+1)%sz(v)!=x && diff(v[x],v[(idx+1)%sz(v)])<=TAU/2) idx++;
			
			//cout<<x<<" "<<idx<<endl;
			
			tot=fix(tot-qexp(2,(idx+sz(v)-x)%sz(v),MOD));
			
			if (idx==x) idx++;
		}
		
		ans=(ans+tot)%MOD;
	}
	
	cout<<ans<<endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 10 / 10
• Subtask 4: 30 / 30
• Subtask 5: 30 / 30