oj.uz

Submission #713834

# Submission time Handle Problem Language Result Execution time Memory
713834 2023-03-23T05:58:19 Z becaido Team Contest (JOI22_team) C++17
37 / 100
 1432 ms 63232 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';
}

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;
    }


}

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 5 ms 1908 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 3 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 5 ms 1908 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 3 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 1432 ms 63064 KB Output is correct
27 Correct 912 ms 62852 KB Output is correct
28 Correct 747 ms 63216 KB Output is correct
29 Correct 406 ms 62900 KB Output is correct
30 Correct 317 ms 39076 KB Output is correct
31 Correct 639 ms 63232 KB Output is correct
32 Correct 416 ms 63148 KB Output is correct
33 Correct 120 ms 60492 KB Output is correct
34 Correct 43 ms 63136 KB Output is correct
35 Correct 5 ms 7124 KB Output is correct
36 Correct 5 ms 7124 KB Output is correct
37 Correct 40 ms 63064 KB Output is correct
38 Correct 41 ms 63176 KB Output is correct
39 Correct 59 ms 24072 KB Output is correct

Subtask #3
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 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 36 ms 2016 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
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 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 36 ms 2016 KB Output isn't correct
12 Halted 0 ms 0 KB -

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 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 36 ms 2016 KB Output isn't correct
12 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 0 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 36 ms 2016 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 5 ms 1908 KB Output is correct
15 Correct 3 ms 1492 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 3 ms 1748 KB Output is correct
19 Correct 3 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 2 ms 1876 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 1432 ms 63064 KB Output is correct
27 Correct 912 ms 62852 KB Output is correct
28 Correct 747 ms 63216 KB Output is correct
29 Correct 406 ms 62900 KB Output is correct
30 Correct 317 ms 39076 KB Output is correct
31 Correct 639 ms 63232 KB Output is correct
32 Correct 416 ms 63148 KB Output is correct
33 Correct 120 ms 60492 KB Output is correct
34 Correct 43 ms 63136 KB Output is correct
35 Correct 5 ms 7124 KB Output is correct
36 Correct 5 ms 7124 KB Output is correct
37 Correct 40 ms 63064 KB Output is correct
38 Correct 41 ms 63176 KB Output is correct
39 Correct 59 ms 24072 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Incorrect 36 ms 2016 KB Output isn't correct
51 Halted 0 ms 0 KB -