結果

問題 No.2422 regisys?
ユーザー poyonpoyon
提出日時 2023-08-12 15:11:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,921 bytes
コンパイル時間 3,356 ms
コンパイル使用メモリ 239,604 KB
実行使用メモリ 31,180 KB
最終ジャッジ日時 2024-11-20 00:07:20
合計ジャッジ時間 11,296 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 WA -
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 WA -
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 2 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 AC 101 ms
14,744 KB
testcase_32 AC 170 ms
13,136 KB
testcase_33 AC 89 ms
14,552 KB
testcase_34 AC 68 ms
7,348 KB
testcase_35 AC 108 ms
15,756 KB
testcase_36 AC 121 ms
10,572 KB
testcase_37 AC 180 ms
16,152 KB
testcase_38 AC 134 ms
10,764 KB
testcase_39 AC 86 ms
8,412 KB
testcase_40 AC 57 ms
9,532 KB
testcase_41 AC 86 ms
8,124 KB
testcase_42 AC 184 ms
26,608 KB
testcase_43 AC 117 ms
11,444 KB
testcase_44 AC 205 ms
27,156 KB
testcase_45 AC 168 ms
25,440 KB
testcase_46 AC 206 ms
26,976 KB
testcase_47 AC 137 ms
15,992 KB
testcase_48 AC 194 ms
28,044 KB
testcase_49 AC 181 ms
17,864 KB
testcase_50 AC 171 ms
27,116 KB
testcase_51 AC 316 ms
29,096 KB
testcase_52 AC 89 ms
14,928 KB
testcase_53 AC 215 ms
27,144 KB
testcase_54 AC 318 ms
30,456 KB
testcase_55 AC 225 ms
27,592 KB
testcase_56 AC 221 ms
18,324 KB
testcase_57 AC 357 ms
31,180 KB
testcase_58 AC 363 ms
31,052 KB
testcase_59 AC 364 ms
30,872 KB
testcase_60 AC 359 ms
31,060 KB
testcase_61 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// clang-format off
#ifdef _LOCAL
    #include <pch.hpp>
#else
    #include <bits/stdc++.h>
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(...)
    #define debug2(vv)
    #define debug3(vvv)
#endif

using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VC = vector<char>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define FORE(e,c) for (auto&& e : c)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define len(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) ((ll)__builtin_popcountll(b))
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); (c).shrink_to_fit(); } while (0)
#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)
constexpr ld EPS = 1e-10;
constexpr ld PI  = acosl(-1.0);
constexpr int inf = (1 << 30) - (1 << 15);   // 1,073,709,056
constexpr ll INF = (1LL << 62) - (1LL << 31);  // 4,611,686,016,279,904,256
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class P1, class P2> void print(const pair<P1, P2>& a) { cout << a.first << " " << a.second << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> void print(const vector<T>& a) { cout_line(a, 0, a.size()); }
template<class S, class T> bool chmin(S& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class S, class T> bool chmax(S& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
template<class T> string to_binary(T x, int B = 0) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; } reverse(s.begin(), s.end()); return s; }
template<class F> ll binary_search(const F& is_ok, ll ok, ll ng) { while (abs(ok - ng) > 1) { ll m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class F> double binary_search_real(const F& is_ok, double ok, double ng, int iter = 90) { for (int i = 0; i < iter; i++) { double m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class T> using PQ_max = priority_queue<T>;
template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;
template<class T> T pick(stack<T>& s) { assert(not s.empty()); T x = s.top(); s.pop(); return x; }
template<class T> T pick(queue<T>& q) { assert(not q.empty()); T x = q.front(); q.pop(); return x; }
template<class T> T pick_front(deque<T>& dq) { assert(not dq.empty()); T x = dq.front(); dq.pop_front(); return x; }
template<class T> T pick_back(deque<T>& dq) { assert(not dq.empty()); T x = dq.back(); dq.pop_back(); return x; }
template<class T> T pick(PQ_min<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(PQ_max<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(vector<T>& v) { assert(not v.empty()); T x = v.back(); v.pop_back(); return x; }
int to_int(const char c) { if (islower(c)) { return (c - 'a'); } if (isupper(c)) { return (c - 'A'); } if (isdigit(c)) { return (c - '0'); } assert(false); }
char to_a(const int i) { assert(0 <= i && i < 26); return ('a' + i); }
char to_A(const int i) { assert(0 <= i && i < 26); return ('A' + i); }
char to_d(const int i) { assert(0 <= i && i <= 9); return ('0' + i); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll mod(ll x, ll m) { assert(m > 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digitlen(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll msb(ll b) { return (b <= 0 ? -1 : (63 - __builtin_clzll(b))); }
ll lsb(ll b) { return (b <= 0 ? -1 : __builtin_ctzll(b)); }
// --------------------------------------------------------

// clang-format on
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, M;
    input(N, M);
    VLL A(N);
    REP (i, N) { input(A[i]); }
    VLL B(N);
    REP (i, N) { input(B[i]); }
    VLL T(M), C(M);
    REP (i, M) { input(T[i], C[i]); }

    ll ans = N;

    [&]() -> void {
        vector<tuple<ll, ll, ll>> X;
        REP (i, N) {
            X.emplace_back(A[i], 0, i);
            X.emplace_back(B[i], 1, i);
        }
        RSORT(X);

        PQ_max<ll> pq0, pq1;
        VLL rem(2);
        REP (i, M) {
            auto& pq = (T[i] == 0 ? pq0 : pq1);
            pq.push(C[i]);
        }

        VB used(N);
        ll res = N;
        for (auto [v, t, i] : X) {
            auto& pq = (t == 0 ? pq0 : pq1);
            if (used[i]) { continue; }
            while (len(pq)) {
                ll c = pq.top();
                if (v <= c) {
                    pq.pop();
                    rem[t]++;
                } else {
                    break;
                }
            }
            if (rem[t]) {
                rem[t]--;
                res--;
                used[i] = true;
                debug(t + 1, i + 1, v);
            }
        }
        chmin(ans, res);
    }();

    [&]() -> void {
        vector<tuple<ll, ll, ll>> X;
        REP (i, N) {
            X.emplace_back(A[i], 0, i);
            X.emplace_back(B[i], 1, i);
        }
        SORT(X);

        PQ_min<ll> pq0, pq1;
        REP (i, M) {
            auto& pq = (T[i] == 0 ? pq0 : pq1);
            pq.push(C[i]);
        }

        VB used(N);
        ll res = N;
        for (auto [v, t, i] : X) {
            auto& pq = (t == 0 ? pq0 : pq1);
            if (used[i]) { continue; }
            while (len(pq)) {
                auto c = pick(pq);
                if (v <= c) {
                    res--;
                    used[i] = true;
                    break;
                }
            }
        }
        chmin(ans, res);
    }();

    VB used(N);
    VP X(N);
    REP (i, N) { X[i] = {A[i], i}; }
    SORT(X);

    VLL C0;
    multiset<ll> C1;
    REP (i, M) {
        if (T[i] == 0) {
            C0.push_back(C[i]);
        } else {
            C1.insert(C[i]);
        }
    }
    SORT(C0);

    ll x = 0;
    ll res = N;
    VLL memo;
    FORE(c, C0) {
        if (x == N) { break; }
        auto [a, i] = X[x];
        if (a <= c) {
            x++;
            used[i] = true;
            memo.push_back(B[i]);
            res--;
        }
    }
    SORT(memo);
    chmin(ans, res);

    PQ_min<ll> pq_B;
    REP (i, N) {
        if (not used[i]) { pq_B.push(B[i]); }
    }

    auto f = [&]() -> void {
        while (len(C1) && len(pq_B)) {
            ll b = pq_B.top();
            auto it = C1.lower_bound(b);
            if (it == C1.end()) { break; }
            C1.erase(it);
            res--;
            pq_B.pop();
        }
        chmin(ans, res);
    };

    f();
    FORE(b, memo) {
        res++;
        pq_B.push(b);
        f();
    }
    print(ans);

    return 0;
}
0