제출 #720977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
720977		Pring	Exhibition (JOI19_ho_t2)	C++14	50 / 100	22 ms	8184 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int, int> pii;

const int MXN = 1005;
int n, m, fr[MXN], dp[MXN][MXN], lastC, ans, pre[MXN];

struct P {
    int sz, val;
    P() {
        sz = 0;
        val = 0;
    }
    P(int _sz, int _val) {
        sz = _sz;
        val = _val;
    }
} pic[MXN];

void getDP(int id) {
    // cout << "id: " << id << endl;
    lastC = 0;
    while (pic[id].sz > fr[lastC]) lastC++;
    // cout << "lastC: " << lastC << endl;
    // vector<int> avail;
    // for (int i = 0; i < id; i++) if (pic[i].val <= pic[id].val) avail.push_back(i);
    // cout << "avail: ";
    // for (auto &i : avail) cout << i << ' ';
    // cout << endl;
    for (int i = lastC; i < m; i++) {
        // dp[id][i] = 1;
        dp[id][i] = max(1LL, pre[i - 1] + 1);
        // pre[i] = max(pre[i], dp[id][i]);
        // for (auto &j : avail) {
        //     dp[id][i] = max(dp[id][i], dp[j][i - 1] + 1);
        // }
    }
    for (int i = 0; i < m; i++) pre[i] = max(pre[i], dp[id][i]);
    ans = max(ans, dp[id][m - 1]);
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> pic[i].sz >> pic[i].val;
    for (int i = 0; i < m; i++) cin >> fr[i];
    sort(pic, pic + n, [](P &a, P &b) {
        return (a.val == b.val ? a.sz < b.sz : a.val < b.val);
    });
    sort(fr, fr + m);
    fr[m] = LLONG_MAX;
    for (int i = 0; i < n; i++) {
        getDP(i);
    }
    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < m; j++) {
    //         cout << dp[i][j] << ' ';
    //     }
    //     cout << endl;
    // }
    cout << ans << endl;
    return 0;
}

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