oj.uz

Submission #521477

# Submission time Handle Problem Language Result Execution time Memory
521477 2022-02-02T08:19:03 Z errorgorn Kućice (COCI21_kucice) C++17
110 / 110
 175 ms 384 KB 
// 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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 139 ms 332 KB Output is correct
7 Correct 169 ms 360 KB Output is correct
8 Correct 134 ms 332 KB Output is correct
9 Correct 163 ms 344 KB Output is correct
10 Correct 132 ms 324 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 142 ms 344 KB Output is correct
7 Correct 162 ms 340 KB Output is correct
8 Correct 140 ms 328 KB Output is correct
9 Correct 163 ms 332 KB Output is correct
10 Correct 135 ms 344 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 139 ms 332 KB Output is correct
7 Correct 169 ms 360 KB Output is correct
8 Correct 134 ms 332 KB Output is correct
9 Correct 163 ms 344 KB Output is correct
10 Correct 132 ms 324 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 142 ms 344 KB Output is correct
17 Correct 162 ms 340 KB Output is correct
18 Correct 140 ms 328 KB Output is correct
19 Correct 163 ms 332 KB Output is correct
20 Correct 135 ms 344 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 316 KB Output is correct
36 Correct 1 ms 320 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 2 ms 316 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 316 KB Output is correct
45 Correct 2 ms 204 KB Output is correct
46 Correct 2 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 2 ms 320 KB Output is correct
49 Correct 2 ms 204 KB Output is correct
50 Correct 2 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 316 KB Output is correct
53 Correct 0 ms 320 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 320 KB Output is correct
57 Correct 162 ms 384 KB Output is correct
58 Correct 139 ms 332 KB Output is correct
59 Correct 175 ms 344 KB Output is correct
60 Correct 143 ms 344 KB Output is correct
61 Correct 166 ms 352 KB Output is correct
62 Correct 151 ms 344 KB Output is correct
63 Correct 139 ms 332 KB Output is correct
64 Correct 161 ms 348 KB Output is correct
65 Correct 160 ms 340 KB Output is correct