제출 #483101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483101		jalsol	Exhibition (JOI19_ho_t2)	C++17	50 / 100	5 ms	4300 KiB

joi2019_ho_t2

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
#define TASK "empty"
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// =============================================================================

constexpr int maxn = 1e3 + 5;

struct Pic {
    int size, val;

    bool operator<(const Pic& o) const {
        if (val != o.val) return val < o.val;
        return size < o.size;
    }
};

int n, nf;
Pic a[maxn];
int frame[maxn];

int dp[maxn][maxn];

signed main() {
    cin >> n >> nf;
    For (i, 1, n) cin >> a[i].size >> a[i].val;
    For (i, 1, nf) cin >> frame[i];

    sort(a + 1, a + n + 1);
    sort(frame + 1, frame + nf + 1);

    For (i, 1, n) {
        int maxi = 0;

        For (j, 1, nf) {
            dp[i][j] = dp[i - 1][j];
        }

        For (j, 1, nf) {
            if (a[i].size <= frame[j]) {
                chmax(dp[i][j], maxi + 1);
            }
            chmax(maxi, dp[i - 1][j]);
        }
    }


    int ans = 0;
    For (j, 1, nf) {
        chmax(ans, dp[n][j]);
    }

    cout << ans << '\n';
}

// not quite there for subtask 2...
// not even sure if this dp method is correct...

// and the answer is no.
// let's hope something would change after this fix
// there is only one way to know...

// fuck off...
// I mean the idea is flawed in the beginning
// this probably will not help

// goddamn it

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