Submission #1097520

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1097520	2024-10-07T14:22:06 Z	Nurislam	Exhibition (JOI19_ho_t2)	C++17	100 / 100	65 ms	5712 KB

joi2019_ho_t2

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> 
//#include <ext/pb_ds/tree_policy.hpp>  
using namespace std;
//using namespace __gnu_pbds;z
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
//#define ordst tree<pair<int,int>,  null_type,  less<pair<int,int>>,  rb_tree_tag ,  tree_order_statistics_node_update >
//#define double long double 
template <class F, class _S>
bool chmin(F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v; flag |= true;
	}
	return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v; flag |= true;
	}
	return flag;
}

const int N = (1<<18) +1, inf = 1e18+200;
//int mod = 998244353;
//int mod = 1000000007;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)

void solve(){
	int n, m;
	cin >> n >> m;
	vector<array<int,2>> pic(n);
	for(auto &[i, j]:pic)cin >> j >> i;
	vector<int> siz(m);
	for(int &i:siz)cin >> i;
	sort(all(pic));sort(all(siz));
	
	auto ok = [&](int x) -> bool{
		int it = 0;
		for(int i = m-x; i < m; i ++){
			while(it < n && siz[i] < pic[it][1])it++;
			if(it == n)return false;
			it++;
		}
		return true;
	};
	
	int l = 0, r = min(n,m)+1;
	while(l+1 < r){
		int mid = (l+r)>>1;
		if(ok(mid))l = mid;
		else r = mid;
	}
	cout << l << '\n';
}

 
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--){
		solve();
	}
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	452 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	452 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct
27	Correct	1 ms	600 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	0 ms	464 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	452 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	456 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	468 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct
27	Correct	1 ms	600 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	604 KB	Output is correct
35	Correct	0 ms	464 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	61 ms	5580 KB	Output is correct
39	Correct	41 ms	5460 KB	Output is correct
40	Correct	44 ms	5712 KB	Output is correct
41	Correct	45 ms	5692 KB	Output is correct
42	Correct	49 ms	5692 KB	Output is correct
43	Correct	45 ms	5468 KB	Output is correct
44	Correct	42 ms	5460 KB	Output is correct
45	Correct	44 ms	5668 KB	Output is correct
46	Correct	46 ms	5668 KB	Output is correct
47	Correct	39 ms	5104 KB	Output is correct
48	Correct	46 ms	4948 KB	Output is correct
49	Correct	37 ms	4468 KB	Output is correct
50	Correct	35 ms	4628 KB	Output is correct
51	Correct	42 ms	5452 KB	Output is correct
52	Correct	52 ms	5708 KB	Output is correct
53	Correct	44 ms	5616 KB	Output is correct
54	Correct	39 ms	5608 KB	Output is correct
55	Correct	43 ms	5600 KB	Output is correct
56	Correct	31 ms	3948 KB	Output is correct
57	Correct	14 ms	2008 KB	Output is correct
58	Correct	30 ms	3944 KB	Output is correct
59	Correct	27 ms	3928 KB	Output is correct
60	Correct	17 ms	2132 KB	Output is correct
61	Correct	29 ms	3208 KB	Output is correct
62	Correct	43 ms	5472 KB	Output is correct
63	Correct	51 ms	5460 KB	Output is correct
64	Correct	49 ms	5604 KB	Output is correct
65	Correct	47 ms	5456 KB	Output is correct
66	Correct	46 ms	5692 KB	Output is correct
67	Correct	46 ms	5696 KB	Output is correct
68	Correct	49 ms	5616 KB	Output is correct
69	Correct	65 ms	5596 KB	Output is correct
70	Correct	47 ms	5692 KB	Output is correct
71	Correct	44 ms	5456 KB	Output is correct
72	Correct	41 ms	5464 KB	Output is correct
73	Correct	49 ms	5460 KB	Output is correct

Submission #1097520

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0