제출 #1277831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277831		quanduongxuan12	Exhibition (JOI19_ho_t2)	C++20	0 / 100	1 ms	576 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define name "exhibition"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n,m;
ii a[MAXN];
int b[MAXN];
int l[MAXN];
ii dp[MAXN];
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>m;
    FOR(i,1,n) cin>>a[i].sc>>a[i].fs;
    FOR(i,1,m) cin>>b[i];
    sort(a+1,a+n+1);
    sort(b+1,b+m+1);
    FOR(i,1,n){
        l[i]=lower_bound(b+1,b+m+1,a[i].sc)-b;
    }
    FOR(i,1,n){
        if (l[i]>m) continue;
        dp[i]={1,l[i]};
        FOR(j,1,i-1){
            if (dp[j].fs+1>dp[i].fs&&dp[j].sc<m){
                dp[i].fs=dp[j].fs+1;
                dp[i].sc=max(l[i],dp[j].sc+1);
            }
            else if (dp[j].fs+1==dp[i].fs&&dp[j].sc<m){
                dp[i].sc=min(dp[i].sc,max(l[i],dp[j].sc+1));
            }
        }
    }
    int res=0;
    FOR(i,1,n) res=max(res,dp[i].fs);
    cout<<res;
    return 0;
}

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