Submission #713811

# Submission time Handle Problem Language Result Execution time Memory
713811 2023-03-23T05:18:21 Z becaido Team Contest (JOI22_team) C++17
8 / 100
2000 ms 2892 KB
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

// want O(C + n(log))

const int SIZE = 1.5e5 + 5;

int n, ans;
array<int, 3> a[SIZE];

void solve() {
    cin >> n;
    FOR (i, 1, n) FOR (j, 0, 2) cin >> a[i][j];
    sort(a + 1, a + n + 1);

    ans = -1;
    FOR (i, 1, n) FOR (j, 1, n) if (j != i) FOR (k, 1, n) if (k != i && k != j) {
        if (a[i][0] <= max(a[j][0], a[k][0])) continue;
        if (a[j][1] <= max(a[i][1], a[k][1])) continue;
        if (a[k][2] <= max(a[i][2], a[j][2])) continue;
        ans = max(ans, a[i][0] + a[j][1] + a[k][2]);
    }
    cout << ans << '\n';
}

int main() {
    Waimai;
    solve();
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 49 ms 212 KB Output is correct
15 Correct 19 ms 340 KB Output is correct
16 Correct 30 ms 212 KB Output is correct
17 Correct 40 ms 328 KB Output is correct
18 Correct 35 ms 332 KB Output is correct
19 Correct 42 ms 340 KB Output is correct
20 Correct 46 ms 212 KB Output is correct
21 Correct 35 ms 320 KB Output is correct
22 Correct 39 ms 340 KB Output is correct
23 Correct 35 ms 340 KB Output is correct
24 Correct 36 ms 212 KB Output is correct
25 Correct 38 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 49 ms 212 KB Output is correct
15 Correct 19 ms 340 KB Output is correct
16 Correct 30 ms 212 KB Output is correct
17 Correct 40 ms 328 KB Output is correct
18 Correct 35 ms 332 KB Output is correct
19 Correct 42 ms 340 KB Output is correct
20 Correct 46 ms 212 KB Output is correct
21 Correct 35 ms 320 KB Output is correct
22 Correct 39 ms 340 KB Output is correct
23 Correct 35 ms 340 KB Output is correct
24 Correct 36 ms 212 KB Output is correct
25 Correct 38 ms 316 KB Output is correct
26 Execution timed out 2065 ms 468 KB Time limit exceeded
27 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 2068 ms 2892 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 2068 ms 2892 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 2068 ms 2892 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory 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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Execution timed out 2068 ms 2892 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 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 49 ms 212 KB Output is correct
15 Correct 19 ms 340 KB Output is correct
16 Correct 30 ms 212 KB Output is correct
17 Correct 40 ms 328 KB Output is correct
18 Correct 35 ms 332 KB Output is correct
19 Correct 42 ms 340 KB Output is correct
20 Correct 46 ms 212 KB Output is correct
21 Correct 35 ms 320 KB Output is correct
22 Correct 39 ms 340 KB Output is correct
23 Correct 35 ms 340 KB Output is correct
24 Correct 36 ms 212 KB Output is correct
25 Correct 38 ms 316 KB Output is correct
26 Execution timed out 2065 ms 468 KB Time limit exceeded
27 Halted 0 ms 0 KB -