oj.uz

Submission #1058714

# Submission time Handle Problem Language Result Execution time Memory
1058714 2024-08-14T12:45:44 Z Boas Team Contest (JOI22_team) C++17
0 / 100
 2000 ms 509088 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;

#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
#define int long long
#define INF ((int64_t)(4e18 + 1))
#define INF32 ((int32_t)(2e9 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define existsIn(x, l) (count(ALL(l), x) > 0)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define F first
#define S second
#define var const auto &
#define foreach(l) for (var e : l)

typedef int8_t in8;
typedef int16_t in16;
typedef int32_t in32;
typedef int64_t in64;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vi::iterator viit;
typedef si::iterator siit;

void solve()
{
    int n;
    cin >> n;
    viii beavers(n);
    for (auto &[x, y, z] : beavers)
        cin >> x >> y >> z;
    vvi z(4001, vi(4001, -INF));
    vvi maxZ = z;
    for (auto &[x, y, Z] : beavers)
    {
        z[x][y] = max(z[x][y], Z);
    }
    for (int x = 1; x <= 4000; x++)
    {
        for (int y = 1; y <= 4000; y++)
        {
            maxZ[x][y] = max({maxZ[x - 1][y], maxZ[x][y - 1], z[x][y]});
        }
    }
    int res = -1;
    loop(n, i)
    {
        var[x1, y1, z1] = beavers[i];
        loop(n, j)
        {
            var[x2, y2, z2] = beavers[j];
            if (x1 <= x2)
                continue;
            if (y2 <= y1)
                continue;
            int z3 = maxZ[x1][y2];
            if (z3 > max(z1, z2))
                res = max(res, x1 + y2 + z3);
        }
    }
    cout << res << endl;
}

signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 251284 KB Output is correct
2 Correct 121 ms 251216 KB Output is correct
3 Correct 139 ms 251240 KB Output is correct
4 Correct 142 ms 251140 KB Output is correct
5 Correct 110 ms 251216 KB Output is correct
6 Correct 123 ms 251220 KB Output is correct
7 Correct 132 ms 251220 KB Output is correct
8 Correct 123 ms 251284 KB Output is correct
9 Correct 106 ms 251180 KB Output is correct
10 Correct 116 ms 251264 KB Output is correct
11 Correct 130 ms 251292 KB Output is correct
12 Correct 121 ms 251220 KB Output is correct
13 Correct 105 ms 251172 KB Output is correct
14 Runtime error 287 ms 509088 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 251284 KB Output is correct
2 Correct 121 ms 251216 KB Output is correct
3 Correct 139 ms 251240 KB Output is correct
4 Correct 142 ms 251140 KB Output is correct
5 Correct 110 ms 251216 KB Output is correct
6 Correct 123 ms 251220 KB Output is correct
7 Correct 132 ms 251220 KB Output is correct
8 Correct 123 ms 251284 KB Output is correct
9 Correct 106 ms 251180 KB Output is correct
10 Correct 116 ms 251264 KB Output is correct
11 Correct 130 ms 251292 KB Output is correct
12 Correct 121 ms 251220 KB Output is correct
13 Correct 105 ms 251172 KB Output is correct
14 Runtime error 287 ms 509088 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 251220 KB Output is correct
2 Correct 107 ms 251120 KB Output is correct
3 Correct 109 ms 251244 KB Output is correct
4 Correct 124 ms 251236 KB Output is correct
5 Correct 124 ms 251220 KB Output is correct
6 Correct 109 ms 251176 KB Output is correct
7 Correct 108 ms 251140 KB Output is correct
8 Correct 110 ms 251104 KB Output is correct
9 Correct 107 ms 251068 KB Output is correct
10 Correct 107 ms 251220 KB Output is correct
11 Execution timed out 2057 ms 254796 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 251220 KB Output is correct
2 Correct 107 ms 251120 KB Output is correct
3 Correct 109 ms 251244 KB Output is correct
4 Correct 124 ms 251236 KB Output is correct
5 Correct 124 ms 251220 KB Output is correct
6 Correct 109 ms 251176 KB Output is correct
7 Correct 108 ms 251140 KB Output is correct
8 Correct 110 ms 251104 KB Output is correct
9 Correct 107 ms 251068 KB Output is correct
10 Correct 107 ms 251220 KB Output is correct
11 Execution timed out 2057 ms 254796 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 251220 KB Output is correct
2 Correct 107 ms 251120 KB Output is correct
3 Correct 109 ms 251244 KB Output is correct
4 Correct 124 ms 251236 KB Output is correct
5 Correct 124 ms 251220 KB Output is correct
6 Correct 109 ms 251176 KB Output is correct
7 Correct 108 ms 251140 KB Output is correct
8 Correct 110 ms 251104 KB Output is correct
9 Correct 107 ms 251068 KB Output is correct
10 Correct 107 ms 251220 KB Output is correct
11 Execution timed out 2057 ms 254796 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 251220 KB Output is correct
2 Correct 107 ms 251120 KB Output is correct
3 Correct 109 ms 251244 KB Output is correct
4 Correct 124 ms 251236 KB Output is correct
5 Correct 124 ms 251220 KB Output is correct
6 Correct 109 ms 251176 KB Output is correct
7 Correct 108 ms 251140 KB Output is correct
8 Correct 110 ms 251104 KB Output is correct
9 Correct 107 ms 251068 KB Output is correct
10 Correct 107 ms 251220 KB Output is correct
11 Execution timed out 2057 ms 254796 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 251284 KB Output is correct
2 Correct 121 ms 251216 KB Output is correct
3 Correct 139 ms 251240 KB Output is correct
4 Correct 142 ms 251140 KB Output is correct
5 Correct 110 ms 251216 KB Output is correct
6 Correct 123 ms 251220 KB Output is correct
7 Correct 132 ms 251220 KB Output is correct
8 Correct 123 ms 251284 KB Output is correct
9 Correct 106 ms 251180 KB Output is correct
10 Correct 116 ms 251264 KB Output is correct
11 Correct 130 ms 251292 KB Output is correct
12 Correct 121 ms 251220 KB Output is correct
13 Correct 105 ms 251172 KB Output is correct
14 Runtime error 287 ms 509088 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -