oj.uz

답안 #572050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572050 2022-06-03T12:23:43 Z 1ne Exhibition (JOI19_ho_t2) C++14
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
const long long mxn = 1e12;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n,m;cin>>n>>m;
	vector<pair<long long ,long long>>arr(n);
	for (int i = 0;i<n;++i){
		cin>>arr[i].first>>arr[i].second;
	}
	vector<int>brr(m);
	for (int i = 0;i<m;++i)cin>>brr[i];
	sort(brr.begin(),brr.end());
	sort(arr.begin(),arr.end(),[&](auto x,auto y){
		return x.second < y.second;
	});
	
	function<int(int,int)> solve = [&](int cur,int pos){
		if (cur==n)return 0;
		int nxt = lower_bound(brr.begin(),brr.end(),arr[cur].first) - brr.begin();
		nxt = max(nxt,pos);
		while(nxt<m && brr[nxt]<arr[cur].first)++nxt;
		int ans = 0;
		ans = solve(cur + 1,pos);
		if (nxt!=m){
			ans = max(ans,solve(cur + 1,nxt + 1) + 1);
		}
		return ans;
	};
	int ans = solve(0,0);
	cout<<ans<<'\n';
	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 50.0

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