oj.uz

답안 #713868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713868 2023-03-23T06:32:17 Z becaido Team Contest (JOI22_team) C++17
37 / 100
 1462 ms 63212 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]);
            mn[i][j] = min(mn[i][j], mn[i - 1][j]);
        }
        if (j) {
            dp[i][j] = max(dp[i][j], dp[i][j - 1]);
            mn[i][j] = min(mn[i][j], mn[i][j - 1]);
        }
    }
    // X2<X1, Y1<Y2
    FOR (X1, 1, mx) FOR (Y2, 1, my) {
        int val = dp[X1 - 1][Y2 - 1];
        if (val > max(mn[X1][Y2 - 1], mn[X1 - 1][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

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 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 3 ms 1876 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 4 ms 1780 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 1876 KB Output is correct
24 Correct 1 ms 1876 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 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 3 ms 1876 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 4 ms 1780 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 1876 KB Output is correct
24 Correct 1 ms 1876 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 1462 ms 63204 KB Output is correct
27 Correct 888 ms 62744 KB Output is correct
28 Correct 676 ms 63120 KB Output is correct
29 Correct 428 ms 62924 KB Output is correct
30 Correct 307 ms 38972 KB Output is correct
31 Correct 627 ms 63212 KB Output is correct
32 Correct 390 ms 63080 KB Output is correct
33 Correct 121 ms 60292 KB Output is correct
34 Correct 44 ms 63024 KB Output is correct
35 Correct 5 ms 6996 KB Output is correct
36 Correct 4 ms 7124 KB Output is correct
37 Correct 41 ms 63116 KB Output is correct
38 Correct 41 ms 63060 KB Output is correct
39 Correct 51 ms 23952 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 42 ms 2140 KB Output is correct
12 Incorrect 27 ms 1532 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 42 ms 2140 KB Output is correct
12 Incorrect 27 ms 1532 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 42 ms 2140 KB Output is correct
12 Incorrect 27 ms 1532 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 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 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 42 ms 2140 KB Output is correct
12 Incorrect 27 ms 1532 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 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 3 ms 1876 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 4 ms 1780 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 1876 KB Output is correct
24 Correct 1 ms 1876 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 1462 ms 63204 KB Output is correct
27 Correct 888 ms 62744 KB Output is correct
28 Correct 676 ms 63120 KB Output is correct
29 Correct 428 ms 62924 KB Output is correct
30 Correct 307 ms 38972 KB Output is correct
31 Correct 627 ms 63212 KB Output is correct
32 Correct 390 ms 63080 KB Output is correct
33 Correct 121 ms 60292 KB Output is correct
34 Correct 44 ms 63024 KB Output is correct
35 Correct 5 ms 6996 KB Output is correct
36 Correct 4 ms 7124 KB Output is correct
37 Correct 41 ms 63116 KB Output is correct
38 Correct 41 ms 63060 KB Output is correct
39 Correct 51 ms 23952 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 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 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 42 ms 2140 KB Output is correct
51 Incorrect 27 ms 1532 KB Output isn't correct
52 Halted 0 ms 0 KB -