답안 #1054901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054901	2024-08-12T12:57:24 Z	j_vdd16	Team Contest (JOI22_team)	C++17	26 / 100	2000 ms	15776 KB

team

#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();
       
        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++;

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

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

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

                if (maxX == maxY || maxX == maxZ || maxY == maxZ || maxY == -1 || 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	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	14 ms	484 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	4 ms	484 KB	Output is correct
18	Correct	5 ms	348 KB	Output is correct
19	Correct	6 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	4 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

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	14 ms	484 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	4 ms	484 KB	Output is correct
18	Correct	5 ms	348 KB	Output is correct
19	Correct	6 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	4 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	Execution timed out	2062 ms	860 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #3

9.0 / 9.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	41 ms	348 KB	Output is correct
12	Correct	25 ms	344 KB	Output is correct
13	Correct	31 ms	348 KB	Output is correct
14	Correct	33 ms	348 KB	Output is correct
15	Correct	43 ms	344 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct

Subtask #4

9.0 / 9.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	41 ms	348 KB	Output is correct
12	Correct	25 ms	344 KB	Output is correct
13	Correct	31 ms	348 KB	Output is correct
14	Correct	33 ms	348 KB	Output is correct
15	Correct	43 ms	344 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	0 ms	348 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	97 ms	568 KB	Output is correct
22	Correct	917 ms	1108 KB	Output is correct
23	Correct	62 ms	348 KB	Output is correct
24	Correct	46 ms	344 KB	Output is correct
25	Correct	57 ms	492 KB	Output is correct
26	Correct	34 ms	348 KB	Output is correct

Subtask #5

0 / 9.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	41 ms	348 KB	Output is correct
12	Correct	25 ms	344 KB	Output is correct
13	Correct	31 ms	348 KB	Output is correct
14	Correct	33 ms	348 KB	Output is correct
15	Correct	43 ms	344 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	0 ms	348 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	97 ms	568 KB	Output is correct
22	Correct	917 ms	1108 KB	Output is correct
23	Correct	62 ms	348 KB	Output is correct
24	Correct	46 ms	344 KB	Output is correct
25	Correct	57 ms	492 KB	Output is correct
26	Correct	34 ms	348 KB	Output is correct
27	Correct	5 ms	348 KB	Output is correct
28	Correct	6 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	344 KB	Output is correct
31	Correct	1939 ms	888 KB	Output is correct
32	Correct	18 ms	348 KB	Output is correct
33	Correct	16 ms	348 KB	Output is correct
34	Execution timed out	2096 ms	15776 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.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	41 ms	348 KB	Output is correct
12	Correct	25 ms	344 KB	Output is correct
13	Correct	31 ms	348 KB	Output is correct
14	Correct	33 ms	348 KB	Output is correct
15	Correct	43 ms	344 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	0 ms	348 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	97 ms	568 KB	Output is correct
22	Correct	917 ms	1108 KB	Output is correct
23	Correct	62 ms	348 KB	Output is correct
24	Correct	46 ms	344 KB	Output is correct
25	Correct	57 ms	492 KB	Output is correct
26	Correct	34 ms	348 KB	Output is correct
27	Correct	5 ms	348 KB	Output is correct
28	Correct	6 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	344 KB	Output is correct
31	Correct	1939 ms	888 KB	Output is correct
32	Correct	18 ms	348 KB	Output is correct
33	Correct	16 ms	348 KB	Output is correct
34	Execution timed out	2096 ms	15776 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	14 ms	484 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	4 ms	484 KB	Output is correct
18	Correct	5 ms	348 KB	Output is correct
19	Correct	6 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	4 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	Execution timed out	2062 ms	860 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-