oj.uz

Submission #713857

# Submission time Handle Problem Language Result Execution time Memory
713857 2023-03-23T06:24:11 Z becaido Team Contest (JOI22_team) C++17
55 / 100
 2000 ms 63276 KB 
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

// want O(C + n(log))

const int SIZE = 1.5e5 + 5;

int n, ans = -1;
array<int, 3> a[SIZE];

struct LIS {
    vector<int> lis;
    void add(int x) {
        lis.pb(x);
    }
    void work() {
        sort(lis.begin(), lis.end());
        lis.erase(unique(lis.begin(), lis.end()), lis.end());
    }
    int id(int x) {
        return lower_bound(lis.begin(), lis.end(), x) - lis.begin() + 1;
    }
};

LIS lx, ly;
int bit[4005][4005];
void upd(int px, int py, int x) {
    for (; px <= n; px += px & -px) {
        for (int pos = py; pos <= n; pos += pos & -pos) {
            bit[px][pos] = max(bit[px][pos], x);
        }
    }
}
int que(int px, int py) {
    int re = 0;
    for (; px; px -= px & -px) {
        for (int pos = py; pos; pos -= pos & -pos) {
            re = max(re, bit[px][pos]);
        }
    }
    return re;
}
void small() {
    FOR (i, 1, n) lx.add(a[i][0]), ly.add(a[i][1]);
    lx.work(), ly.work();
    FOR (i, 1, n) {
        FOR (j, i + 1, n) if (a[j][0] > a[i][0] && a[i][1] > a[j][1]) {
            int val = que(lx.id(a[j][0]) - 1, ly.id(a[i][1]) - 1);
            if (val > max(a[i][2], a[j][2])) ans = max(ans, a[j][0] + a[i][1] + val);
        }
        upd(lx.id(a[i][0]), ly.id(a[i][1]), a[i][2]);
    }

    lx.lis.clear(), ly.lis.clear();
    FOR (i, 1, n) {
        swap(a[i][1], a[i][2]);
        fill(bit[i], bit[i] + n + 1, 0);
    }

    FOR (i, 1, n) lx.add(a[i][0]), ly.add(a[i][1]);
    lx.work(), ly.work();
    FOR (i, 1, n) {
        FOR (j, i + 1, n) if (a[j][0] > a[i][0] && a[i][1] > a[j][1]) {
            int val = que(lx.id(a[j][0]) - 1, ly.id(a[i][1]) - 1);
            if (val > max(a[i][2], a[j][2])) ans = max(ans, a[j][0] + a[i][1] + val);
        }
        upd(lx.id(a[i][0]), ly.id(a[i][1]), a[i][2]);
    }

    cout << ans << '\n';
}

int mn[4005][4005], dp[4005][4005];
int mx, my;
void C_small() {
    FOR (i, 1, n) {
        mx = max(mx, a[i][0]);
        my = max(my, a[i][1]);
    }
    FOR (i, 0, mx) FOR (j, 0, my) mn[i][j] = INT_MAX;
    FOR (i, 1, n) {
        mn[a[i][0]][a[i][1]] = min(mn[a[i][0]][a[i][1]], a[i][2]);
        dp[a[i][0]][a[i][1]] = max(dp[a[i][0]][a[i][1]], a[i][2]);
    }
    FOR (i, 0, mx) FOR (j, 0, my) {
        if (i) dp[i][j] = max(dp[i][j], dp[i - 1][j]);
        if (j) dp[i][j] = max(dp[i][j], dp[i][j - 1]);
    }
    FOR (X1, 1, mx) FOR (Y1, 1, my) if (mn[X1][Y1] != INT_MAX) {
        FOR (X2, 1, X1 - 1) FOR (Y2, Y1 + 1, my) if (mn[X2][Y2] != INT_MAX) {
            int val = dp[X1 - 1][Y2 - 1];
            if (val > max(mn[X1][Y1], mn[X2][Y2])) ans = max(ans, X1 + Y2 + val);
        }
    }
    cout << ans << '\n';
}

void solve() {
    cin >> n;
    FOR (i, 1, n) FOR (j, 0, 2) cin >> a[i][j];
    sort(a + 1, a + n + 1);

    if (n <= 4000) {
        small();
        return;
    }

    C_small();
}

int main() {
    Waimai;
    solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 332 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 6 ms 1876 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 4 ms 1620 KB Output is correct
17 Correct 4 ms 1876 KB Output is correct
18 Correct 5 ms 1740 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1872 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 332 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 6 ms 1876 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 4 ms 1620 KB Output is correct
17 Correct 4 ms 1876 KB Output is correct
18 Correct 5 ms 1740 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1872 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 1441 ms 63180 KB Output is correct
27 Correct 900 ms 62836 KB Output is correct
28 Correct 767 ms 63252 KB Output is correct
29 Correct 421 ms 62920 KB Output is correct
30 Correct 296 ms 38932 KB Output is correct
31 Correct 609 ms 63060 KB Output is correct
32 Correct 394 ms 63144 KB Output is correct
33 Correct 134 ms 60364 KB Output is correct
34 Correct 50 ms 63260 KB Output is correct
35 Correct 5 ms 7124 KB Output is correct
36 Correct 5 ms 7124 KB Output is correct
37 Correct 39 ms 63132 KB Output is correct
38 Correct 39 ms 63276 KB Output is correct
39 Correct 54 ms 24060 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 37 ms 2080 KB Output is correct
12 Correct 27 ms 2088 KB Output is correct
13 Correct 30 ms 2504 KB Output is correct
14 Correct 36 ms 2952 KB Output is correct
15 Correct 34 ms 2900 KB Output is correct
16 Correct 30 ms 2960 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 37 ms 2080 KB Output is correct
12 Correct 27 ms 2088 KB Output is correct
13 Correct 30 ms 2504 KB Output is correct
14 Correct 36 ms 2952 KB Output is correct
15 Correct 34 ms 2900 KB Output is correct
16 Correct 30 ms 2960 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 2 ms 1876 KB Output is correct
21 Correct 52 ms 24016 KB Output is correct
22 Correct 47 ms 3324 KB Output is correct
23 Correct 40 ms 3084 KB Output is correct
24 Correct 42 ms 2460 KB Output is correct
25 Correct 48 ms 3404 KB Output is correct
26 Correct 35 ms 3072 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 37 ms 2080 KB Output is correct
12 Correct 27 ms 2088 KB Output is correct
13 Correct 30 ms 2504 KB Output is correct
14 Correct 36 ms 2952 KB Output is correct
15 Correct 34 ms 2900 KB Output is correct
16 Correct 30 ms 2960 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 2 ms 1876 KB Output is correct
21 Correct 52 ms 24016 KB Output is correct
22 Correct 47 ms 3324 KB Output is correct
23 Correct 40 ms 3084 KB Output is correct
24 Correct 42 ms 2460 KB Output is correct
25 Correct 48 ms 3404 KB Output is correct
26 Correct 35 ms 3072 KB Output is correct
27 Correct 4 ms 1748 KB Output is correct
28 Correct 5 ms 1876 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 407 ms 63168 KB Output is correct
32 Correct 4 ms 7124 KB Output is correct
33 Correct 5 ms 7124 KB Output is correct
34 Execution timed out 2074 ms 6560 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 37 ms 2080 KB Output is correct
12 Correct 27 ms 2088 KB Output is correct
13 Correct 30 ms 2504 KB Output is correct
14 Correct 36 ms 2952 KB Output is correct
15 Correct 34 ms 2900 KB Output is correct
16 Correct 30 ms 2960 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 2 ms 1876 KB Output is correct
21 Correct 52 ms 24016 KB Output is correct
22 Correct 47 ms 3324 KB Output is correct
23 Correct 40 ms 3084 KB Output is correct
24 Correct 42 ms 2460 KB Output is correct
25 Correct 48 ms 3404 KB Output is correct
26 Correct 35 ms 3072 KB Output is correct
27 Correct 4 ms 1748 KB Output is correct
28 Correct 5 ms 1876 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 407 ms 63168 KB Output is correct
32 Correct 4 ms 7124 KB Output is correct
33 Correct 5 ms 7124 KB Output is correct
34 Execution timed out 2074 ms 6560 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 332 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 6 ms 1876 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 4 ms 1620 KB Output is correct
17 Correct 4 ms 1876 KB Output is correct
18 Correct 5 ms 1740 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 1 ms 1880 KB Output is correct
24 Correct 1 ms 1872 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 1441 ms 63180 KB Output is correct
27 Correct 900 ms 62836 KB Output is correct
28 Correct 767 ms 63252 KB Output is correct
29 Correct 421 ms 62920 KB Output is correct
30 Correct 296 ms 38932 KB Output is correct
31 Correct 609 ms 63060 KB Output is correct
32 Correct 394 ms 63144 KB Output is correct
33 Correct 134 ms 60364 KB Output is correct
34 Correct 50 ms 63260 KB Output is correct
35 Correct 5 ms 7124 KB Output is correct
36 Correct 5 ms 7124 KB Output is correct
37 Correct 39 ms 63132 KB Output is correct
38 Correct 39 ms 63276 KB Output is correct
39 Correct 54 ms 24060 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 37 ms 2080 KB Output is correct
51 Correct 27 ms 2088 KB Output is correct
52 Correct 30 ms 2504 KB Output is correct
53 Correct 36 ms 2952 KB Output is correct
54 Correct 34 ms 2900 KB Output is correct
55 Correct 30 ms 2960 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 2 ms 1876 KB Output is correct
60 Correct 52 ms 24016 KB Output is correct
61 Correct 47 ms 3324 KB Output is correct
62 Correct 40 ms 3084 KB Output is correct
63 Correct 42 ms 2460 KB Output is correct
64 Correct 48 ms 3404 KB Output is correct
65 Correct 35 ms 3072 KB Output is correct
66 Correct 4 ms 1748 KB Output is correct
67 Correct 5 ms 1876 KB Output is correct
68 Correct 2 ms 1876 KB Output is correct
69 Correct 2 ms 1876 KB Output is correct
70 Correct 407 ms 63168 KB Output is correct
71 Correct 4 ms 7124 KB Output is correct
72 Correct 5 ms 7124 KB Output is correct
73 Execution timed out 2074 ms 6560 KB Time limit exceeded
74 Halted 0 ms 0 KB -