제출 #549900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549900		BalintR	Team Contest (JOI22_team)	C++17	0 / 100	92 ms	63052 KiB

team

#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[j].fs-1][compr[i].sn-1];
        ans = max(ans, mx+my+mz);
    }

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

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27