oj.uz

답안 #1054925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054925 2024-08-12T13:06:33 Z j_vdd16 Team Contest (JOI22_team) C++17
26 / 100
 2000 ms 17600 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);
        }
        int m = (int)beaversLeft.size();
        if (m == 0) continue;
 
        vi sufMaxZ(m);
        sufMaxZ[m - 1] = beaversLeft[m - 1].second;
        for (int j = m - 2; 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) continue;
 
            //int score = beaver1.x + beaversLeft[j].first + sufMaxZ[kStart];
            //bestScore = max(score, bestScore);
            for (int k = kStart; k < m; k++) {
                int z[3] = { beaver1.z, beaversLeft[j].second, beaversLeft[k].second };
 
                int maxX = 0;
                int maxY = 1;
                int maxZ = getMax(z, 3);
 
                if (maxX == maxZ || maxY == maxZ || maxZ == -1) continue;
 
                bestScore = max(bestScore, beaver1.x + beaversLeft[j].first + z[maxZ]);
            }
        }
    }

    std::cout << bestScore << endl;

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 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 6 ms 348 KB Output is correct
15 Correct 2 ms 488 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 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
0 / 29.0

# 결과 실행 시간 메모리 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 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 6 ms 348 KB Output is correct
15 Correct 2 ms 488 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 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 Execution timed out 2075 ms 860 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 34 ms 348 KB Output is correct
12 Correct 22 ms 440 KB Output is correct
13 Correct 26 ms 652 KB Output is correct
14 Correct 38 ms 604 KB Output is correct
15 Correct 36 ms 600 KB Output is correct
16 Correct 31 ms 348 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 34 ms 348 KB Output is correct
12 Correct 22 ms 440 KB Output is correct
13 Correct 26 ms 652 KB Output is correct
14 Correct 38 ms 604 KB Output is correct
15 Correct 36 ms 600 KB Output is correct
16 Correct 31 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 77 ms 508 KB Output is correct
22 Correct 819 ms 1456 KB Output is correct
23 Correct 63 ms 1108 KB Output is correct
24 Correct 44 ms 1112 KB Output is correct
25 Correct 55 ms 1116 KB Output is correct
26 Correct 35 ms 1108 KB Output is correct

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 34 ms 348 KB Output is correct
12 Correct 22 ms 440 KB Output is correct
13 Correct 26 ms 652 KB Output is correct
14 Correct 38 ms 604 KB Output is correct
15 Correct 36 ms 600 KB Output is correct
16 Correct 31 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 77 ms 508 KB Output is correct
22 Correct 819 ms 1456 KB Output is correct
23 Correct 63 ms 1108 KB Output is correct
24 Correct 44 ms 1112 KB Output is correct
25 Correct 55 ms 1116 KB Output is correct
26 Correct 35 ms 1108 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 4 ms 488 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1192 ms 860 KB Output is correct
32 Correct 18 ms 448 KB Output is correct
33 Correct 16 ms 560 KB Output is correct
34 Execution timed out 2061 ms 17600 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 34 ms 348 KB Output is correct
12 Correct 22 ms 440 KB Output is correct
13 Correct 26 ms 652 KB Output is correct
14 Correct 38 ms 604 KB Output is correct
15 Correct 36 ms 600 KB Output is correct
16 Correct 31 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 77 ms 508 KB Output is correct
22 Correct 819 ms 1456 KB Output is correct
23 Correct 63 ms 1108 KB Output is correct
24 Correct 44 ms 1112 KB Output is correct
25 Correct 55 ms 1116 KB Output is correct
26 Correct 35 ms 1108 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 4 ms 488 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1192 ms 860 KB Output is correct
32 Correct 18 ms 448 KB Output is correct
33 Correct 16 ms 560 KB Output is correct
34 Execution timed out 2061 ms 17600 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 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 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 6 ms 348 KB Output is correct
15 Correct 2 ms 488 KB Output is correct
16 Correct 4 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 1 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 Execution timed out 2075 ms 860 KB Time limit exceeded
27 Halted 0 ms 0 KB -