Submission #566681

#	Time	Username	Problem	Language	Result	Execution time	Memory
566681		hgmhc	trapezoid (balkan11_trapezoid)	C++17	0 / 100	1097 ms	2028 KiB

trapezoid

#include <bits/stdc++.h>
using namespace std; using ii = pair<int,int>; using ll = long long;
void o_o(){ cerr << endl; }
template <class H, class...T> void o_o(H h,T...t) { cerr << ' ' << h; o_o(t...); }
#define debug(...) cerr<<'['<<#__VA_ARGS__<<"]:",o_o(__VA_ARGS__)
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define all(x) (x).begin(), (x).end()
#define size(x) int((x).size())
#define fi first
#define se second
#define Mup(x,y) x = max(x,y)

const int N = 1e5+3;
int n;
int lis[N], answer;
struct X { int a, b, c, d; } t[N];
bool byA(X &x, X &y){ return x.a < y.a; }

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    rep(i,1,n) {
        cin >> t[i].a >> t[i].b >> t[i].c >> t[i].d;
    }
    sort(t+1,t+n+1,byA);
    rep(i,1,n) rep(j,1,i-1) {
        lis[i] = 1;
        if (t[j].b < t[i].a and t[j].d < t[i].c) {
            Mup(answer, Mup(lis[i], lis[j]+1));
        }
    }
    cout << answer;
}

• Subtask 1: 0 / 100