oj.uz

Submission #714041

# Submission time Handle Problem Language Result Execution time Memory
714041 2023-03-23T16:11:03 Z Username4132 Kućice (COCI21_kucice) C++14
110 / 110
 256 ms 440 KB 
#include<iostream>
#include<algorithm>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define dforn(i, n) for(int i=n-1; i>=0; --i)
#define F first
#define S second

const int MAXN=1010, MOD=1000000007;
int n;
pii pt[MAXN], arr[MAXN];

ll ex(ll b, int e){
    ll ret=1;
    while(e){
        if(e&1) ret = (ret*b)%MOD;
        b = (b*b)%MOD;
        e>>=1;
    }
    return ret;
}

bool up(pii a){
    return (a.S==0? (a.F>0) : (a.S>0));
}

ll signed_area(pii a, pii b, pii c){
    return (((ll)a.F)*b.S - ((ll)a.S)*b.F + ((ll)b.F)*c.S - ((ll)b.S)*c.F + ((ll)c.F)*a.S - ((ll)c.S)*a.F);
}

ll count(int ind){
    ll ret=0;
    copy(pt, pt+n, arr), swap(arr[ind], arr[n-1]);
    sort(arr, arr+n-1, [](pii a, pii b){
        pii A = {a.F - arr[n-1].F, a.S - arr[n-1].S};
        pii B = {b.F - arr[n-1].F, b.S - arr[n-1].S};
        return up(A)==up(B)? ((ll)A.S)*B.F < ((ll)B.S)*A.F : (up(A)>up(B));
    });
    forn(i, n-1){
        int cur=i, off=0;
        dforn(j, 10) if(off+(1<<j)<(n-1)){
            int nxt = (cur+(1<<j))%(n-1);
            if(signed_area(arr[n-1], arr[i], arr[nxt])>0){
                cur = nxt, off+=(1<<j);
            }
        }
        ret+=ex(2, off);
    }
    return ret+1;
}

int main(){
    ll ans=0;
    scanf("%d", &n);
    forn(i, n) scanf("%d %d", &pt[i].F, &pt[i].S);
    forn(i, n) ans+=count(i);
    printf("%d\n", ((int)((n*(ex(2, n)) - (ans%MOD) + MOD)%MOD)));
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:57:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     forn(i, n) scanf("%d %d", &pt[i].F, &pt[i].S);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 208 ms 332 KB Output is correct
7 Correct 256 ms 320 KB Output is correct
8 Correct 193 ms 332 KB Output is correct
9 Correct 248 ms 308 KB Output is correct
10 Correct 203 ms 320 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 203 ms 288 KB Output is correct
7 Correct 245 ms 212 KB Output is correct
8 Correct 197 ms 308 KB Output is correct
9 Correct 234 ms 212 KB Output is correct
10 Correct 195 ms 312 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 208 ms 332 KB Output is correct
7 Correct 256 ms 320 KB Output is correct
8 Correct 193 ms 332 KB Output is correct
9 Correct 248 ms 308 KB Output is correct
10 Correct 203 ms 320 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 203 ms 288 KB Output is correct
17 Correct 245 ms 212 KB Output is correct
18 Correct 197 ms 308 KB Output is correct
19 Correct 234 ms 212 KB Output is correct
20 Correct 195 ms 312 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 2 ms 212 KB Output is correct
43 Correct 2 ms 300 KB Output is correct
44 Correct 2 ms 212 KB Output is correct
45 Correct 2 ms 340 KB Output is correct
46 Correct 2 ms 212 KB Output is correct
47 Correct 2 ms 304 KB Output is correct
48 Correct 2 ms 212 KB Output is correct
49 Correct 2 ms 212 KB Output is correct
50 Correct 2 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 304 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 300 KB Output is correct
57 Correct 249 ms 440 KB Output is correct
58 Correct 207 ms 304 KB Output is correct
59 Correct 256 ms 312 KB Output is correct
60 Correct 198 ms 212 KB Output is correct
61 Correct 233 ms 308 KB Output is correct
62 Correct 223 ms 308 KB Output is correct
63 Correct 208 ms 316 KB Output is correct
64 Correct 240 ms 308 KB Output is correct
65 Correct 237 ms 304 KB Output is correct