Submission #1181323

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181323		TudorMa	Exhibition (JOI19_ho_t2)	C++20	0 / 100	0 ms	400 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fi first
#define sc second
#define pb push_back

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
template<typename type>
using ordered_set = tree<type, null_type, less<type>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 5, mod = 1e9 + 7, inf = 2e9;
const int dl[] = {-1, 0, 1, 0}, dc[] = {0, 1, 0, -1};
const int ddl[] = {-1, -1, -1, 0, 1, 1, 1, 0}, ddc[] = {-1, 0, 1, 1, 1, 0, -1, -1};

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());
int rng(int lo = 1, int hi = INT_MAX) {
    uniform_int_distribution<int> rnd(lo, hi);
    return rnd(gen);
}

struct mint {
    int val;
    mint(int32_t x = 0) {
        val = x % mod;
    }
    mint(long long x) {
        val = x % mod;
    }
    mint operator+(mint x) {
        return val + x.val;
    }
    mint operator-(mint x) {
        return val - x.val + mod;
    }
    mint operator*(mint x) {
        return 1LL * val * x.val;
    }
    void operator+=(mint x) {
        val = (*this + x).val;
    }
    void operator-=(mint x) {
        val = (*this - x).val;
    }
    void operator*=(mint x) {
        val = (*this * x).val;
    }
    friend auto operator>>(istream& in, mint &x) -> istream& {
        in >> x.val;
        x.val %= mod;
        return in;
    }
    friend auto operator<<(ostream& out, mint const &x) -> ostream& {
        out << x.val;
        return out;
    }
};

int n, m, c[N], dp[N];
pii v[N];

bool check(int x) {
    int maxi = 0;
    for(int i=1; i<=n; i++) {
        dp[i] = min(x, maxi+1);
        if(v[i].sc > c[m-x+dp[i]])
            dp[i] = 0;
        maxi = max(maxi, dp[i]);
    }

    return maxi == x;
}

int32_t main()
{
    cin.tie(nullptr)->sync_with_stdio(0);
    
    cin >> n >> m;
    for(int i=1; i<=n; i++)
        cin >> v[i].sc >> v[i].fi;
    for(int i=1; i<=m; i++)
        cin >> c[i];

    sort(v+1, v+n+1, [&](pii a, pii b) {
        if(a.fi != b.fi)
            return a.fi < b.fi;
        return a.sc > b.sc;
    });
    sort(c+1, c+m+1);

    int st = 0, dr = min(n, m), lst = -1;
    while(st <= dr) {
        int mij = (st + dr) / 2;
        if(check(mij)) {
            lst = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }

    cout << lst;
    return 0;
}

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