oj.uz

Submission #228148

# Submission time Handle Problem Language Result Execution time Memory
228148 2020-04-30T05:12:33 Z qkxwsm Bulldozer (JOI17_bulldozer) C++14
25 / 100
 2000 ms 145492 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, vi> > 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, vi> a, pair<pll, vi> 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});
            ve.PB({p, j});
        }
        sort(ALL(ve));
        // cerr << "ok\n";
        int iter = 0;
        pll dir; vi nodes; nodes.PB(i);
        FOR(j, 0, SZ(ve))
        {
            dir = ve[j].fi;
            // cerr << dir.fi << ' ' << dir.se << ' ' << ve[j].se << endl;
            nodes.PB(ve[j].se);
            if (j == N - 2 || ve[j + 1].fi != ve[j].fi)
            {
                events.PB({dir, nodes});
                for (int u : nodes)
                {
                    for (int v : nodes)
                    {
                        mark[u][v] = true;
                    }
                }
                nodes.clear();
                nodes.PB(i);
            }
        }
    }
    build(1, 0, N - 1);
    ckmax(ans, seg[1][0][0]);
    // cerr << "return " << seg[1][0][0] << endl;
    sort(ALL(events), cmp2);
    // cerr << "alive\n";
    FOR(i, 0, SZ(events))
    {
        auto a = events[i];
        // cerr << "size " << SZ(a.se) << endl;
        //reverse everything for a.
        int lt = a.se.front(), rt = a.se.back();
        // cerr << "swap " << lt << ' ' << rt << endl;
        int pl = pos[lt], pr = pos[rt];
        //reverse everything in (pl..pr)
        for (int x : a.se)
        {
            pos[x] = pl + pr - pos[x];
            update(1, 0, N - 1, pos[x], arr[x].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;
}

Compilation message

bulldozer.cpp: In function 'int32_t main()':
bulldozer.cpp:157:13: warning: unused variable 'iter' [-Wunused-variable]
         int iter = 0;
             ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1024 KB Output is correct
2 Correct 13 ms 1024 KB Output is correct
3 Correct 14 ms 1024 KB Output is correct
4 Correct 13 ms 1024 KB Output is correct
5 Correct 13 ms 1024 KB Output is correct
6 Correct 14 ms 1024 KB Output is correct
7 Correct 13 ms 1024 KB Output is correct
8 Correct 13 ms 1024 KB Output is correct
9 Correct 13 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 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 12 ms 1024 KB Output is correct
22 Correct 13 ms 1024 KB Output is correct
23 Correct 13 ms 1024 KB Output is correct
24 Correct 13 ms 1024 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 13 ms 1152 KB Output is correct
27 Correct 13 ms 1024 KB Output is correct
28 Correct 12 ms 1024 KB Output is correct
29 Correct 13 ms 1024 KB Output is correct
30 Correct 12 ms 1152 KB Output is correct
31 Correct 12 ms 1024 KB Output is correct
32 Correct 13 ms 1152 KB Output is correct

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1024 KB Output is correct
2 Correct 13 ms 1024 KB Output is correct
3 Correct 14 ms 1024 KB Output is correct
4 Correct 13 ms 1024 KB Output is correct
5 Correct 13 ms 1024 KB Output is correct
6 Correct 14 ms 1024 KB Output is correct
7 Correct 13 ms 1024 KB Output is correct
8 Correct 13 ms 1024 KB Output is correct
9 Correct 13 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 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 12 ms 1024 KB Output is correct
22 Correct 13 ms 1024 KB Output is correct
23 Correct 13 ms 1024 KB Output is correct
24 Correct 13 ms 1024 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 13 ms 1152 KB Output is correct
27 Correct 13 ms 1024 KB Output is correct
28 Correct 12 ms 1024 KB Output is correct
29 Correct 13 ms 1024 KB Output is correct
30 Correct 12 ms 1152 KB Output is correct
31 Correct 12 ms 1024 KB Output is correct
32 Correct 13 ms 1152 KB Output is correct
33 Execution timed out 2094 ms 145492 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1024 KB Output is correct
2 Correct 13 ms 1024 KB Output is correct
3 Correct 14 ms 1024 KB Output is correct
4 Correct 13 ms 1024 KB Output is correct
5 Correct 13 ms 1024 KB Output is correct
6 Correct 14 ms 1024 KB Output is correct
7 Correct 13 ms 1024 KB Output is correct
8 Correct 13 ms 1024 KB Output is correct
9 Correct 13 ms 1024 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 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 12 ms 1024 KB Output is correct
22 Correct 13 ms 1024 KB Output is correct
23 Correct 13 ms 1024 KB Output is correct
24 Correct 13 ms 1024 KB Output is correct
25 Correct 12 ms 1024 KB Output is correct
26 Correct 13 ms 1152 KB Output is correct
27 Correct 13 ms 1024 KB Output is correct
28 Correct 12 ms 1024 KB Output is correct
29 Correct 13 ms 1024 KB Output is correct
30 Correct 12 ms 1152 KB Output is correct
31 Correct 12 ms 1024 KB Output is correct
32 Correct 13 ms 1152 KB Output is correct
33 Execution timed out 2094 ms 145492 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 13 ms 1024 KB Output is correct
17 Correct 13 ms 1024 KB Output is correct
18 Correct 14 ms 1024 KB Output is correct
19 Correct 13 ms 1024 KB Output is correct
20 Correct 13 ms 1024 KB Output is correct
21 Correct 14 ms 1024 KB Output is correct
22 Correct 13 ms 1024 KB Output is correct
23 Correct 13 ms 1024 KB Output is correct
24 Correct 13 ms 1024 KB Output is correct
25 Correct 13 ms 1024 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 12 ms 1024 KB Output is correct
37 Correct 13 ms 1024 KB Output is correct
38 Correct 13 ms 1024 KB Output is correct
39 Correct 13 ms 1024 KB Output is correct
40 Correct 12 ms 1024 KB Output is correct
41 Correct 13 ms 1152 KB Output is correct
42 Correct 13 ms 1024 KB Output is correct
43 Correct 12 ms 1024 KB Output is correct
44 Correct 13 ms 1024 KB Output is correct
45 Correct 12 ms 1152 KB Output is correct
46 Correct 12 ms 1024 KB Output is correct
47 Correct 13 ms 1152 KB Output is correct
48 Execution timed out 2094 ms 145492 KB Time limit exceeded
49 Halted 0 ms 0 KB -