Submission #1260651

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260651		hoa208	Exhibition (JOI19_ho_t2)	C++20	0 / 100	0 ms	328 KiB

joi2019_ho_t2

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for (int i = (b), _a = (a); i >= _a; i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) ((mask >> j) & 1)
#define t_test int t;cin >> t;while(t--)
const   ll mod = 1e9 + 7;
const   ll INF = 1e17;
inline  void adm(ll &x){if(x>=mod)x%=mod;else if(x<0)x+=mod;}
//--------------------------------------------------------------------
const ll N =  1e5 + 10;
struct Node {
    ll val, id;
} st[4 * N];
ll n, m;
pa a[N];
ll c[N], del[N];
void update(ll x, ll val, ll id = 1, ll l = 1, ll r = n) {
    if(x < l || x > r) return;
    if(l == r) {
        st[id].val = val;
        st[id].id = l;
        return;
    }
    ll mid = l + r >> 1;
    update(x, val, id << 1, l, mid);
    update(x, val, id << 1 | 1, mid + 1, r);
    if(st[id << 1].val > st[id << 1 | 1].val) {
        st[id] = st[id << 1];
        return;
    }
    if(st[id << 1].val == st[id << 1 | 1].val) {
        st[id] = (a[st[id << 1].id].fi > a[st[id << 1 | 1].id].fi ? st[id << 1] : st[id << 1 | 1]);
        return;
    }
    st[id] = st[id << 1 | 1];
}
Node get(ll u, ll v, ll id = 1, ll  l = 1, ll r = n) {
    if(u > r || v < l) {
        return {-INF, -1};
    }
    if(u <= l && v >= r) {
        return st[id];
    }
    ll mid = l + r >> 1;
    Node x = get(u, v, id << 1 , l, mid);
    Node y = get(u, v, id << 1 | 1, mid + 1, r);
    if(x.val > y.val) {
        return x;
    }
    if(x.val == y.val) {
        return a[x.id].fi > a[y.id].fi ? x : y;
    }
    return y;
}
void hbmt() {
    cin >> n >> m;
    FOR(i, 1, n) cin >> a[i].fi >> a[i].se;
    sort(a + 1, a + n + 1);

    FOR(i, 1, m) {
        cin >> c[i];
    }
    FOR(i, 1, n) {
        update(i, a[i].se);
    }
    sort(c + 1,c + m + 1);
    ll mx = INF;
    ll cnt = 0;
    ll _n = n;
    while(_n > 0 && m > 0) {
        if(a[_n].fi > c[m] || del[_n] == 1) {
            _n--;
            continue;
        }
        while(true) {
            Node x = get(1, _n);
            if(x.val == -INF) {
                cout << cnt;
                return;
            }
            del[x.id] = 1;
            update(x.id,-INF);
            if(x.val <= mx) {
                mx = x.val;
                cnt++;
                break;
            }
        }
        _n--, m--;
    }
    cout << cnt;
}

int main() {
    
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    if(fopen("hbmt.inp", "r")) {
        freopen("hbmt.inp", "r", stdin);
        freopen("hbmt.out", "w", stdout);
    }
    
    // t_test 
    hbmt();
    return 0;
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:105:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         freopen("hbmt.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:106:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |         freopen("hbmt.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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