oj.uz

Submission #1054954

# Submission time Handle Problem Language Result Execution time Memory
1054954 2024-08-12T13:18:46 Z j_vdd16 Team Contest (JOI22_team) C++17
55 / 100
 2000 ms 17216 KB 
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;


int getMax(int* data, int size) {
    bool isSame = false;
    int best = 0;
    for (int i = 1; i < size; i++) {
        if (data[i] > data[best]) {
            best = i;
            isSame = false;
        }
        else if (data[i] == data[best])
            isSame = true;
    }

    if (isSame) return -1;

    return best;
}

struct Beaver {
    int x = 0, y = 0, z = 0;

    bool operator<(const Beaver& b) const {
        return x > b.x || (x == b.x && y > b.y) || (x == b.x && y == b.y && z > b.z);
    }
    bool operator==(const Beaver& b) const {
        return x == b.x && y == b.y && z == b.z;
    }
};

bool compX(const Beaver& a, const Beaver& b) {
    return a.x > b.x;
}
bool compY(const Beaver& a, const Beaver& b) {
    return a.y > b.y || (a.y == b.y && a.z > b.z);
}

signed main() {
    int n;
    cin >> n;

    set<Beaver> beaverSet;
    vector<Beaver> beavers;
    loop(i, n) {
        int x, y, z;
        cin >> x >> y >> z;

        beaverSet.insert(Beaver{x, y, z});
    }

    for (auto beaver : beaverSet) beavers.push_back(beaver);
    n = (int)beavers.size();

    int bestScore = -1;
    int jStart = n - 1;
    for (int i = n - 1; i >= 0; i--) {
        const Beaver& beaver1 = beavers[i];

        jStart = min(jStart, n - 1);
        while (jStart >= i && beavers[jStart].x < beavers[i].x) 
            jStart--;

        jStart++;
        if (jStart >= n) continue;

        set<ii, greater<ii>> beaversLeftList;
        for (int j = jStart; j < n; j++)
            beaversLeftList.insert({ beavers[j].y, beavers[j].z });
 
        vii beaversLeft;
        for (auto x : beaversLeftList) {
            beaversLeft.push_back(x);
        }
        int m = (int)beaversLeft.size();
 
        vi sufMaxZ(m + 1);
        for (int j = m - 1; j >= 0; j--)
            sufMaxZ[j] = max(sufMaxZ[j + 1], beaversLeft[j].second);
       
        int kStart = 1;
        for (int j = 0; j < m; j++) {
            if (beaversLeft[j].first <= beaver1.y) continue;
 
            while (kStart < m && beaversLeft[j].first <= beaversLeft[kStart].first) 
                kStart++;

            if (kStart == m) break;
            if (sufMaxZ[kStart] <= beaversLeft[j].second || sufMaxZ[kStart] <= beaver1.z) continue;
 
            int score = beaver1.x + beaversLeft[j].first + sufMaxZ[kStart];
            bestScore = max(score, bestScore);
        }
    }

    std::cout << bestScore << endl;

    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 787 ms 1188 KB Output is correct
27 Correct 810 ms 1212 KB Output is correct
28 Correct 822 ms 1108 KB Output is correct
29 Correct 746 ms 1104 KB Output is correct
30 Correct 318 ms 776 KB Output is correct
31 Correct 797 ms 1120 KB Output is correct
32 Correct 462 ms 860 KB Output is correct
33 Correct 8 ms 600 KB Output is correct
34 Correct 412 ms 1108 KB Output is correct
35 Correct 17 ms 604 KB Output is correct
36 Correct 17 ms 348 KB Output is correct
37 Correct 398 ms 860 KB Output is correct
38 Correct 400 ms 860 KB Output is correct
39 Correct 39 ms 604 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 38 ms 348 KB Output is correct
12 Correct 23 ms 348 KB Output is correct
13 Correct 26 ms 348 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 31 ms 348 KB Output is correct
16 Correct 30 ms 348 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 38 ms 348 KB Output is correct
12 Correct 23 ms 348 KB Output is correct
13 Correct 26 ms 348 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 31 ms 348 KB Output is correct
16 Correct 30 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 612 KB Output is correct
22 Correct 596 ms 1236 KB Output is correct
23 Correct 59 ms 604 KB Output is correct
24 Correct 42 ms 492 KB Output is correct
25 Correct 52 ms 348 KB Output is correct
26 Correct 34 ms 344 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 38 ms 348 KB Output is correct
12 Correct 23 ms 348 KB Output is correct
13 Correct 26 ms 348 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 31 ms 348 KB Output is correct
16 Correct 30 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 612 KB Output is correct
22 Correct 596 ms 1236 KB Output is correct
23 Correct 59 ms 604 KB Output is correct
24 Correct 42 ms 492 KB Output is correct
25 Correct 52 ms 348 KB Output is correct
26 Correct 34 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 460 ms 1372 KB Output is correct
32 Correct 17 ms 604 KB Output is correct
33 Correct 21 ms 568 KB Output is correct
34 Execution timed out 2008 ms 17216 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 38 ms 348 KB Output is correct
12 Correct 23 ms 348 KB Output is correct
13 Correct 26 ms 348 KB Output is correct
14 Correct 33 ms 344 KB Output is correct
15 Correct 31 ms 348 KB Output is correct
16 Correct 30 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 612 KB Output is correct
22 Correct 596 ms 1236 KB Output is correct
23 Correct 59 ms 604 KB Output is correct
24 Correct 42 ms 492 KB Output is correct
25 Correct 52 ms 348 KB Output is correct
26 Correct 34 ms 344 KB Output is correct
27 Correct 3 ms 348 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 460 ms 1372 KB Output is correct
32 Correct 17 ms 604 KB Output is correct
33 Correct 21 ms 568 KB Output is correct
34 Execution timed out 2008 ms 17216 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 787 ms 1188 KB Output is correct
27 Correct 810 ms 1212 KB Output is correct
28 Correct 822 ms 1108 KB Output is correct
29 Correct 746 ms 1104 KB Output is correct
30 Correct 318 ms 776 KB Output is correct
31 Correct 797 ms 1120 KB Output is correct
32 Correct 462 ms 860 KB Output is correct
33 Correct 8 ms 600 KB Output is correct
34 Correct 412 ms 1108 KB Output is correct
35 Correct 17 ms 604 KB Output is correct
36 Correct 17 ms 348 KB Output is correct
37 Correct 398 ms 860 KB Output is correct
38 Correct 400 ms 860 KB Output is correct
39 Correct 39 ms 604 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 38 ms 348 KB Output is correct
51 Correct 23 ms 348 KB Output is correct
52 Correct 26 ms 348 KB Output is correct
53 Correct 33 ms 344 KB Output is correct
54 Correct 31 ms 348 KB Output is correct
55 Correct 30 ms 348 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 45 ms 612 KB Output is correct
61 Correct 596 ms 1236 KB Output is correct
62 Correct 59 ms 604 KB Output is correct
63 Correct 42 ms 492 KB Output is correct
64 Correct 52 ms 348 KB Output is correct
65 Correct 34 ms 344 KB Output is correct
66 Correct 3 ms 348 KB Output is correct
67 Correct 2 ms 348 KB Output is correct
68 Correct 2 ms 348 KB Output is correct
69 Correct 2 ms 348 KB Output is correct
70 Correct 460 ms 1372 KB Output is correct
71 Correct 17 ms 604 KB Output is correct
72 Correct 21 ms 568 KB Output is correct
73 Execution timed out 2008 ms 17216 KB Time limit exceeded
74 Halted 0 ms 0 KB -