제출 #309520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309520		caoash	사다리꼴 (balkan11_trapezoid)	C++14	90 / 100	1064 ms	41128 KiB

trapezoid

#include <bits/stdc++.h> 
using namespace std;
 
using ll = long long;
 
using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
 
using pi = pair<int,int>;
using pl = pair<ll, ll>;
#define f first
#define s second
#define mp make_pair
 
const int MX = 200005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

gp_hash_table<int, int> cx, cy;
map<pi, pi> st;
map<pi, pl> dp;
 
template<int SZ> struct Seg {
    pl tree[4*SZ];
 
    pl merge(pl a, pl b){
        if (a.f > b.f) return a;
        else if (b.f > a.f) return b;
        else return mp(a.f, (a.s + b.s) % 30013);
    }
    
    void update(int v, int l, int r, int i, pl x) {
        if (i > r || i < l) {
            return;
        } else if (l == r) {
            tree[v] = merge(tree[v], x);
            return;
        } else {
            int m = (l + r) / 2;
            update(2 * v + 1, l, m, i, x);
            update(2 * v + 2, m + 1, r, i, x);
            tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
        }
    }
 
    pl query(int v, int l, int r, int ql, int qr, int db) {
        if (l > qr || r < ql) {
            return mp(-1, -1);
        } else if (l >= ql && r <= qr) {
            return tree[v];
        } else {
            int m = (l + r) / 2;
            pl a = query(2 * v + 1, l, m, ql, qr, db);
            pl b = query(2 * v + 2, m + 1, r, ql, qr, db);
            return merge(a, b);
        }
    }
};
 
Seg<MX> orz;
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    vi xs, ys;
    vector<pair<pi, int>> evts;
    for (int i = 0; i < n; i++) {
        int x1, x2, y1, y2;
        cin >> x1 >> x2 >> y1 >> y2;
        pi lf = mp(x1, y1);
        pi sf = mp(x2, y2);
        st[sf] = lf;
        xs.pb(x1), ys.pb(y1);
        xs.pb(x2), ys.pb(y2);
        evts.pb(mp(lf, 0));
        evts.pb(mp(sf, 1));
    }
 
    sort(all(xs));
    sort(all(ys));
 
    int pt = 0;
    for (auto v : xs) cx[v] = pt++;
    pt = 0;
    for (auto v : ys) cy[v] = pt++;
    
    sort(all(evts));
 
    for (auto curr : evts) {
        pi rd = mp(cx[curr.f.f], cy[curr.f.s]);
        if (curr.s) {
            pi prev = st[curr.f];
            dp[rd] = dp[mp(cx[prev.f], cy[prev.s])];
            orz.update(0, 0, 2 * n, rd.s, dp[rd]);
        } else {
            pl gans = orz.query(0, 0, 2 * n, 0, rd.s, 0);
            dp[rd].f = gans.f + 1;
            dp[rd].s = max(1LL, gans.s);
        }
    }
 
    pl ans = orz.query(0, 0, 2 * n, 0, 2 * n, 1);
    cout << ans.f << " " << ans.s << '\n'; 
} 

• Subtask 1: 90 / 100