oj.uz

답안 #538731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
538731 2022-03-17T15:35:12 Z jesus_coconut Bulldozer (JOI17_bulldozer) C++17
55 / 100
 1860 ms 99332 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define all(a) begin(a), end(a)
#define pb push_back
#define eb emplace_back
using namespace std;

using ll = long long;

using cll = complex<long long>;
using pii = pair<int, int>;

int n;
vector<pair<cll, ll>> v;

ll cross(cll a, cll b) {
    return (conj(a) * b).imag();
}

ll ccw(cll a, cll b, cll c) {
    return cross(b - a, c - b);
}

bool sign(cll a) {
    return a.imag() > 0 || (a.imag() == 0 && a.real() > 0);
}

vector<pair<cll, pair<int, int>>> events;

struct Item {
    ll mxPref = 0, mxSuf = 0, mxSuma = 0, suma = 0;
};

struct SegTree {
    int static const N = (1 << 11);
    array<Item, 2 * N> val;

    Item merg(Item a, Item b) {
        Item ret;
        ret.mxPref = max(a.mxPref, a.suma + b.mxPref);
        ret.mxSuf = max(b.mxSuf, b.suma + a.mxSuf);
        ret.suma = a.suma + b.suma;
        ret.mxSuma = max({a.mxSuma, b.mxSuma, a.mxSuf + b.mxPref});
        return ret;
    }

    void upd(int p, ll elem, int ver, int lx, int rx) {
        if (rx - lx == 1) {
            val[ver].mxPref = val[ver].mxSuf = val[ver].mxSuma = val[ver].suma = elem;
            return;
        }
        int mid = (lx + rx) / 2;
        if (p < mid) upd(p, elem, ver * 2 + 1, lx, mid);
        else upd(p, elem, ver * 2 + 2, mid, rx);
        val[ver] = merg(val[ver * 2 + 1], val[ver * 2 + 2]);
    }

    void upd(int p, ll elem) { upd(p, elem, 0, 0, N); }

    ll query() { return val[0].mxSuma; }
};

void solve() {
    cin >> n;
    v.resize(n);
    for (auto &[p, val] : v) {
        ll a, b;
        cin >> a >> b >> val;
        p.real(a);
        p.imag(b);
    }
    sort(all(v), [](auto const &a, auto const &b) {
        return a.F.real() < b.F.real();
    });
    SegTree st;
    for (int i = 0; i < n; ++i) {
        st.upd(i, v[i].S);
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            events.eb((v[j].F - v[i].F) * cll(0, 1), pii{i, j});
            events.eb((v[j].F - v[i].F) * cll(0, -1), pii{j, i});
        }
    }
    sort(all(events), [](auto const &a, auto const &b) {
        if (sign(a.F) != sign(b.F)) return sign(a.F) > sign(b.F);
        return ccw(cll(0, 0), a.F, b.F) > 0;
    });
    ll res = st.query();
    int pos[n + 10];
    iota(pos, pos + n + 10, 0);
    for (int i = 0; i < size(events); ++i) {
        auto p = events[i].S;
        st.upd(pos[p.F], v[p.S].S);
        st.upd(pos[p.S], v[p.F].S);
        swap(pos[p.F], pos[p.S]);
        if (events[i].F == events[(i+1) % n].F) continue;
        res = max(res, st.query());
    }
    cout << res << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();


    return 0;
}

Compilation message

bulldozer.cpp: In function 'void solve()':
bulldozer.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::complex<long long int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for (int i = 0; i < size(events); ++i) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 916 KB Output is correct
2 Correct 4 ms 892 KB Output is correct
3 Correct 6 ms 916 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 4 ms 916 KB Output is correct
6 Correct 4 ms 916 KB Output is correct
7 Correct 4 ms 916 KB Output is correct
8 Correct 5 ms 916 KB Output is correct
9 Correct 4 ms 892 KB Output is correct
10 Correct 4 ms 892 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 4 ms 916 KB Output is correct
22 Correct 3 ms 916 KB Output is correct
23 Correct 5 ms 916 KB Output is correct
24 Correct 3 ms 916 KB Output is correct
25 Correct 4 ms 916 KB Output is correct
26 Correct 4 ms 896 KB Output is correct
27 Correct 4 ms 916 KB Output is correct
28 Correct 4 ms 896 KB Output is correct
29 Correct 4 ms 916 KB Output is correct
30 Correct 4 ms 916 KB Output is correct
31 Correct 4 ms 916 KB Output is correct
32 Correct 5 ms 916 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 916 KB Output is correct
2 Correct 4 ms 892 KB Output is correct
3 Correct 6 ms 916 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 4 ms 916 KB Output is correct
6 Correct 4 ms 916 KB Output is correct
7 Correct 4 ms 916 KB Output is correct
8 Correct 5 ms 916 KB Output is correct
9 Correct 4 ms 892 KB Output is correct
10 Correct 4 ms 892 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 4 ms 916 KB Output is correct
22 Correct 3 ms 916 KB Output is correct
23 Correct 5 ms 916 KB Output is correct
24 Correct 3 ms 916 KB Output is correct
25 Correct 4 ms 916 KB Output is correct
26 Correct 4 ms 896 KB Output is correct
27 Correct 4 ms 916 KB Output is correct
28 Correct 4 ms 896 KB Output is correct
29 Correct 4 ms 916 KB Output is correct
30 Correct 4 ms 916 KB Output is correct
31 Correct 4 ms 916 KB Output is correct
32 Correct 5 ms 916 KB Output is correct
33 Correct 1656 ms 99080 KB Output is correct
34 Correct 1719 ms 99332 KB Output is correct
35 Correct 1631 ms 99136 KB Output is correct
36 Correct 1672 ms 99056 KB Output is correct
37 Correct 1655 ms 99148 KB Output is correct
38 Correct 1715 ms 99176 KB Output is correct
39 Correct 1748 ms 99148 KB Output is correct
40 Correct 1860 ms 99080 KB Output is correct
41 Correct 1771 ms 99080 KB Output is correct
42 Correct 1786 ms 99080 KB Output is correct
43 Correct 1717 ms 99148 KB Output is correct
44 Correct 1740 ms 99144 KB Output is correct
45 Correct 1730 ms 99124 KB Output is correct
46 Correct 1680 ms 99148 KB Output is correct
47 Correct 1606 ms 99240 KB Output is correct
48 Correct 1695 ms 99108 KB Output is correct
49 Correct 1612 ms 99132 KB Output is correct
50 Correct 1630 ms 99180 KB Output is correct
51 Correct 1589 ms 99136 KB Output is correct
52 Correct 1657 ms 99144 KB Output is correct
53 Correct 1689 ms 99148 KB Output is correct
54 Correct 1639 ms 99316 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 916 KB Output is correct
2 Correct 4 ms 892 KB Output is correct
3 Correct 6 ms 916 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 4 ms 916 KB Output is correct
6 Correct 4 ms 916 KB Output is correct
7 Correct 4 ms 916 KB Output is correct
8 Correct 5 ms 916 KB Output is correct
9 Correct 4 ms 892 KB Output is correct
10 Correct 4 ms 892 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 4 ms 916 KB Output is correct
22 Correct 3 ms 916 KB Output is correct
23 Correct 5 ms 916 KB Output is correct
24 Correct 3 ms 916 KB Output is correct
25 Correct 4 ms 916 KB Output is correct
26 Correct 4 ms 896 KB Output is correct
27 Correct 4 ms 916 KB Output is correct
28 Correct 4 ms 896 KB Output is correct
29 Correct 4 ms 916 KB Output is correct
30 Correct 4 ms 916 KB Output is correct
31 Correct 4 ms 916 KB Output is correct
32 Correct 5 ms 916 KB Output is correct
33 Correct 1656 ms 99080 KB Output is correct
34 Correct 1719 ms 99332 KB Output is correct
35 Correct 1631 ms 99136 KB Output is correct
36 Correct 1672 ms 99056 KB Output is correct
37 Correct 1655 ms 99148 KB Output is correct
38 Correct 1715 ms 99176 KB Output is correct
39 Correct 1748 ms 99148 KB Output is correct
40 Correct 1860 ms 99080 KB Output is correct
41 Correct 1771 ms 99080 KB Output is correct
42 Correct 1786 ms 99080 KB Output is correct
43 Correct 1717 ms 99148 KB Output is correct
44 Correct 1740 ms 99144 KB Output is correct
45 Correct 1730 ms 99124 KB Output is correct
46 Correct 1680 ms 99148 KB Output is correct
47 Correct 1606 ms 99240 KB Output is correct
48 Correct 1695 ms 99108 KB Output is correct
49 Correct 1612 ms 99132 KB Output is correct
50 Correct 1630 ms 99180 KB Output is correct
51 Correct 1589 ms 99136 KB Output is correct
52 Correct 1657 ms 99144 KB Output is correct
53 Correct 1689 ms 99148 KB Output is correct
54 Correct 1639 ms 99316 KB Output is correct
55 Correct 1603 ms 99152 KB Output is correct
56 Correct 1610 ms 99152 KB Output is correct
57 Correct 1691 ms 99104 KB Output is correct
58 Correct 1672 ms 99088 KB Output is correct
59 Correct 1668 ms 99280 KB Output is correct
60 Correct 1636 ms 99164 KB Output is correct
61 Correct 1621 ms 99080 KB Output is correct
62 Correct 1642 ms 99148 KB Output is correct
63 Correct 1574 ms 99268 KB Output is correct
64 Correct 1630 ms 99112 KB Output is correct
65 Incorrect 1591 ms 99148 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 916 KB Output isn't correct
2 Halted 0 ms 0 KB -