oj.uz

Submission #748506

# Submission time Handle Problem Language Result Execution time Memory
748506 2023-05-26T11:46:44 Z GrindMachine Team Contest (JOI22_team) C++17
0 / 100
 327 ms 377020 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 4e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

ll sp[N][N], ps[N][N], pp[N][N];

void solve(int test_case)
{
    ll n; cin >> n;
    vector<array<ll,3>> a(n);
    rep(i,n) rep(j,3) cin >> a[i][j];

    sort(all(a));
    a.resize(unique(all(a))-a.begin());
    n = sz(a);

    vector<ll> bx, by;
    rep(i,n){
        bx.pb(a[i][0]);
        by.pb(a[i][1]);
    }

    sort(all(bx));
    sort(all(by));
    bx.resize(unique(all(bx))-bx.begin());
    by.resize(unique(all(by))-by.begin());

    vector<ll> cx(n), cy(n);
    rep(i,n){
        cx[i] = lower_bound(all(bx),a[i][0]) - bx.begin() + 1;
        cy[i] = lower_bound(all(by),a[i][1]) - by.begin() + 1;
    }

    memset(sp,0x3f,sizeof sp);
    memset(ps,0x3f,sizeof ps);
    memset(pp,0,sizeof pp);

    rep(i,n){
        ll x = cx[i], y = cy[i];
        ll z = a[i][2];

        amin(sp[x][y], z);
        amin(ps[x][y], z);
        amax(pp[x][y], z);
    }

    rev(i,N-2,1){
        rep1(j,N-2){
            amin(sp[i][j], sp[i+1][j]);
            amin(sp[i][j], sp[i][j-1]);
        }
    }

    rep1(i,N-2){
        rev(j,N-2,1){
            amin(ps[i][j], ps[i-1][j]);
            amin(ps[i][j], ps[i][j+1]);
        }
    }

    rep1(i,N-2){
        rep1(j,N-2){
            amax(pp[i][j], pp[i-1][j]);
            amax(pp[i][j], pp[i][j-1]);
        }
    }

    ll ans = -1;

    rep1(bx,N-2){
        rep1(by,N-2){
            ll z1 = sp[bx][by-1];
            ll z2 = ps[bx-1][by];
            ll z3 = pp[bx-1][by-1];

            if(z3 > z1 and z3 > z2){
                ll val = bx + by + z3;
                amax(ans, val);
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 376976 KB Output is correct
2 Incorrect 313 ms 377020 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 376976 KB Output is correct
2 Incorrect 313 ms 377020 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 376920 KB Output is correct
2 Incorrect 313 ms 376948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 376920 KB Output is correct
2 Incorrect 313 ms 376948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 376920 KB Output is correct
2 Incorrect 313 ms 376948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 376920 KB Output is correct
2 Incorrect 313 ms 376948 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 376976 KB Output is correct
2 Incorrect 313 ms 377020 KB Output isn't correct
3 Halted 0 ms 0 KB -