답안 #1095907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1095907	2024-10-03T11:46:21 Z	Phuoc	Exhibition (JOI19_ho_t2)	C++14	100 / 100	41 ms	5724 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ctime>
#include <algorithm>
#include <random>

using namespace std;

#define el '\n'
#define ll long long
#define fi first
#define se second
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define MASK(i) (1LL << (i))

const ll INF = (ll)1e18 + 9;
const int oo = (int)1e9 + 7;
const ll MOD = (ll)1e9 + 7;

template <class T1, class T2>
    bool minimize(T1 &a, T2 b) {
        if(a > b) {a = b; return true;} return false;
    }

template <class T1, class T2>
    bool maximize(T1 &a, T2 b) {
        if(a < b) {a = b; return true;} return false;
    }

template <class T1, class T2>
    void add (T1 &a, T2 b) {
        a += b;
        if (a >= MOD) a -= MOD;
    }

const int N = 100100;

int n, m;
pair <ll, ll> pics [N];
ll frames[N];

void init (void) {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> pics[i].fi >> pics[i].se;
	for (int i = 1; i <= m; i++) cin >> frames[i];
}

int f[N];

bool cmp (pair <ll, ll> a, pair <ll, ll> b) {
	if(a.se != b.se) return a.se < b.se;
	else return a.fi < b.fi;  
}

void solve (void) {
	sort (pics + 1, pics + n + 1, cmp);
	int ans = 0;
	sort(frames + 1, frames + m + 1);
	int j = n;
	for (int i = m; i >= 1; i--) {
		while(frames[i] < pics[j].fi && j > 0) j--;
		// if(frames[i] >= pics[j].fi) {
		// 	ans++;
		// }
		if(j < 1) {
			cout << ans << el;
			return;
		}
		j--;
		ans++;
	}
	cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define test "test"
    // freopen (test".inp", "r", stdin);
    // freopen (test".out", "w", stdout);

    srand(time(0));

    int ntest = 1;
    // cin >> ntest;
    while(ntest--) {
        init();
        solve();
    }
    return 0;
}

// chim chim chim orz orz orz

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	1 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	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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	472 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	348 KB	Output is correct
2	Correct	0 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	1 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	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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	472 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	344 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	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 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	348 KB	Output is correct
2	Correct	0 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	1 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	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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	472 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	344 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	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	344 KB	Output is correct
30	Correct	1 ms	600 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	37 ms	5460 KB	Output is correct
39	Correct	34 ms	5552 KB	Output is correct
40	Correct	32 ms	5712 KB	Output is correct
41	Correct	41 ms	5460 KB	Output is correct
42	Correct	37 ms	5692 KB	Output is correct
43	Correct	37 ms	5456 KB	Output is correct
44	Correct	39 ms	5644 KB	Output is correct
45	Correct	39 ms	5460 KB	Output is correct
46	Correct	36 ms	5468 KB	Output is correct
47	Correct	34 ms	4952 KB	Output is correct
48	Correct	32 ms	4944 KB	Output is correct
49	Correct	29 ms	4432 KB	Output is correct
50	Correct	28 ms	4444 KB	Output is correct
51	Correct	35 ms	5724 KB	Output is correct
52	Correct	37 ms	5636 KB	Output is correct
53	Correct	37 ms	5624 KB	Output is correct
54	Correct	33 ms	5508 KB	Output is correct
55	Correct	38 ms	5712 KB	Output is correct
56	Correct	23 ms	3928 KB	Output is correct
57	Correct	13 ms	2140 KB	Output is correct
58	Correct	22 ms	3932 KB	Output is correct
59	Correct	24 ms	3948 KB	Output is correct
60	Correct	13 ms	2140 KB	Output is correct
61	Correct	22 ms	3420 KB	Output is correct
62	Correct	38 ms	5460 KB	Output is correct
63	Correct	40 ms	5460 KB	Output is correct
64	Correct	38 ms	5468 KB	Output is correct
65	Correct	39 ms	5456 KB	Output is correct
66	Correct	38 ms	5720 KB	Output is correct
67	Correct	37 ms	5596 KB	Output is correct
68	Correct	35 ms	5468 KB	Output is correct
69	Correct	40 ms	5464 KB	Output is correct
70	Correct	41 ms	5544 KB	Output is correct
71	Correct	34 ms	5468 KB	Output is correct
72	Correct	35 ms	5456 KB	Output is correct
73	Correct	33 ms	5724 KB	Output is correct

답안 #1095907

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