Submission #234859

#	Time	Username	Problem	Language	Result	Execution time	Memory
234859		wiwiho	Exhibition (JOI19_ho_t2)	C++14	0 / 100	5 ms	384 KiB

joi2019_ho_t2

//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}


int main(){
    StarBurstStream

    int n, m;
    cin >> n >> m;

    vector<pii> a(n);
    for(int i =0 ; i < n; i++) cin >> a[i].S >> a[i].F;

    vector<int> c(m);
    for(int i = 0; i < m; i++) cin >> c[i];

    lsort(a);
    lsort(c);

    vector<ll> dp(m);
    for(int i = 0; i < n; i++){
        vector<ll> dp2(m);
        ll mx = 0;
        for(int j = 0; j < m; j++){
            if(a[i].S <= c[j]) dp2[j] = mx + 1;
            mx = max(mx, dp[j]);
        }
        dp = dp2;
    }

    cout << *max_element(iter(dp));

    return 0;
}

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