답안 #556973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556973 2022-05-04T13:30:15 Z alextodoran Exhibition (JOI19_ho_t2) C++17
100 / 100
56 ms 4404 KB
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 100000;
const int M_MAX = 100000;

int N, M;

struct Artwork {
    int dim, val;
};
bool operator < (const Artwork &a, const Artwork &b) {
    return make_pair(a.val, a.dim) < make_pair(b.val, b.dim);
}

Artwork art[N_MAX + 2];
int frame[M_MAX + 2];

int minf[N_MAX + 2];

int Fen[M_MAX + N_MAX + 2];
void update (int pos, int val) {
    pos += N;
    for (int i = pos; i <= M + N; i += i & -i) {
        Fen[i] = max(Fen[i], val);
    }
}
int query (int pos) {
    int val = 0;
    for (int i = pos; i >= 1; i -= i & -i) {
        val = max(val, Fen[i]);
    }
    return val;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> M;
    for (int i = 1; i <= N; i++) {
        cin >> art[i].dim >> art[i].val;
    }
    for (int i = 1; i <= M; i++) {
        cin >> frame[i];
    }
    sort(art + 1, art + N + 1);
    sort(frame + 1, frame + M + 1);

    int answer = 0;
    for (int i = N, curr = M; i >= 1 && curr >= 1; i--) {
        if (frame[curr] >= art[i].dim) {
            answer++;
            curr--;
        }
    }
    cout << answer << "\n";

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 368 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 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 468 KB Output is correct
32 Correct 1 ms 344 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 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 368 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 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 468 KB Output is correct
32 Correct 1 ms 344 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 336 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 47 ms 4300 KB Output is correct
39 Correct 55 ms 4372 KB Output is correct
40 Correct 37 ms 4296 KB Output is correct
41 Correct 56 ms 4264 KB Output is correct
42 Correct 46 ms 4268 KB Output is correct
43 Correct 51 ms 4296 KB Output is correct
44 Correct 44 ms 4340 KB Output is correct
45 Correct 49 ms 4316 KB Output is correct
46 Correct 44 ms 4292 KB Output is correct
47 Correct 41 ms 3892 KB Output is correct
48 Correct 40 ms 3944 KB Output is correct
49 Correct 41 ms 3520 KB Output is correct
50 Correct 42 ms 3452 KB Output is correct
51 Correct 47 ms 4348 KB Output is correct
52 Correct 46 ms 4364 KB Output is correct
53 Correct 51 ms 4296 KB Output is correct
54 Correct 37 ms 4404 KB Output is correct
55 Correct 45 ms 4308 KB Output is correct
56 Correct 30 ms 3028 KB Output is correct
57 Correct 18 ms 1620 KB Output is correct
58 Correct 32 ms 2944 KB Output is correct
59 Correct 31 ms 3052 KB Output is correct
60 Correct 17 ms 1660 KB Output is correct
61 Correct 27 ms 2528 KB Output is correct
62 Correct 48 ms 4308 KB Output is correct
63 Correct 47 ms 4316 KB Output is correct
64 Correct 49 ms 4312 KB Output is correct
65 Correct 47 ms 4340 KB Output is correct
66 Correct 49 ms 4380 KB Output is correct
67 Correct 50 ms 4324 KB Output is correct
68 Correct 53 ms 4296 KB Output is correct
69 Correct 46 ms 4348 KB Output is correct
70 Correct 54 ms 4388 KB Output is correct
71 Correct 44 ms 4392 KB Output is correct
72 Correct 47 ms 4304 KB Output is correct
73 Correct 46 ms 4300 KB Output is correct