제출 #1094162

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094162		VMaksimoski008	사다리꼴 (balkan11_trapezoid)	C++17	100 / 100	266 ms	32760 KiB

trapezoid

#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define ar array

const int mod = 30013;

struct SegTree {
    int n;
    vector<ar<int, 2> > tree;

    SegTree(int _n) : n(_n), tree(4*_n, {0, 0}) {}

    ar<int, 2> merge(ar<int, 2> a, ar<int, 2> b) {
        if(a[0] > b[0]) return a;
        if(a[0] < b[0]) return b;
        return { a[0], (a[1] + b[1]) % mod };
    }

    void update(int u, int tl, int tr, int p, int v, int w) {
        if(tl == tr) {
            tree[u] = merge(tree[u], { v, w });
        } else {
            int tm = (tl + tr) / 2;
            if(p <= tm) update(2*u, tl, tm, p, v, w);
            else update(2*u+1, tm+1, tr, p, v, w);
            tree[u] = merge(tree[2*u], tree[2*u+1]);
        }
    }

    ar<int, 2> query(int u, int tl, int tr, int l, int r) {
        if(l > tr || tl > r) return { 0, 0 };
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return merge(query(2*u, tl, tm, l, r), query(2*u+1, tm+1, tr, l, r));
    }

    void update(int p, int v, int w) { update(1, 0, n-1, p, v, w); }
    ar<int, 2> query(int l, int r) { return query(1, 0, n-1, l, r); }
};

int main() {
    int n; cin >> n;
    vector<ar<int, 4> > v(n);
    set<int> s;
    for(int i=0; i<n; i++) {
        for(int j=0; j<4; j++) cin >> v[i][j];
        for(int j=0; j<4; j++) s.insert(v[i][j]);
    }

    vector<int> comp(s.begin(), s.end());
    sort(v.begin(), v.end());
    for(int i=0; i<n; i++)
        for(int j=0; j<4; j++) v[i][j] = lower_bound(comp.begin(), comp.end(), v[i][j]) - comp.begin();

    vector<ar<int, 2> > dp(n);
    SegTree tree(comp.size());
    priority_queue<ar<int, 2> > pq;
    for(int i=0; i<n; i++) {
        dp[i] = { 1, 1 };
        while(!pq.empty() && -pq.top()[0] < v[i][0]) {
            tree.update(v[pq.top()[1]][3], dp[pq.top()[1]][0], dp[pq.top()[1]][1]);
            pq.pop();
        }
        auto res = tree.query(0, v[i][2]-1);
        if(res[0]) dp[i] = { res[0] + 1, res[1] };
        pq.push({ -v[i][1], i }); 
    }

    while(!pq.empty()) {
        tree.update(v[pq.top()[1]][3], dp[pq.top()[1]][0], dp[pq.top()[1]][1]);
        pq.pop();
    }
    auto [mx, ways] = tree.query(0, comp.size() - 1);
    cout << mx << " " << ways << '\n';
    return 0;
}

• Subtask 1: 100 / 100