oj.uz

Submission #531439

# Submission time Handle Problem Language Result Execution time Memory
531439 2022-02-28T17:03:03 Z Rafi22 Kućice (COCI21_kucice) C++14
110 / 110
 113 ms 452 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

int x[1007],y[1007];
ll p[1007];

ll cross(ll x1,ll y1,ll x2,ll y2){return x1*y2-y1*x2;}
bool cmp(int l,int r)
{
    bool a=x[l]>=0,b=x[r]>=0;
    if(a!=b) return a>b;
    return cross(x[l],y[l],x[r],y[r])<0;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
    p[0]=1;
    for(int i=1;i<=n;i++) p[i]=p[i-1]*2%mod;
    ll ans=p[n]*(ll)n%mod;
    for(int i=1;i<=n;i++)
    {
        ans=(ans-1+mod)%mod;
        int dx=x[i],dy=y[i];
        for(int j=1;j<=n;j++) x[j]-=dx;
        for(int j=1;j<=n;j++) y[j]-=dy;
        vector<int>V;
        for(int j=1;j<=n;j++) if(i!=j) V.pb(j);
        sort(all(V),cmp);
        int k=0;
        for(int j=0;j<n-1;j++)
        {
            k=max(k,j);
            while(cross(x[V[j]],y[V[j]],x[V[(k+1)%(n-1)]],y[V[(k+1)%(n-1)]])<0) k++;
            ans=(ans-p[k-j]+mod)%mod;
        }
        for(int j=1;j<=n;j++) x[j]+=dx;
        for(int j=1;j<=n;j++) y[j]+=dy;
    }
    cout<<ans;


    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 316 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 93 ms 336 KB Output is correct
7 Correct 109 ms 332 KB Output is correct
8 Correct 91 ms 336 KB Output is correct
9 Correct 102 ms 340 KB Output is correct
10 Correct 84 ms 332 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 0 ms 204 KB Output is correct
6 Correct 93 ms 328 KB Output is correct
7 Correct 109 ms 452 KB Output is correct
8 Correct 91 ms 332 KB Output is correct
9 Correct 109 ms 332 KB Output is correct
10 Correct 90 ms 332 KB Output is correct

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 316 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 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 316 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

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 316 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 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 316 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 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 2 ms 324 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 316 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 93 ms 336 KB Output is correct
7 Correct 109 ms 332 KB Output is correct
8 Correct 91 ms 336 KB Output is correct
9 Correct 102 ms 340 KB Output is correct
10 Correct 84 ms 332 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 0 ms 204 KB Output is correct
16 Correct 93 ms 328 KB Output is correct
17 Correct 109 ms 452 KB Output is correct
18 Correct 91 ms 332 KB Output is correct
19 Correct 109 ms 332 KB Output is correct
20 Correct 90 ms 332 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 316 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 312 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 2 ms 204 KB Output is correct
43 Correct 2 ms 324 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 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 204 KB Output is correct
57 Correct 106 ms 336 KB Output is correct
58 Correct 90 ms 336 KB Output is correct
59 Correct 113 ms 332 KB Output is correct
60 Correct 102 ms 336 KB Output is correct
61 Correct 110 ms 336 KB Output is correct
62 Correct 95 ms 332 KB Output is correct
63 Correct 94 ms 332 KB Output is correct
64 Correct 104 ms 336 KB Output is correct
65 Correct 109 ms 332 KB Output is correct