Submission #669243

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
669243	2022-12-06T05:04:19 Z	pavement	Exhibition (JOI19_ho_t2)	C++17	100 / 100	51 ms	7200 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;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, S[100005], V[100005], C[100005];
ii T[100005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		cin >> S[i] >> V[i];
		T[i] = mp(V[i], S[i]);
	}
	sort(T + 1, T + 1 + N);
	for (int i = 1; i <= M; i++) {
		cin >> C[i];
	}
	sort(C + 1, C + 1 + M);
	int lo = 0, hi = M, ans = -1;
	while (lo <= hi) {
		int mid = (lo + hi) / 2, ptr = 1;
		bool bad = 0;
		for (int i = M - mid + 1; i <= M; i++) {
			while (ptr <= N && T[ptr].second > C[i]) ptr++;
			if (ptr > N) {
				bad = 1;
				break;
			} else ptr++;
		}
		if (bad) hi = mid - 1;
		else ans = mid, lo = mid + 1;
	}
	cout << ans << '\n';
}

Compilation message

joi2019_ho_t2.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main() {
      | ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	336 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	336 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	480 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	44 ms	7024 KB	Output is correct
39	Correct	43 ms	7148 KB	Output is correct
40	Correct	41 ms	7132 KB	Output is correct
41	Correct	45 ms	7152 KB	Output is correct
42	Correct	46 ms	7200 KB	Output is correct
43	Correct	44 ms	7116 KB	Output is correct
44	Correct	46 ms	7068 KB	Output is correct
45	Correct	44 ms	6988 KB	Output is correct
46	Correct	44 ms	7036 KB	Output is correct
47	Correct	43 ms	6588 KB	Output is correct
48	Correct	38 ms	6548 KB	Output is correct
49	Correct	36 ms	5580 KB	Output is correct
50	Correct	38 ms	5580 KB	Output is correct
51	Correct	44 ms	7096 KB	Output is correct
52	Correct	46 ms	7084 KB	Output is correct
53	Correct	44 ms	7044 KB	Output is correct
54	Correct	39 ms	7076 KB	Output is correct
55	Correct	44 ms	7032 KB	Output is correct
56	Correct	26 ms	5324 KB	Output is correct
57	Correct	16 ms	2084 KB	Output is correct
58	Correct	28 ms	5332 KB	Output is correct
59	Correct	27 ms	5340 KB	Output is correct
60	Correct	17 ms	2012 KB	Output is correct
61	Correct	27 ms	3752 KB	Output is correct
62	Correct	47 ms	7112 KB	Output is correct
63	Correct	51 ms	7068 KB	Output is correct
64	Correct	48 ms	7128 KB	Output is correct
65	Correct	49 ms	7116 KB	Output is correct
66	Correct	50 ms	7132 KB	Output is correct
67	Correct	51 ms	7024 KB	Output is correct
68	Correct	47 ms	7000 KB	Output is correct
69	Correct	49 ms	7108 KB	Output is correct
70	Correct	49 ms	7064 KB	Output is correct
71	Correct	47 ms	7116 KB	Output is correct
72	Correct	45 ms	7116 KB	Output is correct
73	Correct	46 ms	7012 KB	Output is correct

Submission #669243

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