Submission #444151

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
444151	2021-07-13T07:23:23 Z	nonsensenonsense1	Exhibition (JOI19_ho_t2)	C++17	100 / 100	92 ms	4340 KB

joi2019_ho_t2

#include <cstdio>
#include <utility>
#include <algorithm>

const int N = 100000;
int n, m, c[N];
std::pair<int, int> a[N];

int main() 
{
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; ++i) scanf("%d%d", &a[i].second, &a[i].first);
	std::sort(a, a + n);
	for (int i = 0; i < m; ++i) scanf("%d", c + i);
	std::sort(c, c + m);
	int l = m - 1;
	for (int i = n - 1; i >= 0; --i) {
		int f = std::lower_bound(c, c + m, a[i].second) - c;
		if (f <= l) --l;
	}
	printf("%d\n", m - l - 1);
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:12:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |  for (int i = 0; i < n; ++i) scanf("%d%d", &a[i].second, &a[i].first);
      |                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:14:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  for (int i = 0; i < m; ++i) scanf("%d", c + i);
      |                              ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	284 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 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	0 ms	204 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	284 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 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	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	296 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	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	296 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	204 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	2 ms	332 KB	Output is correct
37	Correct	1 ms	292 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	284 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 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	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	296 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	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	296 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	204 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	2 ms	332 KB	Output is correct
37	Correct	1 ms	292 KB	Output is correct
38	Correct	64 ms	4260 KB	Output is correct
39	Correct	59 ms	4236 KB	Output is correct
40	Correct	53 ms	4260 KB	Output is correct
41	Correct	66 ms	4272 KB	Output is correct
42	Correct	74 ms	4296 KB	Output is correct
43	Correct	69 ms	4292 KB	Output is correct
44	Correct	66 ms	4292 KB	Output is correct
45	Correct	70 ms	4292 KB	Output is correct
46	Correct	59 ms	4252 KB	Output is correct
47	Correct	70 ms	3908 KB	Output is correct
48	Correct	71 ms	3864 KB	Output is correct
49	Correct	56 ms	3416 KB	Output is correct
50	Correct	51 ms	3412 KB	Output is correct
51	Correct	59 ms	4340 KB	Output is correct
52	Correct	66 ms	4224 KB	Output is correct
53	Correct	61 ms	4260 KB	Output is correct
54	Correct	72 ms	4276 KB	Output is correct
55	Correct	64 ms	4308 KB	Output is correct
56	Correct	37 ms	2884 KB	Output is correct
57	Correct	24 ms	1584 KB	Output is correct
58	Correct	36 ms	2960 KB	Output is correct
59	Correct	52 ms	2988 KB	Output is correct
60	Correct	24 ms	1556 KB	Output is correct
61	Correct	40 ms	2516 KB	Output is correct
62	Correct	92 ms	4256 KB	Output is correct
63	Correct	72 ms	4336 KB	Output is correct
64	Correct	72 ms	4236 KB	Output is correct
65	Correct	73 ms	4228 KB	Output is correct
66	Correct	74 ms	4232 KB	Output is correct
67	Correct	71 ms	4256 KB	Output is correct
68	Correct	71 ms	4292 KB	Output is correct
69	Correct	73 ms	4252 KB	Output is correct
70	Correct	76 ms	4252 KB	Output is correct
71	Correct	78 ms	4292 KB	Output is correct
72	Correct	79 ms	4232 KB	Output is correct
73	Correct	65 ms	4288 KB	Output is correct

Submission #444151

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