Submission #1015431

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015431		Minbaev	Exhibition (JOI19_ho_t2)	C++17	0 / 100	1 ms	348 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int md = 998244353;
const int N = 2e5 + 5;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;

void solve(){
	
	cin >> n >> m;
	vector<pii>v(n);
	vector<int>vs(m+1);
	for(auto &to:v)cin >> to.s >> to.f;
	for(int i = 1;i<=m;i++)cin >> vs[i];
	
	sort(all(vs));
	sort(all(v));
	vector<int>dp(m+1);
	
	for(int i = 0;i<n;i++){
		int ind = -1;
		for(int j = m;j>=0;j--){
			if(ind > -1 && (dp[j] || !j)){
				umax(dp[ind], dp[j]+1);
			}
			else{
				if(v[i].s <= vs[j])ind = j;
			}
		}
	}
	//~ for(int i = 0;i<m;i++){
		//~ cout << dp[i] << " ";
	//~ }
	int mx = *max_element(all(dp));
	cout << mx << "\n";
	
}
 /*
 209715
 */
 signed main()
{
	//~ freopen("babochkain.txt", "r", stdin);
	//~ freopen("babochkaout.txt", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}
 

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