Submission #463815

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
463815	2021-08-11T19:42:53 Z	wind_reaper	Exhibition (JOI19_ho_t2)	C++17	100 / 100	77 ms	4412 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;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************



//***************** GLOBAL VARIABLES *****************



//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int N, M;
	cin >> N >> M;

	array<int, 2> A[N];

	for(auto& [v, s] : A)
		cin >> s >> v;

	int B[M];
	for(int &s : B) cin >> s;

	sort(A, A + N);
	sort(B, B + M);

	int lo = 0, hi = M, ans = 0;

	while(lo <= hi){
		int mid = (lo + hi) >> 1;
		int j = 0;
		for(int i = 0; i < N && j < mid; i++){
			auto [v, s] = A[i];
			j += (s <= B[M - mid + j]);
		}

		if(j == mid){
			lo = mid + 1;
			ans = mid;
		}
		else hi = mid - 1;
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic

4. If the code gives an inexplicable TLE, and you are sure you have the best possible complexity,
use faster io
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	312 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	356 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	66 ms	4404 KB	Output is correct
39	Correct	62 ms	4276 KB	Output is correct
40	Correct	57 ms	4272 KB	Output is correct
41	Correct	63 ms	4272 KB	Output is correct
42	Correct	64 ms	4260 KB	Output is correct
43	Correct	62 ms	4292 KB	Output is correct
44	Correct	63 ms	4280 KB	Output is correct
45	Correct	64 ms	4264 KB	Output is correct
46	Correct	65 ms	4260 KB	Output is correct
47	Correct	59 ms	3880 KB	Output is correct
48	Correct	56 ms	3884 KB	Output is correct
49	Correct	50 ms	3520 KB	Output is correct
50	Correct	50 ms	3524 KB	Output is correct
51	Correct	67 ms	4396 KB	Output is correct
52	Correct	65 ms	4280 KB	Output is correct
53	Correct	64 ms	4280 KB	Output is correct
54	Correct	55 ms	4384 KB	Output is correct
55	Correct	65 ms	4388 KB	Output is correct
56	Correct	43 ms	3012 KB	Output is correct
57	Correct	21 ms	1668 KB	Output is correct
58	Correct	36 ms	3000 KB	Output is correct
59	Correct	37 ms	3004 KB	Output is correct
60	Correct	21 ms	1676 KB	Output is correct
61	Correct	36 ms	2488 KB	Output is correct
62	Correct	63 ms	4272 KB	Output is correct
63	Correct	62 ms	4372 KB	Output is correct
64	Correct	64 ms	4376 KB	Output is correct
65	Correct	63 ms	4268 KB	Output is correct
66	Correct	63 ms	4292 KB	Output is correct
67	Correct	63 ms	4268 KB	Output is correct
68	Correct	77 ms	4264 KB	Output is correct
69	Correct	64 ms	4388 KB	Output is correct
70	Correct	64 ms	4292 KB	Output is correct
71	Correct	63 ms	4372 KB	Output is correct
72	Correct	65 ms	4272 KB	Output is correct
73	Correct	61 ms	4412 KB	Output is correct

Submission #463815

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