답안 #1050912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050912	2024-08-09T16:44:57 Z	manhlinh1501	Exhibition (JOI19_ho_t2)	C++17	100 / 100	55 ms	5848 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int, int>;
const int MAXN = 1e5 + 5;
#define ALL(a) (a).begin(), (a).end()
#define LB(a, x) (lower_bound(ALL(a), x) - (a).begin() + 1)
int N, M;
pii a[MAXN];
int b[MAXN];
void compress() {
    vector<int> temp;
    for(int i = 1; i <= N; i++) temp.emplace_back(a[i].first);
    for(int i = 1; i <= M; i++) temp.emplace_back(b[i]);
    sort(ALL(temp));
    for(int i = 1; i <= N; i++) a[i].first = LB(temp, a[i].first);
    for(int i = 1; i <= M; i++) b[i] = LB(temp, b[i]);
}
signed main() {
#define TASK "code"

    if (fopen(TASK ".inp", "r")) {
        freopen(TASK ".inp", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> M;
    for(int i = 1; i <= N; i++) cin >> a[i].first >> a[i].second;
    for(int i = 1; i <= M; i++) cin >> b[i];
    sort(a + 1, a + N + 1, [&](const pii a, const pii b) {
        if(a.second != b.second) return a.second < b.second;
        return a.first < b.first;
    });
    sort(b + 1, b + M + 1);
    compress();
    int j = N;
    int ans = 0;
    for(int i = M; i >= 1; i--) {
        while(j >= 1 and a[j].first > b[i])
            j--;
        if(j > 0 and a[j].first <= b[i]) {
            j--;
            ans++;
        }
    }
    cout << ans;
    return (0 ^ 0);
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:24:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	472 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	500 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	472 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	500 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	48 ms	5588 KB	Output is correct
39	Correct	34 ms	5580 KB	Output is correct
40	Correct	28 ms	5588 KB	Output is correct
41	Correct	49 ms	5596 KB	Output is correct
42	Correct	36 ms	5684 KB	Output is correct
43	Correct	39 ms	5668 KB	Output is correct
44	Correct	48 ms	5584 KB	Output is correct
45	Correct	52 ms	5620 KB	Output is correct
46	Correct	43 ms	5584 KB	Output is correct
47	Correct	44 ms	5072 KB	Output is correct
48	Correct	34 ms	5172 KB	Output is correct
49	Correct	40 ms	4820 KB	Output is correct
50	Correct	34 ms	4828 KB	Output is correct
51	Correct	44 ms	5584 KB	Output is correct
52	Correct	44 ms	5704 KB	Output is correct
53	Correct	48 ms	5600 KB	Output is correct
54	Correct	28 ms	5684 KB	Output is correct
55	Correct	47 ms	5848 KB	Output is correct
56	Correct	30 ms	3808 KB	Output is correct
57	Correct	17 ms	2272 KB	Output is correct
58	Correct	19 ms	3800 KB	Output is correct
59	Correct	30 ms	3844 KB	Output is correct
60	Correct	20 ms	2444 KB	Output is correct
61	Correct	29 ms	3804 KB	Output is correct
62	Correct	52 ms	5448 KB	Output is correct
63	Correct	49 ms	5588 KB	Output is correct
64	Correct	50 ms	5584 KB	Output is correct
65	Correct	50 ms	5584 KB	Output is correct
66	Correct	50 ms	5588 KB	Output is correct
67	Correct	49 ms	5528 KB	Output is correct
68	Correct	49 ms	5588 KB	Output is correct
69	Correct	55 ms	5584 KB	Output is correct
70	Correct	50 ms	5588 KB	Output is correct
71	Correct	46 ms	5588 KB	Output is correct
72	Correct	43 ms	5588 KB	Output is correct
73	Correct	35 ms	5692 KB	Output is correct

답안 #1050912

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