답안 #116735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
116735	2019-06-13T16:43:13 Z	ZwariowanyMarcin	Exhibition (JOI19_ho_t2)	C++14	100 / 100	80 ms	4600 KB

joi2019_ho_t2

// #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


#define pb push_back
#define ld long double
#define fi first
#define se second
#define ll long long
#define ss(x) (int) x.size()
#define mp make_pair
#define FOR(i, n) for(int i = 1; n >= i; ++i)

using namespace std;
using namespace __gnu_pbds;
const int nax = 100005;

int n, m;
pair<int, int> t[nax];
int v[nax];

int f(int x) {
	int res = 0;
	int j = m - x + 1;
	for(int i = 1; i <= n; ++i) {
		if(j > m)
			break;
		if(t[i].fi <= v[j]) {
			++res;
			++j;
		}
	}
	return res == x;
}
		

int main() {
	
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> t[i].fi >> t[i].se;
	}
	for(int i = 1; i <= m; ++i) {
		cin >> v[i];
	}
	sort(t + 1, t + n + 1, [](pair<int, int> a, pair<int, int> b) {
		if(a.se != b.se)
			return a.se < b.se;
		return a.fi < b.fi;
	});
	sort(v + 1, v + m + 1);
	int l = 0, r = min(n, m);
	while(l < r) {
		int mid = (l + r + 1) / 2;
		if(f(mid))
			l = mid;
		else
			r = mid - 1;
	}
	cout << l;
	
	
	
    return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	424 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	424 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	356 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	2 ms	424 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	2 ms	356 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	3 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	3 ms	384 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	2 ms	384 KB	Output is correct
33	Correct	2 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	2 ms	384 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	56 ms	4476 KB	Output is correct
39	Correct	48 ms	4412 KB	Output is correct
40	Correct	48 ms	4472 KB	Output is correct
41	Correct	58 ms	4472 KB	Output is correct
42	Correct	53 ms	4348 KB	Output is correct
43	Correct	52 ms	4472 KB	Output is correct
44	Correct	80 ms	4472 KB	Output is correct
45	Correct	54 ms	4472 KB	Output is correct
46	Correct	51 ms	4472 KB	Output is correct
47	Correct	49 ms	4040 KB	Output is correct
48	Correct	47 ms	4048 KB	Output is correct
49	Correct	43 ms	3676 KB	Output is correct
50	Correct	41 ms	3576 KB	Output is correct
51	Correct	55 ms	4472 KB	Output is correct
52	Correct	51 ms	4472 KB	Output is correct
53	Correct	52 ms	4344 KB	Output is correct
54	Correct	46 ms	4472 KB	Output is correct
55	Correct	51 ms	4472 KB	Output is correct
56	Correct	32 ms	3072 KB	Output is correct
57	Correct	20 ms	1792 KB	Output is correct
58	Correct	32 ms	3064 KB	Output is correct
59	Correct	37 ms	3164 KB	Output is correct
60	Correct	21 ms	1792 KB	Output is correct
61	Correct	34 ms	2688 KB	Output is correct
62	Correct	58 ms	4492 KB	Output is correct
63	Correct	59 ms	4476 KB	Output is correct
64	Correct	57 ms	4480 KB	Output is correct
65	Correct	60 ms	4472 KB	Output is correct
66	Correct	59 ms	4472 KB	Output is correct
67	Correct	59 ms	4352 KB	Output is correct
68	Correct	59 ms	4472 KB	Output is correct
69	Correct	59 ms	4600 KB	Output is correct
70	Correct	56 ms	4472 KB	Output is correct
71	Correct	58 ms	4344 KB	Output is correct
72	Correct	56 ms	4480 KB	Output is correct
73	Correct	56 ms	4464 KB	Output is correct

답안 #116735

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