oj.uz

Submission #532183

# Submission time Handle Problem Language Result Execution time Memory
532183 2022-03-02T10:36:42 Z Killer2501 Kućice (COCI21_kucice) C++14
110 / 110
 129 ms 9804 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<ll, int>
#define fi first
#define se second
using namespace std;
const int N = 2e5+2;
const int M = 52;
const int mod = 1e9+7;
const ll base = 75;
const ll inf = 1e16;
int n, lab[N], t, c[N], h[N], m, a[N], b[N], k;
ll ans, d[N];
vector<int> adj[N], g[N];
vector<pll> vi;
string s;
bool vis[N];
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n&1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
void add(int& x, int y)
{
    x += y;
    if(x >= mod)x -= mod;
}
int findp(int u)
{
    return lab[u] < 0 ? u : lab[u] = findp(lab[u]);
}
void hop(int u, int v)
{
    u = findp(u);
    v = findp(v);
    if(u == v)return;
    if(lab[u] > lab[v])swap(u, v);
    lab[u] += lab[v];
    lab[v] = u;
}
struct BIT
{
    int n;
    vector<ll> fe;
    BIT(){}
    void init(int _n)
    {
        n = _n;
        fe.resize(n+1, 0);
    }
    void reset()
    {
        fill(fe.begin(), fe.end(), 0);
    }
    void add(int id, int x)
    {
        for(; id <= n; id += id & -id)fe[id] += x;
    }
    ll get(int id)
    {
        ll total = 0;
        for(; id; id -= id & -id)total += fe[id];
        return total;
    }
};
pll p[N];
ll ccw(pll x, pll y)
{
    return x.se * y.fi - x.fi * y.se;
}
bool cmp(const pll& x, pll& y)
{
    if((x.fi > 0) != (y.fi > 0))return x.fi < y.fi;
    return ccw(x, y) > 0;
}
void sol()
{
    cin >> n;
    d[0] = 1;
    for(int i = 1; i <= n; i ++)
    {
        cin >> p[i].fi >> p[i].se;
        d[i] = d[i-1] * 2 % mod;
    }
    ans = d[n] * n % mod;
    ans = (ans - n + mod) % mod;
    for(int i = 1; i <= n; i ++)
    {
        vi.clear();
        for(int j = 1; j <= n; j ++)
        {
            if(i == j)continue;
            p[j].fi -= p[i].fi;
            p[j].se -= p[i].se;
            vi.pb(p[j]);
        }
        sort(vi.begin(), vi.end(), cmp);
        for(int l = 0, r = 0; l < n-1; l ++)
        {
            if(l > r)r = l;
            while(ccw(vi[l%(n-1)], vi[(r+1)%(n-1)]) > 0)++r;
            //cout << l <<" "<<r<<" "<<d[r-l] << '\n';
            ans = (ans - d[r-l] + mod) % mod;
        }
        for(int j = 1; j <= n; j ++)
        {
            if(i == j)continue;
            p[j].fi += p[i].fi;
            p[j].se += p[i].se;
        }
    }
    cout << ans;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    #define task "test"
    if(fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int test = 1;
    //cin >> test;
    while(test -- > 0)sol();
    return 0;
}
/*
1234
21
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:132:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  132 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 90 ms 9780 KB Output is correct
7 Correct 108 ms 9780 KB Output is correct
8 Correct 98 ms 9776 KB Output is correct
9 Correct 125 ms 9784 KB Output is correct
10 Correct 89 ms 9676 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9728 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 7 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 102 ms 9780 KB Output is correct
7 Correct 111 ms 9788 KB Output is correct
8 Correct 89 ms 9676 KB Output is correct
9 Correct 128 ms 9676 KB Output is correct
10 Correct 102 ms 9776 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9724 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 90 ms 9780 KB Output is correct
7 Correct 108 ms 9780 KB Output is correct
8 Correct 98 ms 9776 KB Output is correct
9 Correct 125 ms 9784 KB Output is correct
10 Correct 89 ms 9676 KB Output is correct
11 Correct 5 ms 9728 KB Output is correct
12 Correct 5 ms 9724 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 6 ms 9676 KB Output is correct
16 Correct 102 ms 9780 KB Output is correct
17 Correct 111 ms 9788 KB Output is correct
18 Correct 89 ms 9676 KB Output is correct
19 Correct 128 ms 9676 KB Output is correct
20 Correct 102 ms 9776 KB Output is correct
21 Correct 5 ms 9732 KB Output is correct
22 Correct 5 ms 9676 KB Output is correct
23 Correct 6 ms 9728 KB Output is correct
24 Correct 5 ms 9676 KB Output is correct
25 Correct 5 ms 9728 KB Output is correct
26 Correct 7 ms 9676 KB Output is correct
27 Correct 5 ms 9676 KB Output is correct
28 Correct 6 ms 9676 KB Output is correct
29 Correct 5 ms 9640 KB Output is correct
30 Correct 5 ms 9676 KB Output is correct
31 Correct 5 ms 9676 KB Output is correct
32 Correct 5 ms 9676 KB Output is correct
33 Correct 5 ms 9676 KB Output is correct
34 Correct 6 ms 9728 KB Output is correct
35 Correct 7 ms 9676 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 5 ms 9724 KB Output is correct
38 Correct 6 ms 9676 KB Output is correct
39 Correct 5 ms 9732 KB Output is correct
40 Correct 5 ms 9676 KB Output is correct
41 Correct 5 ms 9676 KB Output is correct
42 Correct 5 ms 9676 KB Output is correct
43 Correct 6 ms 9676 KB Output is correct
44 Correct 7 ms 9728 KB Output is correct
45 Correct 6 ms 9676 KB Output is correct
46 Correct 6 ms 9728 KB Output is correct
47 Correct 8 ms 9676 KB Output is correct
48 Correct 7 ms 9732 KB Output is correct
49 Correct 7 ms 9728 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 6 ms 9728 KB Output is correct
52 Correct 5 ms 9724 KB Output is correct
53 Correct 5 ms 9676 KB Output is correct
54 Correct 5 ms 9676 KB Output is correct
55 Correct 6 ms 9676 KB Output is correct
56 Correct 5 ms 9676 KB Output is correct
57 Correct 105 ms 9780 KB Output is correct
58 Correct 89 ms 9772 KB Output is correct
59 Correct 108 ms 9784 KB Output is correct
60 Correct 101 ms 9776 KB Output is correct
61 Correct 112 ms 9784 KB Output is correct
62 Correct 97 ms 9744 KB Output is correct
63 Correct 91 ms 9744 KB Output is correct
64 Correct 113 ms 9804 KB Output is correct
65 Correct 129 ms 9784 KB Output is correct