oj.uz

답안 #535760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
535760 2022-03-11T06:47:07 Z browntoad Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 1888 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e5+5;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
vector<int> bit(2*maxn);
int query(int x){
    int res=0;
    while(x>0){
        res=max(bit[x], res);
        x-=(x&-x);
    }
    return res;
}
void modify(int x, int val){
    while(x<maxn){
        bit[x]=max(bit[x], val);
        x+=(x&-x);
    }
}
bool cmp(pii a, pii b){
    if (b.f==a.f) return a.s>b.s;
    return a.f>b.f;
}
signed main (){
    IOS();
    int n,m; cin>>n>>m;
    vector<pii> vc(n);
    REP(i,n){
        cin>>vc[i].f>>vc[i].s;
    }
    vector<int> val(m);
    REP(i, m){
        cin>>val[i];
    }
    sort(ALL(val), greater<int> ());
    sort(ALL(vc), cmp);
    vector<int> dp(n);
    int pos=0;
    int res=0;
    REP(i, n){
        while(pos<m&&vc[i].f<=val[pos]){
            pos++;
        }
        //cout<<pos<<endl;
        int ans=1;
        REP(j, i){
            if (vc[j].s>=vc[i].s){
                ans=max(ans, dp[j]+1);
            }
        }
        ans=min(ans, pos);
        dp[i]=ans;
        //cout<<dp[i]<<endl;
        res=max(res, ans);
    }
    cout<<res<<endl;

}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1888 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Incorrect 1 ms 1876 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1888 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Incorrect 1 ms 1876 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1888 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Incorrect 1 ms 1876 KB Output isn't correct
6 Halted 0 ms 0 KB -