Submission #547864

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
547864	2022-04-11T22:27:09 Z	Zhora_004	Exhibition (JOI19_ho_t2)	C++17	100 / 100	60 ms	4400 KB

joi2019_ho_t2

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#include <climits>
#include <tuple>
#include <ctime>
#include <cstring>
#include <numeric>
#include <functional>
#include <chrono>
#include <cassert>
#include <bitset>
//#include <bit>
//#include <ranges>
//#include <numbers>
#define itn int
#define sacnf scanf
#define sz(a) ((int)((a).size()))
// printf("%.10f\n", ans);
using ll = long long;
using namespace std;
const ll mod = 998244353;
const int N = 1e6 + 1, inf = 1e9;

bool comp(pair<int, int>& a, pair<int, int>& b)
{
    return (a.second != b.second) ? (a.second < b.second) : (a.first < b.first);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> vp(n);
    for (int i = 0; i < n; i++) cin >> vp[i].first >> vp[i].second;
    sort(vp.begin(), vp.end(), comp);
    vector<int> c(m);
    for (int i = 0; i < m; i++) cin >> c[i];
    sort(c.begin(), c.end());
    int ans = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        if (c.back() >= vp[i].first)
        {
            c.pop_back();
            ans++;
            if (c.empty()) break;
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	328 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	0 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	320 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	328 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	0 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	320 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	356 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	1 ms	328 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	0 ms	320 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	320 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	336 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	356 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	48 ms	4288 KB	Output is correct
39	Correct	43 ms	4292 KB	Output is correct
40	Correct	41 ms	4300 KB	Output is correct
41	Correct	60 ms	4288 KB	Output is correct
42	Correct	48 ms	4304 KB	Output is correct
43	Correct	48 ms	4300 KB	Output is correct
44	Correct	52 ms	4292 KB	Output is correct
45	Correct	49 ms	4296 KB	Output is correct
46	Correct	47 ms	4280 KB	Output is correct
47	Correct	51 ms	3916 KB	Output is correct
48	Correct	40 ms	3912 KB	Output is correct
49	Correct	39 ms	3532 KB	Output is correct
50	Correct	37 ms	3548 KB	Output is correct
51	Correct	60 ms	4400 KB	Output is correct
52	Correct	58 ms	4276 KB	Output is correct
53	Correct	48 ms	4292 KB	Output is correct
54	Correct	41 ms	4300 KB	Output is correct
55	Correct	48 ms	4300 KB	Output is correct
56	Correct	34 ms	3020 KB	Output is correct
57	Correct	19 ms	1620 KB	Output is correct
58	Correct	29 ms	3020 KB	Output is correct
59	Correct	30 ms	3016 KB	Output is correct
60	Correct	18 ms	1620 KB	Output is correct
61	Correct	29 ms	2508 KB	Output is correct
62	Correct	57 ms	4292 KB	Output is correct
63	Correct	49 ms	4296 KB	Output is correct
64	Correct	48 ms	4292 KB	Output is correct
65	Correct	48 ms	4300 KB	Output is correct
66	Correct	47 ms	4284 KB	Output is correct
67	Correct	51 ms	4288 KB	Output is correct
68	Correct	50 ms	4292 KB	Output is correct
69	Correct	49 ms	4296 KB	Output is correct
70	Correct	53 ms	4292 KB	Output is correct
71	Correct	46 ms	4292 KB	Output is correct
72	Correct	47 ms	4288 KB	Output is correct
73	Correct	50 ms	4292 KB	Output is correct

Submission #547864

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