제출 #1175593

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1175593		PakinDioxide	Exhibition (JOI19_ho_t2)	C++17	0 / 100	0 ms	328 KiB

joi2019_ho_t2

/*
    author  : PakinDioxide
    created : 29/03/2025 01:59
    task    : JOI19_ho_t2
*/
#include <bits/stdc++.h>
#define ll long long

using namespace std;

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    ll n, m;
    cin >> n >> m;
    pair <ll, ll> a[n];
    ll c[m], cnt[m], used[m], kk[m];
    memset(cnt, 0, sizeof(cnt));
    memset(used, 0, sizeof(used));
    for (auto &[y, x] : a) cin >> x >> y;
    for (auto &e : c) cin >> e;
    sort(a, a+n);
    sort(c, c+m);
    ll pos[n];
    for (int i = 0; i < n; i++) pos[i] = lower_bound(c, c+m, a[i].second) - c;
    for (int i = 0; i < m; i++) cnt[kk[i] = (lower_bound(c, c+m, c[i]) - c)]++;
    vector <ll> d;
    for (auto &e : pos) {
        if (e == m) continue;
        int psh = 0;
        if (!d.empty() && d.back() < m-1 && d.back()+1 >= e) used[kk[d.back()+1]]++, d.emplace_back(d.back()+1), psh = 1;
        int idx = lower_bound(d.begin(), d.end(), e) - d.begin();
        if (used[e] < cnt[e]) idx = upper_bound(d.begin(), d.end(), e) - d.begin();
        if (idx != d.size()) used[kk[d[idx]]]--, used[e]++, d[idx] = e;
        else if (!psh) d.emplace_back(e), used[e]++;
    }
    cout << d.size() << '\n';
}

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