Submission #136344

#	Time	Username	Problem	Language	Result	Execution time	Memory
136344		Utaha	Exhibition (JOI19_ho_t2)	C++14	0 / 100	2 ms	376 KiB

joi2019_ho_t2

/*input
8 8
508917604 35617051
501958939 840246141
485338402 32896484
957730250 357542366
904165504 137209882
684085683 775621730
552953629 20004459
125090903 607302990
433255278
979756183
28423637
856448848
276518245
314201319
666094038
149542543
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb emplace_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<'('<<P.F<<','<<P.S<<')';
    return out;
}
#define version 20190713
//}}}
const ll maxn=300005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        
        b>>=1;
    }
    return res;
}

pii p[maxn];
int kung[maxn];

vector<pii> v;

int main(){
    IOS;
    int n,m;
    cin>>n>>m;
    REP(i,n) cin>>p[i].F>>p[i].S;
    REP(i,m) cin>>kung[i];
    sort(kung,kung+m,greater<int>());
    sort(p,p+n,greater<pii>());

    REP(i,n){
        int idx=SZ(v);
        if(SZ(v)&&p[i].S>v.back().S){
            int l=0,r=SZ(v);
            while(l!=r-1){
                int mid=(l+r)/2;
                if(p[i].S>v[mid].S) r=mid;
                else l=mid;
            }
            idx=r;
        }
        if(kung[idx]>=p[i].F){
            if(SZ(v)==idx) v.resize(SZ(v)+1);
            v[idx]=p[i];
        }
    }
    cout<<SZ(v)<<'\n';
    return 0;
}

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