oj.uz

Submission #549903

# Submission time Handle Problem Language Result Execution time Memory
549903 2022-04-16T19:36:21 Z BalintR Team Contest (JOI22_team) C++17
55 / 100
 2000 ms 70648 KB 
#include <bits/stdc++.h>
using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound((v).begin(), (v).end(), x) - (v).begin())
#define ubv(v, x) (upper_bound((v).begin(), (v).end(), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cout << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cout << #arr; FR(_i, n) cout << ' ' << arr[_i]; cout << endl;}

typedef array<int, 3> trip;

const int MN = 4005;
int n;
vector<trip> vec;
vpii compr;
vi xs, ys;
int arr[MN][MN];

int main(){
    boost();
    cin >> n;
    FR(i, n){
        int a, b, c;
        cin >> a >> b >> c;
        vec.pb({a, b, c});
        xs.pb(a);
        ys.pb(b);
    }
    xs.pb(0);
    ys.pb(0);

    UNIQUE(vec);
    UNIQUE(xs);
    UNIQUE(ys);

    for(auto [x, y, z] : vec){
        x = lbv(xs, x);
        y = lbv(ys, y);
        compr.pb({x, y});
        arr[x][y] = max(arr[x][y], z);
    }

    FOR(i, 1, MN) FOR(j, 1, MN){
        arr[i][j] = max(arr[i][j], arr[i-1][j]);
        arr[i][j] = max(arr[i][j], arr[i][j-1]);
    }

    int ans = -1;
    n = SZ(vec);
    FR(i, n) FR(j, n){
        if(vec[i][1] >= vec[j][1] || vec[j][0] >= vec[i][0]) continue;
        int mx = vec[i][0];
        int my = vec[j][1];
        int mz = arr[compr[i].fs-1][compr[j].sn-1];
        if(mz > vec[i][2] && mz > vec[j][2]) ans = max(ans, mx+my+mz);
    }

    cout << ans << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 63032 KB Output is correct
2 Correct 92 ms 63092 KB Output is correct
3 Correct 87 ms 62968 KB Output is correct
4 Correct 89 ms 63064 KB Output is correct
5 Correct 94 ms 63012 KB Output is correct
6 Correct 100 ms 63060 KB Output is correct
7 Correct 98 ms 62980 KB Output is correct
8 Correct 90 ms 62936 KB Output is correct
9 Correct 90 ms 63008 KB Output is correct
10 Correct 98 ms 63072 KB Output is correct
11 Correct 91 ms 63000 KB Output is correct
12 Correct 90 ms 62984 KB Output is correct
13 Correct 90 ms 63052 KB Output is correct
14 Correct 94 ms 63096 KB Output is correct
15 Correct 90 ms 63048 KB Output is correct
16 Correct 91 ms 63060 KB Output is correct
17 Correct 91 ms 63088 KB Output is correct
18 Correct 97 ms 63024 KB Output is correct
19 Correct 96 ms 63004 KB Output is correct
20 Correct 89 ms 63080 KB Output is correct
21 Correct 92 ms 63088 KB Output is correct
22 Correct 94 ms 63060 KB Output is correct
23 Correct 98 ms 62980 KB Output is correct
24 Correct 92 ms 62992 KB Output is correct
25 Correct 89 ms 63072 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 63032 KB Output is correct
2 Correct 92 ms 63092 KB Output is correct
3 Correct 87 ms 62968 KB Output is correct
4 Correct 89 ms 63064 KB Output is correct
5 Correct 94 ms 63012 KB Output is correct
6 Correct 100 ms 63060 KB Output is correct
7 Correct 98 ms 62980 KB Output is correct
8 Correct 90 ms 62936 KB Output is correct
9 Correct 90 ms 63008 KB Output is correct
10 Correct 98 ms 63072 KB Output is correct
11 Correct 91 ms 63000 KB Output is correct
12 Correct 90 ms 62984 KB Output is correct
13 Correct 90 ms 63052 KB Output is correct
14 Correct 94 ms 63096 KB Output is correct
15 Correct 90 ms 63048 KB Output is correct
16 Correct 91 ms 63060 KB Output is correct
17 Correct 91 ms 63088 KB Output is correct
18 Correct 97 ms 63024 KB Output is correct
19 Correct 96 ms 63004 KB Output is correct
20 Correct 89 ms 63080 KB Output is correct
21 Correct 92 ms 63088 KB Output is correct
22 Correct 94 ms 63060 KB Output is correct
23 Correct 98 ms 62980 KB Output is correct
24 Correct 92 ms 62992 KB Output is correct
25 Correct 89 ms 63072 KB Output is correct
26 Correct 151 ms 63244 KB Output is correct
27 Correct 152 ms 63252 KB Output is correct
28 Correct 137 ms 63312 KB Output is correct
29 Correct 132 ms 63300 KB Output is correct
30 Correct 118 ms 63244 KB Output is correct
31 Correct 139 ms 63152 KB Output is correct
32 Correct 121 ms 63256 KB Output is correct
33 Correct 100 ms 63180 KB Output is correct
34 Correct 107 ms 63224 KB Output is correct
35 Correct 88 ms 63064 KB Output is correct
36 Correct 100 ms 63104 KB Output is correct
37 Correct 119 ms 63288 KB Output is correct
38 Correct 100 ms 63220 KB Output is correct
39 Correct 96 ms 63084 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 63020 KB Output is correct
2 Correct 94 ms 63060 KB Output is correct
3 Correct 97 ms 63052 KB Output is correct
4 Correct 89 ms 62976 KB Output is correct
5 Correct 91 ms 63060 KB Output is correct
6 Correct 91 ms 63060 KB Output is correct
7 Correct 104 ms 63036 KB Output is correct
8 Correct 94 ms 63056 KB Output is correct
9 Correct 91 ms 62944 KB Output is correct
10 Correct 88 ms 63000 KB Output is correct
11 Correct 141 ms 67872 KB Output is correct
12 Correct 134 ms 65836 KB Output is correct
13 Correct 122 ms 66440 KB Output is correct
14 Correct 141 ms 68164 KB Output is correct
15 Correct 147 ms 67876 KB Output is correct
16 Correct 146 ms 67884 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 63020 KB Output is correct
2 Correct 94 ms 63060 KB Output is correct
3 Correct 97 ms 63052 KB Output is correct
4 Correct 89 ms 62976 KB Output is correct
5 Correct 91 ms 63060 KB Output is correct
6 Correct 91 ms 63060 KB Output is correct
7 Correct 104 ms 63036 KB Output is correct
8 Correct 94 ms 63056 KB Output is correct
9 Correct 91 ms 62944 KB Output is correct
10 Correct 88 ms 63000 KB Output is correct
11 Correct 141 ms 67872 KB Output is correct
12 Correct 134 ms 65836 KB Output is correct
13 Correct 122 ms 66440 KB Output is correct
14 Correct 141 ms 68164 KB Output is correct
15 Correct 147 ms 67876 KB Output is correct
16 Correct 146 ms 67884 KB Output is correct
17 Correct 91 ms 63052 KB Output is correct
18 Correct 95 ms 62956 KB Output is correct
19 Correct 100 ms 63044 KB Output is correct
20 Correct 90 ms 63024 KB Output is correct
21 Correct 93 ms 63256 KB Output is correct
22 Correct 224 ms 68196 KB Output is correct
23 Correct 160 ms 68060 KB Output is correct
24 Correct 135 ms 66200 KB Output is correct
25 Correct 142 ms 68388 KB Output is correct
26 Correct 136 ms 68304 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 63020 KB Output is correct
2 Correct 94 ms 63060 KB Output is correct
3 Correct 97 ms 63052 KB Output is correct
4 Correct 89 ms 62976 KB Output is correct
5 Correct 91 ms 63060 KB Output is correct
6 Correct 91 ms 63060 KB Output is correct
7 Correct 104 ms 63036 KB Output is correct
8 Correct 94 ms 63056 KB Output is correct
9 Correct 91 ms 62944 KB Output is correct
10 Correct 88 ms 63000 KB Output is correct
11 Correct 141 ms 67872 KB Output is correct
12 Correct 134 ms 65836 KB Output is correct
13 Correct 122 ms 66440 KB Output is correct
14 Correct 141 ms 68164 KB Output is correct
15 Correct 147 ms 67876 KB Output is correct
16 Correct 146 ms 67884 KB Output is correct
17 Correct 91 ms 63052 KB Output is correct
18 Correct 95 ms 62956 KB Output is correct
19 Correct 100 ms 63044 KB Output is correct
20 Correct 90 ms 63024 KB Output is correct
21 Correct 93 ms 63256 KB Output is correct
22 Correct 224 ms 68196 KB Output is correct
23 Correct 160 ms 68060 KB Output is correct
24 Correct 135 ms 66200 KB Output is correct
25 Correct 142 ms 68388 KB Output is correct
26 Correct 136 ms 68304 KB Output is correct
27 Correct 92 ms 63036 KB Output is correct
28 Correct 93 ms 62980 KB Output is correct
29 Correct 93 ms 63020 KB Output is correct
30 Correct 90 ms 63012 KB Output is correct
31 Correct 128 ms 63336 KB Output is correct
32 Correct 101 ms 63108 KB Output is correct
33 Correct 90 ms 63088 KB Output is correct
34 Execution timed out 2082 ms 70648 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 63020 KB Output is correct
2 Correct 94 ms 63060 KB Output is correct
3 Correct 97 ms 63052 KB Output is correct
4 Correct 89 ms 62976 KB Output is correct
5 Correct 91 ms 63060 KB Output is correct
6 Correct 91 ms 63060 KB Output is correct
7 Correct 104 ms 63036 KB Output is correct
8 Correct 94 ms 63056 KB Output is correct
9 Correct 91 ms 62944 KB Output is correct
10 Correct 88 ms 63000 KB Output is correct
11 Correct 141 ms 67872 KB Output is correct
12 Correct 134 ms 65836 KB Output is correct
13 Correct 122 ms 66440 KB Output is correct
14 Correct 141 ms 68164 KB Output is correct
15 Correct 147 ms 67876 KB Output is correct
16 Correct 146 ms 67884 KB Output is correct
17 Correct 91 ms 63052 KB Output is correct
18 Correct 95 ms 62956 KB Output is correct
19 Correct 100 ms 63044 KB Output is correct
20 Correct 90 ms 63024 KB Output is correct
21 Correct 93 ms 63256 KB Output is correct
22 Correct 224 ms 68196 KB Output is correct
23 Correct 160 ms 68060 KB Output is correct
24 Correct 135 ms 66200 KB Output is correct
25 Correct 142 ms 68388 KB Output is correct
26 Correct 136 ms 68304 KB Output is correct
27 Correct 92 ms 63036 KB Output is correct
28 Correct 93 ms 62980 KB Output is correct
29 Correct 93 ms 63020 KB Output is correct
30 Correct 90 ms 63012 KB Output is correct
31 Correct 128 ms 63336 KB Output is correct
32 Correct 101 ms 63108 KB Output is correct
33 Correct 90 ms 63088 KB Output is correct
34 Execution timed out 2082 ms 70648 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 63032 KB Output is correct
2 Correct 92 ms 63092 KB Output is correct
3 Correct 87 ms 62968 KB Output is correct
4 Correct 89 ms 63064 KB Output is correct
5 Correct 94 ms 63012 KB Output is correct
6 Correct 100 ms 63060 KB Output is correct
7 Correct 98 ms 62980 KB Output is correct
8 Correct 90 ms 62936 KB Output is correct
9 Correct 90 ms 63008 KB Output is correct
10 Correct 98 ms 63072 KB Output is correct
11 Correct 91 ms 63000 KB Output is correct
12 Correct 90 ms 62984 KB Output is correct
13 Correct 90 ms 63052 KB Output is correct
14 Correct 94 ms 63096 KB Output is correct
15 Correct 90 ms 63048 KB Output is correct
16 Correct 91 ms 63060 KB Output is correct
17 Correct 91 ms 63088 KB Output is correct
18 Correct 97 ms 63024 KB Output is correct
19 Correct 96 ms 63004 KB Output is correct
20 Correct 89 ms 63080 KB Output is correct
21 Correct 92 ms 63088 KB Output is correct
22 Correct 94 ms 63060 KB Output is correct
23 Correct 98 ms 62980 KB Output is correct
24 Correct 92 ms 62992 KB Output is correct
25 Correct 89 ms 63072 KB Output is correct
26 Correct 151 ms 63244 KB Output is correct
27 Correct 152 ms 63252 KB Output is correct
28 Correct 137 ms 63312 KB Output is correct
29 Correct 132 ms 63300 KB Output is correct
30 Correct 118 ms 63244 KB Output is correct
31 Correct 139 ms 63152 KB Output is correct
32 Correct 121 ms 63256 KB Output is correct
33 Correct 100 ms 63180 KB Output is correct
34 Correct 107 ms 63224 KB Output is correct
35 Correct 88 ms 63064 KB Output is correct
36 Correct 100 ms 63104 KB Output is correct
37 Correct 119 ms 63288 KB Output is correct
38 Correct 100 ms 63220 KB Output is correct
39 Correct 96 ms 63084 KB Output is correct
40 Correct 92 ms 63020 KB Output is correct
41 Correct 94 ms 63060 KB Output is correct
42 Correct 97 ms 63052 KB Output is correct
43 Correct 89 ms 62976 KB Output is correct
44 Correct 91 ms 63060 KB Output is correct
45 Correct 91 ms 63060 KB Output is correct
46 Correct 104 ms 63036 KB Output is correct
47 Correct 94 ms 63056 KB Output is correct
48 Correct 91 ms 62944 KB Output is correct
49 Correct 88 ms 63000 KB Output is correct
50 Correct 141 ms 67872 KB Output is correct
51 Correct 134 ms 65836 KB Output is correct
52 Correct 122 ms 66440 KB Output is correct
53 Correct 141 ms 68164 KB Output is correct
54 Correct 147 ms 67876 KB Output is correct
55 Correct 146 ms 67884 KB Output is correct
56 Correct 91 ms 63052 KB Output is correct
57 Correct 95 ms 62956 KB Output is correct
58 Correct 100 ms 63044 KB Output is correct
59 Correct 90 ms 63024 KB Output is correct
60 Correct 93 ms 63256 KB Output is correct
61 Correct 224 ms 68196 KB Output is correct
62 Correct 160 ms 68060 KB Output is correct
63 Correct 135 ms 66200 KB Output is correct
64 Correct 142 ms 68388 KB Output is correct
65 Correct 136 ms 68304 KB Output is correct
66 Correct 92 ms 63036 KB Output is correct
67 Correct 93 ms 62980 KB Output is correct
68 Correct 93 ms 63020 KB Output is correct
69 Correct 90 ms 63012 KB Output is correct
70 Correct 128 ms 63336 KB Output is correct
71 Correct 101 ms 63108 KB Output is correct
72 Correct 90 ms 63088 KB Output is correct
73 Execution timed out 2082 ms 70648 KB Time limit exceeded
74 Halted 0 ms 0 KB -