oj.uz

Submission #1054414

# Submission time Handle Problem Language Result Execution time Memory
1054414 2024-08-12T09:43:41 Z j_vdd16 Team Contest (JOI22_team) C++17
17 / 100
 2000 ms 1176 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 comp(const Beaver& a, const Beaver& b) {
    return a.x > b.x || (a.x == b.x && a.y > b.y) || (a.x == b.x && 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});
        //beavers.push_back(Beaver{x, y, z});
    }

    for (auto beaver : beaverSet) beavers.push_back(beaver);
    
    sort(all(beavers), comp);
    n = beavers.size();

    int bestScore = -1;
    loop(i, n) {
        for (int j = i + 1; j < n; j++) {
            if (beavers[i].x == beavers[j].x) continue;

            for (int k = j + 1; k < n; k++) {
                int x[3] = { beavers[i].x, beavers[j].x, beavers[k].x };
                int y[3] = { beavers[i].y, beavers[j].y, beavers[k].y };
                int z[3] = { beavers[i].z, beavers[j].z, beavers[k].z };

                int maxX = 0;
                int maxY = getMax(y, 3);
                int maxZ = getMax(z, 3);

                if (maxX == maxY || maxX == maxZ || maxY == maxZ || maxX == -1 || maxY == -1 || maxZ == -1) continue;

                bestScore = max(bestScore, x[maxX] + y[maxY] + z[maxZ]);
            }
        }
    }

    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 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 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 15 ms 468 KB Output is correct
15 Correct 11 ms 348 KB Output is correct
16 Correct 10 ms 456 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 15 ms 460 KB Output is correct
19 Correct 15 ms 344 KB Output is correct
20 Correct 9 ms 452 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 10 ms 468 KB Output is correct
25 Correct 17 ms 472 KB Output is correct

Subtask #2
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 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 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 15 ms 468 KB Output is correct
15 Correct 11 ms 348 KB Output is correct
16 Correct 10 ms 456 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 15 ms 460 KB Output is correct
19 Correct 15 ms 344 KB Output is correct
20 Correct 9 ms 452 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 10 ms 468 KB Output is correct
25 Correct 17 ms 472 KB Output is correct
26 Execution timed out 2053 ms 860 KB Time limit exceeded
27 Halted 0 ms 0 KB -

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 1 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 39 ms 420 KB Output is correct
12 Correct 24 ms 808 KB Output is correct
13 Correct 30 ms 932 KB Output is correct
14 Correct 36 ms 1048 KB Output is correct
15 Correct 33 ms 1176 KB Output is correct
16 Correct 30 ms 1048 KB Output is correct

Subtask #4
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 1 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 39 ms 420 KB Output is correct
12 Correct 24 ms 808 KB Output is correct
13 Correct 30 ms 932 KB Output is correct
14 Correct 36 ms 1048 KB Output is correct
15 Correct 33 ms 1176 KB Output is correct
16 Correct 30 ms 1048 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Execution timed out 2096 ms 348 KB Time limit exceeded
22 Halted 0 ms 0 KB -

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 1 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 39 ms 420 KB Output is correct
12 Correct 24 ms 808 KB Output is correct
13 Correct 30 ms 932 KB Output is correct
14 Correct 36 ms 1048 KB Output is correct
15 Correct 33 ms 1176 KB Output is correct
16 Correct 30 ms 1048 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Execution timed out 2096 ms 348 KB Time limit exceeded
22 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 1 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 39 ms 420 KB Output is correct
12 Correct 24 ms 808 KB Output is correct
13 Correct 30 ms 932 KB Output is correct
14 Correct 36 ms 1048 KB Output is correct
15 Correct 33 ms 1176 KB Output is correct
16 Correct 30 ms 1048 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Execution timed out 2096 ms 348 KB Time limit exceeded
22 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 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 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 15 ms 468 KB Output is correct
15 Correct 11 ms 348 KB Output is correct
16 Correct 10 ms 456 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 15 ms 460 KB Output is correct
19 Correct 15 ms 344 KB Output is correct
20 Correct 9 ms 452 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 9 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 10 ms 468 KB Output is correct
25 Correct 17 ms 472 KB Output is correct
26 Execution timed out 2053 ms 860 KB Time limit exceeded
27 Halted 0 ms 0 KB -