Submission #892169

# Submission time Handle Problem Language Result Execution time Memory
892169 2023-12-25T02:59:51 Z vjudge1 Team Contest (JOI22_team) C++17
8 / 100
235 ms 11012 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
    return a > b && (a = b) == b;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
    return a < b && (a = b) == b;
}
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
const int mod = 998244353;

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int, int>> x(n), y(n), z(n);
    int X[n], Y[n], Z[n];
    for (int i = 0; i < n; ++i) {
        cin >> X[i] >> Y[i] >> Z[i];
        x[i] = {X[i], i}, y[i] = {Y[i], i}, z[i] = {Z[i], i};
    }
    sort(all(x), greater<pair<int, int>>());
    sort(all(y), greater<pair<int, int>>());
    sort(all(z), greater<pair<int, int>>());
    int res = -1;
    for (int i = 0; i < min(500ll, n); ++i) {
        for (int j = 0; j < min(500ll, n); ++j) {
            if (x[i].second == y[j].second || X[x[i].second] <= X[y[j].second] || Y[x[i].second] >= Y[y[j].second]) {
                continue;
            }
            for (int k = 0; k < min(500ll, n); ++k) {
                if (x[i].second == z[k].second || y[j].second == z[k].second || X[x[i].second] <= X[z[k].second] || Y[z[k].second] >= Y[y[j].second] || Z[z[k].second] <= Z[x[i].second] || Z[z[k].second] <= Z[y[j].second]) {
                    continue;
                }
                chmax(res, x[i].first + y[j].first + z[k].first);
            }
        }
    }
    cout << res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 18 ms 480 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 9 ms 348 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 13 ms 468 KB Output is correct
19 Correct 16 ms 476 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 18 ms 480 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 9 ms 348 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 13 ms 468 KB Output is correct
19 Correct 16 ms 476 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 235 ms 708 KB Output is correct
27 Incorrect 67 ms 604 KB Output isn't correct
28 Halted 0 ms 0 KB -
# 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 228 ms 11012 KB Output is correct
12 Incorrect 135 ms 8028 KB Output isn't correct
13 Halted 0 ms 0 KB -
# 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 228 ms 11012 KB Output is correct
12 Incorrect 135 ms 8028 KB Output isn't correct
13 Halted 0 ms 0 KB -
# 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 228 ms 11012 KB Output is correct
12 Incorrect 135 ms 8028 KB Output isn't correct
13 Halted 0 ms 0 KB -
# 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 228 ms 11012 KB Output is correct
12 Incorrect 135 ms 8028 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 500 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 18 ms 480 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 9 ms 348 KB Output is correct
17 Correct 7 ms 348 KB Output is correct
18 Correct 13 ms 468 KB Output is correct
19 Correct 16 ms 476 KB Output is correct
20 Correct 11 ms 344 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 235 ms 708 KB Output is correct
27 Incorrect 67 ms 604 KB Output isn't correct
28 Halted 0 ms 0 KB -