제출 #1227361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1227361		arkanefury	Exhibition (JOI19_ho_t2)	C++20	0 / 100	50 ms	328 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define int long long
#define S second
#define sz size()
#define all(v) v.begin(),v.end()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N = 2e5+5;
int a[N], ans, inf = 1e18, par = 0, c[N];
int n,m,k,sum=0,x,y, r, cnt, l, mod = 1e9+7;
multiset<pair<int, int>>st;
multiset<pair<int, int>>st1;
vector<pair<int, int>>v;
void rec(int pos = 0){
    FOR(i, pos, n-1, 1){
        if(!st.sz || st.sz && (*st.rbegin()).F <= v[i].F && (*st.rbegin()).S <= v[i].S){
        st.in(v[i]);
        rec(pos+1);
        st.erase(st.find(v[i]));
        }
    }
    pair<int, int>ko = {0, 0}, x;
    for(auto i : st){ 
        if(ko.F < i.F)ko = {i.F, 0};
        x = *st1.lb(ko);
        if(x.F == (int)1e10)return;
        ko = {x.F, x.S + 1};
    }
    ans = max(ans, (int)st.sz);
}
void solve() {
	nikita
	cin >> n >> m;
	FOR(i, 0, n-1, 1){
	    cin >> x >> y;
	    v.pb({x, y});
	}
	sort(all(v));
	FOR(i, 1, m, 1)cin >> a[i], st1.in({a[i], i});
	st1.in({(int)1e10, (int)1e18});
	rec();
	cout << ans;
}
signed main() {
	nikita
//	freopen("cardgame.in", "r", stdin);
//    freopen("cardgame.out", "w", stdout);
	int tt = 1;
	if(!tt)cin >> tt;
	FOR(i, 1, tt, 1)solve();
}/*
cin >> n >> m;
	FOR(i,1 , n, 1)cin >> a[i];
	sort(a+1, a+n+1);
	l = a[1], r = a[n];
	while(l <= r){
	    int md = (l + r) >> 1;
	    sum = cnt = 0;
	    FOR(i, 1, n, 1){
	        sum += max(md - a[i], (int)0);
	        cnt += max((int)0, a[i] - md - m);
	    }
	    if(cnt >= sum)l = md + 1;, ans = md;
	    else r = md - 1;
	}
	
*/

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