oj.uz

Submission #883092

# Submission time Handle Problem Language Result Execution time Memory
883092 2023-12-04T13:52:34 Z LucaIlie Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 209632 KB 
#include <bits/stdc++.h>

using namespace std;

struct abc {
    int a, b, c, bestB, bestC;
};

const int MAX_N = 2e5;
const int INF = 1e8;
abc v[MAX_N];

struct AIB {
    unordered_map<int, int> aib;

    void init() {
        aib.clear();
    }

    void update( int i, int x ) {
        while ( i <= MAX_N ) {
            aib[i] = max( aib[i], x );
            i += (i & -i);
        }
    }

    int query( int i ) {
        int ans = 0;
        while ( i > 0 ) {
            ans = max( ans, aib[i] );
            i -= (i & -i);
        }
        return (ans == 0 ? -INF : ans);
    }
} aib;

struct AIB2d {
    AIB aib[MAX_N + 1];

    void init() {
        for ( int i = 0; i <= MAX_N; i++ )
            aib[i].aib.clear();
    }

    void update( int i, int j, int x ) {
        while ( i <= MAX_N ) {
            aib[i].update( j, x );
            i += (i & -i);
        }
    }

    int query( int i, int j ) {
        int ans = 0;
        while ( i > 0 ) {
            ans = max( ans, aib[i].query( j ) );
            i -= (i & -i);
        }
        return (ans == 0 ? -INF : ans);
    }

    void updateInv( int i, int j, int x ) {
        update( MAX_N + 1 - i, MAX_N + 1 - j, x );
    }

    int queryInv( int i, int j ) {
        return query( MAX_N + 1 - i, MAX_N + 1 - j );
    }
} aib2d;

map<int, int> normA, normB, normC;
int main() {
    int n;

    cin >> n;
    for ( int i = 0; i < n; i++ )
        cin >> v[i].a >> v[i].b >> v[i].c;

    for ( int i = 0; i < n; i++ ) {
        normA[v[i].a] = 1;
        normB[v[i].b] = 1;
        normC[v[i].c] = 1;
    }

    int x;
    x = 0;
    for ( auto p: normA )
        normA[p.first] = ++x;
    x = 0;
    for ( auto p: normB )
        normB[p.first] = ++x;
    x = 0;
    for ( auto p: normC )
        normC[p.first] = ++x;

    sort( v, v + n, []( abc a, abc b ) {
        if ( a.a == b.a )
            return a.b < b.b;
        return a.a < b.a;
    } );
    aib.init();
    for ( int i = 0; i < n; i++ ) {
        v[i].bestC = aib.query( normB[v[i].b] - 1 );
        aib.update( normB[v[i].b], v[i].c );
    }
    sort( v, v + n, []( abc a, abc b ) {
        if ( a.a == b.a )
            return a.c < b.c;
        return a.a < b.a;
    } );
    aib.init();
    for ( int i = 0; i < n; i++ ) {
        v[i].bestB = aib.query( normC[v[i].c] - 1 );
        aib.update( normC[v[i].c], v[i].b );
    }

    int ans = -1;
    int l = 0, r = 0;
    aib2d.init();
    while ( l < n ) {
        r = l;
        while ( r < n && v[l].a == v[r].a )
            r++;
        for ( int i = l; i < r; i++ )
            ans = max( ans, v[i].a + aib2d.queryInv( normB[v[i].b] + 1, normC[v[i].c] + 1 ) );
        for ( int i = l; i < r; i++ ) {
            if ( v[i].bestC > v[i].c )
                aib2d.updateInv( normB[v[i].b], normC[v[i].bestC], v[i].b + v[i].bestC );
            if ( v[i].bestB > v[i].b )
                aib2d.updateInv( normB[v[i].bestB], normC[v[i].c], v[i].bestB + v[i].c );
        }
        l = r;
    }

    cout << ans;

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 4 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12916 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 4 ms 12892 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 4 ms 12916 KB Output is correct
14 Correct 5 ms 13148 KB Output is correct
15 Correct 4 ms 12892 KB Output is correct
16 Correct 6 ms 13148 KB Output is correct
17 Correct 5 ms 12892 KB Output is correct
18 Correct 5 ms 12912 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 4 ms 12892 KB Output is correct
22 Correct 4 ms 13148 KB Output is correct
23 Correct 5 ms 13148 KB Output is correct
24 Correct 4 ms 12892 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 4 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12916 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 4 ms 12892 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 4 ms 12916 KB Output is correct
14 Correct 5 ms 13148 KB Output is correct
15 Correct 4 ms 12892 KB Output is correct
16 Correct 6 ms 13148 KB Output is correct
17 Correct 5 ms 12892 KB Output is correct
18 Correct 5 ms 12912 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 4 ms 12892 KB Output is correct
22 Correct 4 ms 13148 KB Output is correct
23 Correct 5 ms 13148 KB Output is correct
24 Correct 4 ms 12892 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 42 ms 21144 KB Output is correct
27 Correct 31 ms 17756 KB Output is correct
28 Correct 35 ms 17492 KB Output is correct
29 Correct 21 ms 16084 KB Output is correct
30 Correct 18 ms 15708 KB Output is correct
31 Correct 26 ms 15836 KB Output is correct
32 Correct 14 ms 13660 KB Output is correct
33 Correct 13 ms 13704 KB Output is correct
34 Correct 20 ms 16468 KB Output is correct
35 Correct 5 ms 13144 KB Output is correct
36 Correct 5 ms 13144 KB Output is correct
37 Correct 12 ms 13916 KB Output is correct
38 Correct 12 ms 13952 KB Output is correct
39 Correct 8 ms 12928 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12920 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12724 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 4 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 263 ms 14972 KB Output is correct
12 Correct 173 ms 14956 KB Output is correct
13 Correct 221 ms 14944 KB Output is correct
14 Correct 253 ms 14932 KB Output is correct
15 Correct 240 ms 14944 KB Output is correct
16 Correct 269 ms 14932 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12920 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12724 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 4 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 263 ms 14972 KB Output is correct
12 Correct 173 ms 14956 KB Output is correct
13 Correct 221 ms 14944 KB Output is correct
14 Correct 253 ms 14932 KB Output is correct
15 Correct 240 ms 14944 KB Output is correct
16 Correct 269 ms 14932 KB Output is correct
17 Correct 4 ms 12888 KB Output is correct
18 Correct 4 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 10 ms 12892 KB Output is correct
22 Correct 311 ms 16068 KB Output is correct
23 Correct 287 ms 15824 KB Output is correct
24 Correct 226 ms 15756 KB Output is correct
25 Correct 265 ms 15964 KB Output is correct
26 Correct 239 ms 15944 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12920 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12724 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 4 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 263 ms 14972 KB Output is correct
12 Correct 173 ms 14956 KB Output is correct
13 Correct 221 ms 14944 KB Output is correct
14 Correct 253 ms 14932 KB Output is correct
15 Correct 240 ms 14944 KB Output is correct
16 Correct 269 ms 14932 KB Output is correct
17 Correct 4 ms 12888 KB Output is correct
18 Correct 4 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 10 ms 12892 KB Output is correct
22 Correct 311 ms 16068 KB Output is correct
23 Correct 287 ms 15824 KB Output is correct
24 Correct 226 ms 15756 KB Output is correct
25 Correct 265 ms 15964 KB Output is correct
26 Correct 239 ms 15944 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 4 ms 12892 KB Output is correct
29 Correct 4 ms 12892 KB Output is correct
30 Correct 4 ms 12916 KB Output is correct
31 Correct 14 ms 13656 KB Output is correct
32 Correct 6 ms 13148 KB Output is correct
33 Correct 6 ms 13148 KB Output is correct
34 Correct 441 ms 20572 KB Output is correct
35 Correct 336 ms 20000 KB Output is correct
36 Correct 346 ms 19604 KB Output is correct
37 Correct 301 ms 19260 KB Output is correct
38 Correct 235 ms 16596 KB Output is correct
39 Correct 230 ms 20208 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 3 ms 12892 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 3 ms 12920 KB Output is correct
5 Correct 3 ms 12888 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12724 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 4 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 263 ms 14972 KB Output is correct
12 Correct 173 ms 14956 KB Output is correct
13 Correct 221 ms 14944 KB Output is correct
14 Correct 253 ms 14932 KB Output is correct
15 Correct 240 ms 14944 KB Output is correct
16 Correct 269 ms 14932 KB Output is correct
17 Correct 4 ms 12888 KB Output is correct
18 Correct 4 ms 12892 KB Output is correct
19 Correct 3 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 10 ms 12892 KB Output is correct
22 Correct 311 ms 16068 KB Output is correct
23 Correct 287 ms 15824 KB Output is correct
24 Correct 226 ms 15756 KB Output is correct
25 Correct 265 ms 15964 KB Output is correct
26 Correct 239 ms 15944 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 4 ms 12892 KB Output is correct
29 Correct 4 ms 12892 KB Output is correct
30 Correct 4 ms 12916 KB Output is correct
31 Correct 14 ms 13656 KB Output is correct
32 Correct 6 ms 13148 KB Output is correct
33 Correct 6 ms 13148 KB Output is correct
34 Correct 441 ms 20572 KB Output is correct
35 Correct 336 ms 20000 KB Output is correct
36 Correct 346 ms 19604 KB Output is correct
37 Correct 301 ms 19260 KB Output is correct
38 Correct 235 ms 16596 KB Output is correct
39 Correct 230 ms 20208 KB Output is correct
40 Correct 18 ms 15708 KB Output is correct
41 Correct 25 ms 15964 KB Output is correct
42 Correct 13 ms 13916 KB Output is correct
43 Correct 12 ms 13916 KB Output is correct
44 Correct 1771 ms 84060 KB Output is correct
45 Correct 804 ms 75092 KB Output is correct
46 Correct 902 ms 79236 KB Output is correct
47 Correct 812 ms 74576 KB Output is correct
48 Correct 305 ms 19560 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12888 KB Output is correct
2 Correct 4 ms 12888 KB Output is correct
3 Correct 4 ms 12892 KB Output is correct
4 Correct 4 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 4 ms 12916 KB Output is correct
8 Correct 3 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 3 ms 12892 KB Output is correct
11 Correct 4 ms 12892 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 4 ms 12916 KB Output is correct
14 Correct 5 ms 13148 KB Output is correct
15 Correct 4 ms 12892 KB Output is correct
16 Correct 6 ms 13148 KB Output is correct
17 Correct 5 ms 12892 KB Output is correct
18 Correct 5 ms 12912 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 4 ms 12892 KB Output is correct
21 Correct 4 ms 12892 KB Output is correct
22 Correct 4 ms 13148 KB Output is correct
23 Correct 5 ms 13148 KB Output is correct
24 Correct 4 ms 12892 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 42 ms 21144 KB Output is correct
27 Correct 31 ms 17756 KB Output is correct
28 Correct 35 ms 17492 KB Output is correct
29 Correct 21 ms 16084 KB Output is correct
30 Correct 18 ms 15708 KB Output is correct
31 Correct 26 ms 15836 KB Output is correct
32 Correct 14 ms 13660 KB Output is correct
33 Correct 13 ms 13704 KB Output is correct
34 Correct 20 ms 16468 KB Output is correct
35 Correct 5 ms 13144 KB Output is correct
36 Correct 5 ms 13144 KB Output is correct
37 Correct 12 ms 13916 KB Output is correct
38 Correct 12 ms 13952 KB Output is correct
39 Correct 8 ms 12928 KB Output is correct
40 Correct 3 ms 12892 KB Output is correct
41 Correct 3 ms 12892 KB Output is correct
42 Correct 4 ms 12892 KB Output is correct
43 Correct 3 ms 12920 KB Output is correct
44 Correct 3 ms 12888 KB Output is correct
45 Correct 4 ms 12892 KB Output is correct
46 Correct 4 ms 12724 KB Output is correct
47 Correct 3 ms 12892 KB Output is correct
48 Correct 4 ms 12892 KB Output is correct
49 Correct 3 ms 12892 KB Output is correct
50 Correct 263 ms 14972 KB Output is correct
51 Correct 173 ms 14956 KB Output is correct
52 Correct 221 ms 14944 KB Output is correct
53 Correct 253 ms 14932 KB Output is correct
54 Correct 240 ms 14944 KB Output is correct
55 Correct 269 ms 14932 KB Output is correct
56 Correct 4 ms 12888 KB Output is correct
57 Correct 4 ms 12892 KB Output is correct
58 Correct 3 ms 12892 KB Output is correct
59 Correct 4 ms 12892 KB Output is correct
60 Correct 10 ms 12892 KB Output is correct
61 Correct 311 ms 16068 KB Output is correct
62 Correct 287 ms 15824 KB Output is correct
63 Correct 226 ms 15756 KB Output is correct
64 Correct 265 ms 15964 KB Output is correct
65 Correct 239 ms 15944 KB Output is correct
66 Correct 5 ms 13148 KB Output is correct
67 Correct 4 ms 12892 KB Output is correct
68 Correct 4 ms 12892 KB Output is correct
69 Correct 4 ms 12916 KB Output is correct
70 Correct 14 ms 13656 KB Output is correct
71 Correct 6 ms 13148 KB Output is correct
72 Correct 6 ms 13148 KB Output is correct
73 Correct 441 ms 20572 KB Output is correct
74 Correct 336 ms 20000 KB Output is correct
75 Correct 346 ms 19604 KB Output is correct
76 Correct 301 ms 19260 KB Output is correct
77 Correct 235 ms 16596 KB Output is correct
78 Correct 230 ms 20208 KB Output is correct
79 Correct 18 ms 15708 KB Output is correct
80 Correct 25 ms 15964 KB Output is correct
81 Correct 13 ms 13916 KB Output is correct
82 Correct 12 ms 13916 KB Output is correct
83 Correct 1771 ms 84060 KB Output is correct
84 Correct 804 ms 75092 KB Output is correct
85 Correct 902 ms 79236 KB Output is correct
86 Correct 812 ms 74576 KB Output is correct
87 Correct 305 ms 19560 KB Output is correct
88 Execution timed out 2045 ms 209632 KB Time limit exceeded
89 Halted 0 ms 0 KB -