oj.uz

Submission #492891

# Submission time Handle Problem Language Result Execution time Memory
492891 2021-12-09T14:40:07 Z Biaz Exhibition (JOI19_ho_t2) C++17
0 / 100
 0 ms 332 KB 
#include <bits/stdc++.h>
#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=100005;
const int M=1000005;
const int MOD=1000000007;//998244353;
const int INF=1000000000000000000;//2147483647;

pi a[N];
int c[N],bit[N];
int n,m;
vector<int> LDS;
int get(int v){
    int l=0,r=LDS.size()-1,res=-1;
    while (r>=l){
        int md=(l+r)/2;
        if (LDS[md]<=v){
            res=md;
            r=md-1;
        }
        else l=md+1;
    }
    return res;
}
inline void sol(){
    cin >>n>>m;
    for (int i=1;i<=n;i++)
        cin >>a[i].se>>a[i].fi;
    for (int j=0;j<m;j++)
        cin >>c[j];
    sort(a+1,a+n+1,[](pi l,pi r){
        return l.fi==r.fi?l.se>r.se:l.fi>r.fi;
    });
    //for (int i=1;i<=n;i++)
        //cout <<a[i].fi<<' '<<a[i].se<<'\n';
    sort(c,c+m,greater<int>());
    for (int i=1;i<=n;i++){
        //cout <<a[i].se<<'*';
        if (LDS.size()==0){
            if (a[i].se<=c[LDS.size()])
                LDS.pb(a[i].se);
        }
        else if (a[i].se<=LDS.back()&&c[LDS.size()]>=a[i].se){
            LDS.pb(a[i].se);
        }
        else{
            int k=get(a[i].se);
            //if (c[k]>=a[i].se)
                LDS[k]=a[i].se;
        }
    }
    cout <<LDS.size()<<'\n';
}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Incorrect 0 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Incorrect 0 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Incorrect 0 ms 332 KB Output isn't correct
6 Halted 0 ms 0 KB -