Submission #956772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
956772	2024-04-02T12:56:17 Z	aaron_dcoder	Exhibition (JOI19_ho_t2)	C++17	100 / 100	145 ms	5696 KB

joi2019_ho_t2

#define NDEBUG


#ifdef NDEBUG
#define dbg(TXTMSG) if constexpr (false) cerr << "lol"
#define dbgv(VARN) ((void)0)
#define dbgfor(COND) if constexpr (false) for (COND)

#else
#define _GLIBCXX_DEBUG 1
#define _GLIBCXX_DEBUG_PEDANTIC 1
#pragma GCC optimize("trapv")
#define dbg(TXTMSG) cerr << "\n" << TXTMSG
#define dbgv(VARN) cerr << "\n" << #VARN << " = "<< VARN << ", line " << __LINE__ << "\n"
#define dbgfor(COND) for (COND)

#endif

#include <bits/stdc++.h>
using namespace std;
using ll = long long; 
using pll = pair<ll,ll>;
#define e0 first
#define e1 second
constexpr ll INFTY = 2e18;

int main()
{
	ll N,M;
	cin >> N >> M;

	vector<pll> VS(N);
	for (ll i = 0; i < N; ++i)
	{
		cin >> VS[i].e1 >> VS[i].e0;
	}

	vector<ll> C(M);
	for (ll i = 0; i < M; ++i)
	{
		cin >> C[i];
	}

	sort(C.begin(),C.end());
	sort(VS.begin(),VS.end());

	ll currV=INFTY;

	while (!VS.empty() && !C.empty())
	{
		auto [vi,si] = VS.back();
		VS.pop_back();

		if (si<=C.back() && vi<=currV)
		{
			C.pop_back();
			currV=vi;
		}
	}

	cout << M-ll(C.size());
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	600 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	600 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	444 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	1 ms	448 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	488 KB	Output is correct
37	Correct	1 ms	600 KB	Output is correct
38	Correct	101 ms	5456 KB	Output is correct
39	Correct	96 ms	5664 KB	Output is correct
40	Correct	106 ms	5576 KB	Output is correct
41	Correct	97 ms	5552 KB	Output is correct
42	Correct	97 ms	5576 KB	Output is correct
43	Correct	96 ms	5548 KB	Output is correct
44	Correct	113 ms	5456 KB	Output is correct
45	Correct	141 ms	5456 KB	Output is correct
46	Correct	95 ms	5424 KB	Output is correct
47	Correct	89 ms	5060 KB	Output is correct
48	Correct	86 ms	4948 KB	Output is correct
49	Correct	78 ms	4436 KB	Output is correct
50	Correct	76 ms	4476 KB	Output is correct
51	Correct	97 ms	5696 KB	Output is correct
52	Correct	109 ms	5688 KB	Output is correct
53	Correct	95 ms	5624 KB	Output is correct
54	Correct	93 ms	5556 KB	Output is correct
55	Correct	100 ms	5456 KB	Output is correct
56	Correct	62 ms	3668 KB	Output is correct
57	Correct	45 ms	2172 KB	Output is correct
58	Correct	62 ms	3892 KB	Output is correct
59	Correct	63 ms	3924 KB	Output is correct
60	Correct	35 ms	2136 KB	Output is correct
61	Correct	56 ms	3156 KB	Output is correct
62	Correct	118 ms	5672 KB	Output is correct
63	Correct	96 ms	5676 KB	Output is correct
64	Correct	97 ms	5440 KB	Output is correct
65	Correct	96 ms	5572 KB	Output is correct
66	Correct	96 ms	5572 KB	Output is correct
67	Correct	101 ms	5424 KB	Output is correct
68	Correct	145 ms	5460 KB	Output is correct
69	Correct	98 ms	5560 KB	Output is correct
70	Correct	97 ms	5676 KB	Output is correct
71	Correct	100 ms	5460 KB	Output is correct
72	Correct	98 ms	5460 KB	Output is correct
73	Correct	97 ms	5460 KB	Output is correct

Submission #956772

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