Submission #136335

#	Time	Username	Problem	Language	Result	Execution time	Memory
136335		briansu	Exhibition (JOI19_ho_t2)	C++14	0 / 100	2 ms	380 KiB

joi2019_ho_t2

//{
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define SZ(_a) (int)_a.size()
#define ALL(_a) _a.begin(),_a.end()
#define pb push_back
#ifdef brian
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // brian
//}


const ll MAXn=1e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=ll(1e15);

ll dt[MAXn];
ii d[MAXn];

int main()
{
    IOS();
    ll n, m;
    cin>>n>>m;
    REP(i, n)cin>>d[i].X>>d[i].Y;
    REP(i, m)cin>>dt[i];
    sort(d, d + n, greater<ii>());
    sort(dt, dt + m, greater<ll>());
    vector<ll> v;
    REP(i, n)
    {
        if(!SZ(v) || d[i].Y <= v.back())
        {
            if(d[i].X <= dt[SZ(v)])v.pb(d[i].Y);
        }
        else
        {
            ll t = upper_bound(ALL(v), d[i].Y, greater<ll>()) - v.begin();
            if(d[i].X <= dt[t])v[t] = d[i].Y;
        }
        debug(i, v);
    }
    cout<<SZ(v)<<endl;
}

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