oj.uz

답안 #1054884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054884 2024-08-12T12:52:39 Z j_vdd16 Team Contest (JOI22_team) C++17
0 / 100
 0 ms 348 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);
    sort(all(beavers), compX);
    n = (int)beavers.size();

    int bestScore = -1;
    int jStart = 1;

    loop(i, n) {
        while (jStart < n && beavers[jStart].x >= beavers[i].x) jStart++;

        const Beaver& beaver1 = beavers[i];

        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);
        }
        sort(all(beaversLeft));
        int m = (int)beaversLeft.size();
       
        int kStart = 1;
        for (int j = 0; j < m; j++) {
            while (kStart < m && beaversLeft[j].first <= beaversLeft[kStart].first) kStart++;

            for (int k = kStart; k < m; k++) {
                if (beaversLeft[j].first == beaversLeft[k].first) continue;

                int y[3] = { beaver1.y, beaversLeft[j].first, beaversLeft[k].first };
                int z[3] = { beaver1.z, beaversLeft[j].second, beaversLeft[k].second };

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

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

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

    std::cout << bestScore << endl;

    return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -