제출 #1310330

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310330		syanvu	Exhibition (JOI19_ho_t2)	C++20	0 / 100	1 ms	568 KiB

joi2019_ho_t2

// #pragma optimize ("g",on)
// #pragma GCC optimize ("inline")
// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC optimize ("03")
#include <bits/stdc++.h>

#define pb push_back
#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#define int long long
#define all(v) v.begin(),v.end()
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const int N = 4e5 + 1, inf = 1e9, mod = 998244353;

pair<int, int> t[4 * N];
int mn[4 * N];

pair<int, int> f(pair<int, int> a, pair<int, int> b){
    if(a.first > b.first) return a;
    if(a.first < b.first) return b;
    if(a.second <= b.second) return a;
    else return b;
}

void upd(int v, int tl, int tr, int pos, int x, int y){
    if(tl == tr){
        t[v] = f(t[v], make_pair(x, y));
        return;
    }
    int mid = (tl + tr) / 2;
    if(mid >= pos) upd(v * 2, tl, mid, pos, x, y);
    else upd(v * 2 + 1, mid + 1, tr, pos, x, y);
    t[v] = f(t[v * 2], t[v * 2 + 1]);
}
pair<int, int> get(int v, int tl, int tr, int l, int r){
    if(tl > r || l > tr) return make_pair(0, 0);
    if(tl >= l && r >= tr) return t[v];
    int mid = (tl + tr) / 2;
    return f(get(v * 2, tl, mid, l, r), get(v * 2 + 1, mid + 1, tr, l, r));
}
void upd1(int v, int tl, int tr, int pos, int x){
    if(tl == tr){
        mn[v] = x;
        return;
    }
    int mid = (tl + tr) / 2;
    if(mid >= pos) upd1(v * 2, tl, mid, pos, x);
    else upd1(v * 2 + 1, mid + 1, tr, pos, x);
    mn[v] = min(mn[v * 2], mn[v * 2 + 1]);
}
int get1(int v, int tl, int tr, int l, int r){
    if(tl > r || l > tr) return inf;
    if(tl >= l && r >= tr) return mn[v];
    int mid = (tl + tr) / 2;
    return min(get1(v * 2, tl, mid, l, r), get1(v * 2 + 1, mid + 1, tr, l, r));
}

void solve(){
    int n, m;
    cin >> n >> m;
    pair<int, int> p[n + 1];
    int s[m + 1];
    vector<int> v;
    for(int i = 1; i <= n; i++){
        cin >> p[i].first >> p[i].second;
        v.push_back(p[i].first);
    }
    for(int i = 1; i <= m; i++){
        cin >> s[i];
        v.push_back(s[i]);
    }
    v.push_back(-1);
    sort(all(v));
    v.erase(unique(all(v)), v.end());
    int sz = v.size() - 1;
    sort(p + 1, p + n + 1, [&](pair<int, int> a, pair<int, int> b){
        if(a.second != b.second) return a.second < b.second;
        else return a.first < b.first;
    });
    for(int i = 1; i <= n; i++){
        p[i].first = lower_bound(all(v), p[i].first) - v.begin();
        upd1(1, 1, n, i, p[i].first);
    }
    auto find = [&](int x, int L){
        int l = L + 1, r = n;
        while(l <= r){
            int mid = (l + r) / 2;
            if(get1(1, 1, n, L + 1, mid) <= x) r = mid - 1;
            else l = mid + 1;
        }
        return r + 1;
    };
    int ans = 0;
    for(int i = 1; i <= m; i++){
        s[i] = lower_bound(all(v), s[i]) - v.begin();
        auto [x, y] = get(1, 1, sz, 1, s[i]);
        int nxt = find(s[i], y);
        if(nxt > y && nxt <= n) upd(1, 1, sz, s[i], x + 1, nxt);
        // cout << x << ' ' << p[y].second << ' ' << p[nxt].second << '\n';
    }
    cout << t[1].first;
}

signed main(){
    SS
    // freopen("trains.in", "r", stdin);
    // freopen("trains.out", "w", stdout);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 50