oj.uz

Submission #228171

# Submission time Handle Problem Language Result Execution time Memory
228171 2020-04-30T05:51:10 Z qkxwsm Bulldozer (JOI17_bulldozer) C++14
75 / 100
 1731 ms 94884 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}
 
template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}
 
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef array<array<ll, 2>, 2> dparr;
 
const int MAXN = 2053;
 
struct point
{
    int x, y, w;
};
 
int N;
point arr[MAXN];
bool mark[MAXN][MAXN];
vector<pair<pll, pii> > events;
dparr seg[2 * MAXN];
int pos[MAXN];
ll ans;
 
dparr comb(dparr lt, dparr rt)
{
    dparr res;
    res[0][0] = max(lt[0][1] + rt[1][0], max(lt[0][0], rt[0][0]));
    res[0][1] = max(lt[0][1] + rt[1][1], rt[0][1]);
    res[1][0] = max(lt[1][0], lt[1][1] + rt[1][0]);
    res[1][1] = lt[1][1] + rt[1][1];
    return res;
}
void build(int w, int L, int R)
{
    if (L == R)
    {
        FOR(i, 0, 2) FOR(j, 0, 2) seg[w][i][j] = arr[L].w;
        return;
    }
    int mid = (L + R) >> 1;
    build(w << 1, L, mid);
    build(w << 1 | 1, mid + 1, R);
    seg[w] = comb(seg[w << 1], seg[w << 1 | 1]);
}
void update(int w, int L, int R, int a, int v)
{
    if (L == R)
    {
        FOR(i, 0, 2) FOR(j, 0, 2) seg[w][i][j] = v;
        return;
    }
    int mid = (L + R) >> 1;
    if (a <= mid) update(w << 1, L, mid, a, v);
    else update(w << 1 | 1, mid + 1, R, a, v);
    seg[w] = comb(seg[w << 1], seg[w << 1 | 1]);
}
 
ll gcd(ll a, ll b)
{
    return (b == 0 ? a : gcd(b, a % b));
}
pll normalize(pll p)
{
    ll g = gcd(abs(p.fi), abs(p.se));
    p.fi /= g; p.se /= g;
    if (p.se < 0)
    {
        p.se = -p.se;
        p.fi = -p.fi;
    }
    if (p.se == 0 && p.fi < 0)
    {
        p.fi = -p.fi;
    }
    return p;
}
bool cmp1(point a, point b)
{
    if (a.y != b.y)
    {
        return a.y < b.y;
    }
    return a.x < b.x;
}
bool cmp(pll a, pll b)
{
    return a.fi * b.se > b.fi * a.se;
}
bool cmp2(pair<pll, pii> a, pair<pll, pii> b)
{
    return cmp(a.fi, b.fi);
}
 
int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, N)
    {
        cin >> arr[i].x >> arr[i].y >> arr[i].w;
        ckmax(ans, arr[i].w);
    }
    sort(arr, arr + N, cmp1);
    iota(pos, pos + N, 0);
    build(1, 0, N - 1);
    // FOR(i, 0, N)
    // {
    //     cerr << arr[i].x << ' ' << arr[i].y << ' ' << arr[i].w << endl;
    // }
    //consider the order of the points. rotate the line sideways.
    //then, at a given slope, some vectors of lines reverse order.
    FOR(i, 0, N)
    {
        vector<pair<pll, int> > ve;
        FOR(j, i + 1, N)
        {
            if (mark[i][j])
            {
                continue;
            }
            pll p = normalize({arr[j].x - arr[i].x, arr[j].y - arr[i].y});
            events.PB({p, {i, j}});
        }
    }
    build(1, 0, N - 1);
    ckmax(ans, seg[1][0][0]);
    stable_sort(ALL(events), cmp2);
    // cerr << "alive\n";
    FOR(i, 0, SZ(events))
    {
        auto a = events[i];
        pii p = a.se;
        swap(pos[p.fi], pos[p.se]);
        update(1, 0, N - 1, pos[p.fi], arr[p.fi].w);
        update(1, 0, N - 1, pos[p.se], arr[p.se].w);
        //you can take all of it.
        ckmax(ans, seg[1][0][0]);
        // cerr << "return " << seg[1][0][0] << endl;
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 7 ms 704 KB Output is correct
4 Correct 7 ms 704 KB Output is correct
5 Correct 8 ms 704 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 7 ms 704 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 7 ms 640 KB Output is correct
25 Correct 7 ms 768 KB Output is correct
26 Correct 7 ms 704 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 7 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 7 ms 640 KB Output is correct
31 Correct 7 ms 704 KB Output is correct
32 Correct 7 ms 640 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 7 ms 704 KB Output is correct
4 Correct 7 ms 704 KB Output is correct
5 Correct 8 ms 704 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 7 ms 704 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 7 ms 640 KB Output is correct
25 Correct 7 ms 768 KB Output is correct
26 Correct 7 ms 704 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 7 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 7 ms 640 KB Output is correct
31 Correct 7 ms 704 KB Output is correct
32 Correct 7 ms 640 KB Output is correct
33 Correct 1669 ms 94588 KB Output is correct
34 Correct 1677 ms 94804 KB Output is correct
35 Correct 1671 ms 94584 KB Output is correct
36 Correct 1690 ms 94652 KB Output is correct
37 Correct 1703 ms 94684 KB Output is correct
38 Correct 1731 ms 94580 KB Output is correct
39 Correct 1710 ms 94660 KB Output is correct
40 Correct 1667 ms 94744 KB Output is correct
41 Correct 1680 ms 94584 KB Output is correct
42 Correct 1678 ms 94584 KB Output is correct
43 Correct 1618 ms 94584 KB Output is correct
44 Correct 1635 ms 94712 KB Output is correct
45 Correct 1626 ms 94716 KB Output is correct
46 Correct 1628 ms 94584 KB Output is correct
47 Correct 1640 ms 94796 KB Output is correct
48 Correct 1626 ms 94668 KB Output is correct
49 Correct 1639 ms 94584 KB Output is correct
50 Correct 1627 ms 94580 KB Output is correct
51 Correct 1648 ms 94588 KB Output is correct
52 Correct 1619 ms 94728 KB Output is correct
53 Correct 1641 ms 94712 KB Output is correct
54 Correct 1611 ms 94580 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 7 ms 704 KB Output is correct
4 Correct 7 ms 704 KB Output is correct
5 Correct 8 ms 704 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 8 ms 704 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 7 ms 640 KB Output is correct
22 Correct 7 ms 704 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 7 ms 640 KB Output is correct
25 Correct 7 ms 768 KB Output is correct
26 Correct 7 ms 704 KB Output is correct
27 Correct 7 ms 640 KB Output is correct
28 Correct 7 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 7 ms 640 KB Output is correct
31 Correct 7 ms 704 KB Output is correct
32 Correct 7 ms 640 KB Output is correct
33 Correct 1669 ms 94588 KB Output is correct
34 Correct 1677 ms 94804 KB Output is correct
35 Correct 1671 ms 94584 KB Output is correct
36 Correct 1690 ms 94652 KB Output is correct
37 Correct 1703 ms 94684 KB Output is correct
38 Correct 1731 ms 94580 KB Output is correct
39 Correct 1710 ms 94660 KB Output is correct
40 Correct 1667 ms 94744 KB Output is correct
41 Correct 1680 ms 94584 KB Output is correct
42 Correct 1678 ms 94584 KB Output is correct
43 Correct 1618 ms 94584 KB Output is correct
44 Correct 1635 ms 94712 KB Output is correct
45 Correct 1626 ms 94716 KB Output is correct
46 Correct 1628 ms 94584 KB Output is correct
47 Correct 1640 ms 94796 KB Output is correct
48 Correct 1626 ms 94668 KB Output is correct
49 Correct 1639 ms 94584 KB Output is correct
50 Correct 1627 ms 94580 KB Output is correct
51 Correct 1648 ms 94588 KB Output is correct
52 Correct 1619 ms 94728 KB Output is correct
53 Correct 1641 ms 94712 KB Output is correct
54 Correct 1611 ms 94580 KB Output is correct
55 Correct 1667 ms 94560 KB Output is correct
56 Correct 1661 ms 94884 KB Output is correct
57 Correct 1665 ms 94716 KB Output is correct
58 Correct 1674 ms 94584 KB Output is correct
59 Correct 1660 ms 94632 KB Output is correct
60 Correct 1676 ms 94584 KB Output is correct
61 Correct 1672 ms 94584 KB Output is correct
62 Correct 1658 ms 94580 KB Output is correct
63 Correct 1674 ms 94712 KB Output is correct
64 Correct 1670 ms 94584 KB Output is correct
65 Correct 1676 ms 94712 KB Output is correct
66 Correct 1681 ms 94584 KB Output is correct
67 Correct 1667 ms 94732 KB Output is correct
68 Correct 1662 ms 94584 KB Output is correct
69 Correct 1678 ms 94584 KB Output is correct
70 Correct 1706 ms 94740 KB Output is correct
71 Correct 1707 ms 94840 KB Output is correct
72 Correct 1677 ms 94588 KB Output is correct
73 Correct 1702 ms 94640 KB Output is correct
74 Correct 1672 ms 94644 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -