답안 #770279

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
770279	2023-07-01T04:29:00 Z	Plurm	Team Contest (JOI22_team)	C++11	8 / 100	2000 ms	3140 KB

team

#include <bits/stdc++.h>
using namespace std;

map<int, vector<pair<int, int>>> bckt;
int main() {
    int n;
    cin >> n;
    vector<int> keys;
    for (int i = 0; i < n; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        bckt[y].push_back({x, z});
        keys.push_back(y);
    }
    sort(keys.begin(), keys.end());
    keys.resize(unique(keys.begin(), keys.end()) - keys.begin());
    int mx = -1;
    for (int g : keys) {
        for (auto pti : bckt[g]) {
            set<tuple<int, int, int>> cand;
            int mxz = -1;
            for (int gg : keys) {
                for (auto ptk : bckt[gg]) {
                    if (ptk.first < pti.first) {
                        if (gg <= g)
                            mxz = max(mxz, ptk.second);
                        cand.insert({ptk.first, gg, ptk.second});
                    }
                }
            }
            for (int gg : keys) {
                if (gg <= g)
                    continue;
                for (auto ptj : bckt[gg]) {
                    if (pti.first > ptj.first) {
                        if (mxz > pti.second && mxz > ptj.second) {
                            mx = max(mx, pti.first + gg + mxz);
                        }
                    }
                }
                for (auto ptj : bckt[gg]) {
                    if (cand.count({ptj.first, gg, ptj.second}))
                        mxz = max(mxz, ptj.second);
                }
            }
        }
    }
    cout << mx << endl;
    return 0;
}

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	11 ms	340 KB	Output is correct
15	Correct	5 ms	460 KB	Output is correct
16	Correct	7 ms	348 KB	Output is correct
17	Correct	6 ms	340 KB	Output is correct
18	Correct	7 ms	300 KB	Output is correct
19	Correct	7 ms	332 KB	Output is correct
20	Correct	4 ms	300 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	6 ms	240 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	4 ms	212 KB	Output is correct
25	Correct	4 ms	300 KB	Output is correct

Subtask #2

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	11 ms	340 KB	Output is correct
15	Correct	5 ms	460 KB	Output is correct
16	Correct	7 ms	348 KB	Output is correct
17	Correct	6 ms	340 KB	Output is correct
18	Correct	7 ms	300 KB	Output is correct
19	Correct	7 ms	332 KB	Output is correct
20	Correct	4 ms	300 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	6 ms	240 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	4 ms	212 KB	Output is correct
25	Correct	4 ms	300 KB	Output is correct
26	Execution timed out	2076 ms	1072 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Execution timed out	2092 ms	3140 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Execution timed out	2092 ms	3140 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Execution timed out	2092 ms	3140 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	304 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Execution timed out	2092 ms	3140 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	11 ms	340 KB	Output is correct
15	Correct	5 ms	460 KB	Output is correct
16	Correct	7 ms	348 KB	Output is correct
17	Correct	6 ms	340 KB	Output is correct
18	Correct	7 ms	300 KB	Output is correct
19	Correct	7 ms	332 KB	Output is correct
20	Correct	4 ms	300 KB	Output is correct
21	Correct	2 ms	212 KB	Output is correct
22	Correct	6 ms	240 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	4 ms	212 KB	Output is correct
25	Correct	4 ms	300 KB	Output is correct
26	Execution timed out	2076 ms	1072 KB	Time limit exceeded
27	Halted	0 ms	0 KB	-