Submission #736650

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
736650	2023-05-06T04:32:21 Z	JellyTheOctopus	Exhibition (JOI19_ho_t2)	C++17	50 / 100	1000 ms	4268 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second

int N, M;
vector<pair<int, int>> pictures;
vector<int> frames;

int main() {
	cin >> N >> M;
	pictures.resize(N);
	frames.resize(M);
	for (int i = 0; i < N; i++) {
		cin >> pictures[i].s >> pictures[i].f;
	}
	for (int i = 0; i < M; i++) {
		cin >> frames[i];
	}
	sort(pictures.begin(), pictures.end());
	sort(frames.begin(), frames.end());
	int finalAns = 0;
	for (int i = 0; i < N; i++) {
		int j = i;
		int k = M-1;
		int localAns = 0;
		while ((j >= 0) && (k >= 0)) {
			bool flag = false;
			while (pictures[j].s > frames[k]) {
				j--;
				if (j < 0) {
					flag = true;
					break;
				}
			}
			if (flag) break;
			localAns++;
			j--;
			k--;
		}
		finalAns = max(localAns, finalAns);
	}
	cout << finalAns << "\n";
}

Subtask #1

10.0 / 10.0

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

Subtask #2

40.0 / 40.0

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

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	300 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	224 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	296 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	2 ms	212 KB	Output is correct
21	Correct	2 ms	312 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	2 ms	336 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	2 ms	340 KB	Output is correct
26	Correct	3 ms	312 KB	Output is correct
27	Correct	2 ms	312 KB	Output is correct
28	Correct	2 ms	312 KB	Output is correct
29	Correct	2 ms	340 KB	Output is correct
30	Correct	3 ms	340 KB	Output is correct
31	Correct	3 ms	340 KB	Output is correct
32	Correct	2 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	2 ms	212 KB	Output is correct
35	Correct	1 ms	312 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	3 ms	340 KB	Output is correct
38	Execution timed out	1071 ms	4268 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-