Submission #526901

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
526901	2022-02-16T15:38:20 Z	darrryl	Exhibition (JOI19_ho_t2)	C++14	100 / 100	145 ms	5632 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,a,b) for(int i = a; i < b; ++i)

signed main(){
	int n, m;
    cin >> n >> m;
    pair<int,int> a[n];
    REP(i,0,n) {
        int s,v;
        cin >> s >> v;
        a[i] = {v,s};
    }
    sort(a,a+n,greater<pair<int,int>>());
    int frame[m];
    REP(i,0,m) {
        cin >> frame[i];
    }
    sort(frame,frame+m,greater<int>());
	int lo = 0, hi = n + 1;
	while(lo < hi - 1){
		int mi = (lo+hi)/2; ///mi is our guess
        int i = 0, j = 0;
        while (i < mi and j < n and i < m) {
            if (a[j].second <= frame[i]) {
                ++i;
                ++j;
            }
            else {
                ++j;
            }
        }
        if (i == mi) {
            lo = mi;
        }
		else {
            hi = mi;
        }
    }
	cout << lo;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	292 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	292 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	292 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	292 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	288 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	292 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	292 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	292 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	292 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	288 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	304 KB	Output is correct
26	Correct	2 ms	284 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	292 KB	Output is correct
29	Correct	2 ms	284 KB	Output is correct
30	Correct	2 ms	304 KB	Output is correct
31	Correct	2 ms	304 KB	Output is correct
32	Correct	1 ms	304 KB	Output is correct
33	Correct	1 ms	308 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	2 ms	332 KB	Output is correct
37	Correct	2 ms	300 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	292 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	292 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	292 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	292 KB	Output is correct
15	Correct	1 ms	288 KB	Output is correct
16	Correct	1 ms	288 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	332 KB	Output is correct
22	Correct	2 ms	332 KB	Output is correct
23	Correct	2 ms	332 KB	Output is correct
24	Correct	2 ms	332 KB	Output is correct
25	Correct	2 ms	304 KB	Output is correct
26	Correct	2 ms	284 KB	Output is correct
27	Correct	2 ms	332 KB	Output is correct
28	Correct	2 ms	292 KB	Output is correct
29	Correct	2 ms	284 KB	Output is correct
30	Correct	2 ms	304 KB	Output is correct
31	Correct	2 ms	304 KB	Output is correct
32	Correct	1 ms	304 KB	Output is correct
33	Correct	1 ms	308 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	2 ms	332 KB	Output is correct
37	Correct	2 ms	300 KB	Output is correct
38	Correct	126 ms	5400 KB	Output is correct
39	Correct	123 ms	5396 KB	Output is correct
40	Correct	121 ms	5536 KB	Output is correct
41	Correct	131 ms	5416 KB	Output is correct
42	Correct	126 ms	5408 KB	Output is correct
43	Correct	124 ms	5404 KB	Output is correct
44	Correct	137 ms	5444 KB	Output is correct
45	Correct	123 ms	5444 KB	Output is correct
46	Correct	124 ms	5396 KB	Output is correct
47	Correct	116 ms	4884 KB	Output is correct
48	Correct	109 ms	4904 KB	Output is correct
49	Correct	107 ms	4412 KB	Output is correct
50	Correct	106 ms	4428 KB	Output is correct
51	Correct	132 ms	5524 KB	Output is correct
52	Correct	131 ms	5412 KB	Output is correct
53	Correct	140 ms	5524 KB	Output is correct
54	Correct	116 ms	5524 KB	Output is correct
55	Correct	124 ms	5412 KB	Output is correct
56	Correct	82 ms	3736 KB	Output is correct
57	Correct	42 ms	1988 KB	Output is correct
58	Correct	78 ms	3744 KB	Output is correct
59	Correct	81 ms	3732 KB	Output is correct
60	Correct	44 ms	1940 KB	Output is correct
61	Correct	73 ms	3108 KB	Output is correct
62	Correct	130 ms	5400 KB	Output is correct
63	Correct	131 ms	5400 KB	Output is correct
64	Correct	135 ms	5632 KB	Output is correct
65	Correct	132 ms	5508 KB	Output is correct
66	Correct	140 ms	5392 KB	Output is correct
67	Correct	132 ms	5444 KB	Output is correct
68	Correct	130 ms	5508 KB	Output is correct
69	Correct	133 ms	5412 KB	Output is correct
70	Correct	128 ms	5408 KB	Output is correct
71	Correct	140 ms	5512 KB	Output is correct
72	Correct	145 ms	5520 KB	Output is correct
73	Correct	132 ms	5424 KB	Output is correct

Submission #526901

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