Submission #787135

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
787135	2023-07-18T21:06:51 Z	TakeMe	Exhibition (JOI19_ho_t2)	C++14	100 / 100	50 ms	2916 KB

joi2019_ho_t2

/* Quick Note :
 * Jangan Mikir Lama - lama, sampahin dulu aja kalo OI
 * Always Try to reset
*/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ld PI = 4*atan((ld)1);
const ll mod = 1e9 + 7;
const ll inf = 922337203685477;
const ll nax = 1e5 + 5;

ll n, m;
pair<ll,ll> a[nax];
ll frame[nax];

bool cmp(pair<ll,ll> xx, pair<ll,ll> yy){
	if(xx.ss == yy.ss) return xx.ff < yy.ff;
	return xx.ss < yy.ss;
}

ll cek(ll val){
	ll idx = m - val + 1;
	for(ll i = 1; i <= n; i++){
		if(idx > m){
			break;
		}
		else{
			if(a[i].ff <= frame[idx]){
				idx++;
			}
		}
	}
	return idx > m;
}

int main(){ 
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    
    cin >> n >> m;
    for(ll i = 1; i <= n; i++){
		cin >> a[i].ff >> a[i].ss;
	}
	for(ll i = 1; i <= m; i++) cin >> frame[i];
	sort(frame + 1, frame + 1 + m);
	
	sort(a + 1, a + 1 + n, cmp);
	
	ll l = 0, r = m, ret = 0;
	while(l <= r){
		ll mid = (l + r) / 2;
		if(cek(mid)){
			ret = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	cout << ret << '\n';
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 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	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 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	324 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 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	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 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	324 KB	Output is correct
20	Correct	1 ms	340 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	340 KB	Output is correct
25	Correct	1 ms	340 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	344 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	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 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	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 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	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 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	324 KB	Output is correct
20	Correct	1 ms	340 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	340 KB	Output is correct
25	Correct	1 ms	340 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	344 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	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	42 ms	2892 KB	Output is correct
39	Correct	36 ms	2908 KB	Output is correct
40	Correct	36 ms	2812 KB	Output is correct
41	Correct	40 ms	2840 KB	Output is correct
42	Correct	40 ms	2832 KB	Output is correct
43	Correct	39 ms	2836 KB	Output is correct
44	Correct	39 ms	2884 KB	Output is correct
45	Correct	40 ms	2904 KB	Output is correct
46	Correct	38 ms	2908 KB	Output is correct
47	Correct	38 ms	2680 KB	Output is correct
48	Correct	39 ms	2632 KB	Output is correct
49	Correct	32 ms	2356 KB	Output is correct
50	Correct	31 ms	2368 KB	Output is correct
51	Correct	40 ms	2888 KB	Output is correct
52	Correct	39 ms	2820 KB	Output is correct
53	Correct	39 ms	2784 KB	Output is correct
54	Correct	34 ms	2868 KB	Output is correct
55	Correct	39 ms	2792 KB	Output is correct
56	Correct	24 ms	2124 KB	Output is correct
57	Correct	14 ms	1236 KB	Output is correct
58	Correct	23 ms	2040 KB	Output is correct
59	Correct	25 ms	2028 KB	Output is correct
60	Correct	19 ms	1236 KB	Output is correct
61	Correct	24 ms	1704 KB	Output is correct
62	Correct	50 ms	2904 KB	Output is correct
63	Correct	42 ms	2908 KB	Output is correct
64	Correct	44 ms	2916 KB	Output is correct
65	Correct	44 ms	2820 KB	Output is correct
66	Correct	43 ms	2892 KB	Output is correct
67	Correct	43 ms	2900 KB	Output is correct
68	Correct	43 ms	2912 KB	Output is correct
69	Correct	44 ms	2816 KB	Output is correct
70	Correct	41 ms	2888 KB	Output is correct
71	Correct	44 ms	2892 KB	Output is correct
72	Correct	47 ms	2824 KB	Output is correct
73	Correct	40 ms	2908 KB	Output is correct

Submission #787135

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