답안 #777227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
777227	2023-07-08T19:30:17 Z	OrazB	Exhibition (JOI19_ho_t2)	C++17	100 / 100	60 ms	4808 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<pii> a(n+1);
	for (int i = 1; i <= n; i++) cin >> a[i].ss >> a[i].ff;
	vector<int> c(m+1);
	for (int i = 1; i <= m; i++) cin >> c[i];
	sort(all(c)); sort(all(a));
	vector<int> cur(n+1, -1);
	for (int i = 1; i <= n; i++){
		if (c[m] < a[i].ss) continue;
		cur[i] = 1+m-(lower_bound(c.begin()+1, c.end(), a[i].ss)-c.begin());
	}
	int l = 1, r = n, ans = 0;
	while(l <= r){
		int md = (l+r)>>1;
		int x = 0, tr = 0;
		for (int i = 1; i <= n; i++){
			if (cur[i] >= md-x) x++;
			if (x == md){tr=1;break;}
		}
		if (tr){
			ans = md;
			l = md + 1;
		}else r = md - 1;
	}
	cout << ans << '\n';
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	328 KB	Output is correct
24	Correct	1 ms	328 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 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	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	340 KB	Output is correct
37	Correct	1 ms	356 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	320 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	328 KB	Output is correct
24	Correct	1 ms	328 KB	Output is correct
25	Correct	1 ms	356 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 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	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	340 KB	Output is correct
37	Correct	1 ms	356 KB	Output is correct
38	Correct	41 ms	4776 KB	Output is correct
39	Correct	38 ms	4672 KB	Output is correct
40	Correct	34 ms	4800 KB	Output is correct
41	Correct	49 ms	4776 KB	Output is correct
42	Correct	38 ms	4688 KB	Output is correct
43	Correct	38 ms	4772 KB	Output is correct
44	Correct	47 ms	4804 KB	Output is correct
45	Correct	45 ms	4676 KB	Output is correct
46	Correct	38 ms	4684 KB	Output is correct
47	Correct	42 ms	4364 KB	Output is correct
48	Correct	35 ms	4296 KB	Output is correct
49	Correct	41 ms	3796 KB	Output is correct
50	Correct	38 ms	3776 KB	Output is correct
51	Correct	37 ms	4676 KB	Output is correct
52	Correct	40 ms	4688 KB	Output is correct
53	Correct	46 ms	4664 KB	Output is correct
54	Correct	36 ms	4808 KB	Output is correct
55	Correct	41 ms	4672 KB	Output is correct
56	Correct	24 ms	3428 KB	Output is correct
57	Correct	14 ms	1620 KB	Output is correct
58	Correct	24 ms	3412 KB	Output is correct
59	Correct	29 ms	3388 KB	Output is correct
60	Correct	14 ms	1612 KB	Output is correct
61	Correct	26 ms	2624 KB	Output is correct
62	Correct	58 ms	4672 KB	Output is correct
63	Correct	60 ms	4672 KB	Output is correct
64	Correct	51 ms	4784 KB	Output is correct
65	Correct	52 ms	4688 KB	Output is correct
66	Correct	52 ms	4684 KB	Output is correct
67	Correct	52 ms	4784 KB	Output is correct
68	Correct	55 ms	4772 KB	Output is correct
69	Correct	60 ms	4688 KB	Output is correct
70	Correct	50 ms	4676 KB	Output is correct
71	Correct	51 ms	4780 KB	Output is correct
72	Correct	45 ms	4676 KB	Output is correct
73	Correct	52 ms	4684 KB	Output is correct

답안 #777227

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