Submission #349774

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
349774	2021-01-18T11:08:52 Z	pavement	Exhibition (JOI19_ho_t2)	C++17	100 / 100	57 ms	7296 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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#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)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, M, idx, 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 >> T[i].second >> T[i].first;
	sort(T + 1, T + 1 + N);
	for (int i = 1; i <= N; i++) tie(V[i], S[i]) = T[i];
	for (int i = 1; i <= M; i++) cin >> C[i];
	sort(C + 1, C + 1 + M);
	idx = M;
	for (int i = N; i >= 1; i--)
		if (idx && C[idx] >= S[i]) idx--;
	cout << M - idx << '\n';
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	492 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	492 KB	Output is correct
24	Correct	1 ms	492 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	1 ms	492 KB	Output is correct
30	Correct	1 ms	492 KB	Output is correct
31	Correct	1 ms	492 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	55 ms	7148 KB	Output is correct
39	Correct	50 ms	7148 KB	Output is correct
40	Correct	46 ms	7148 KB	Output is correct
41	Correct	54 ms	7148 KB	Output is correct
42	Correct	56 ms	7148 KB	Output is correct
43	Correct	56 ms	7296 KB	Output is correct
44	Correct	57 ms	7148 KB	Output is correct
45	Correct	53 ms	7148 KB	Output is correct
46	Correct	53 ms	7148 KB	Output is correct
47	Correct	48 ms	6636 KB	Output is correct
48	Correct	47 ms	6636 KB	Output is correct
49	Correct	46 ms	5612 KB	Output is correct
50	Correct	43 ms	5612 KB	Output is correct
51	Correct	53 ms	7148 KB	Output is correct
52	Correct	53 ms	7148 KB	Output is correct
53	Correct	53 ms	7148 KB	Output is correct
54	Correct	46 ms	7148 KB	Output is correct
55	Correct	54 ms	7148 KB	Output is correct
56	Correct	35 ms	5484 KB	Output is correct
57	Correct	21 ms	2180 KB	Output is correct
58	Correct	34 ms	5356 KB	Output is correct
59	Correct	34 ms	5612 KB	Output is correct
60	Correct	20 ms	2156 KB	Output is correct
61	Correct	32 ms	3820 KB	Output is correct
62	Correct	53 ms	7148 KB	Output is correct
63	Correct	55 ms	7148 KB	Output is correct
64	Correct	53 ms	7148 KB	Output is correct
65	Correct	53 ms	7148 KB	Output is correct
66	Correct	54 ms	7148 KB	Output is correct
67	Correct	53 ms	7148 KB	Output is correct
68	Correct	53 ms	7148 KB	Output is correct
69	Correct	54 ms	7148 KB	Output is correct
70	Correct	55 ms	7148 KB	Output is correct
71	Correct	53 ms	7148 KB	Output is correct
72	Correct	55 ms	7148 KB	Output is correct
73	Correct	56 ms	7148 KB	Output is correct

Submission #349774

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