Submission #1097234

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1097234	2024-10-06T14:15:18 Z	StefanSebez	Exhibition (JOI19_ho_t2)	C++14	100 / 100	40 ms	4688 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int N=1e5+50;
pair<int,int>a[N];
int b[N];
int main(){
    int n,m;scanf("%i%i",&n,&m);
    for(int i=1;i<=n;i++) scanf("%i%i",&a[i].fi,&a[i].se);
    for(int i=1;i<=m;i++) scanf("%i",&b[i]);
    sort(a+1,a+n+1,[&](pair<int,int>A,pair<int,int>B){return A.se<B.se||(A.se==B.se&&A.fi<B.fi);});
    sort(b+1,b+m+1);
    int res=0;
    //for(int i=1;i<=n;i++) printf("{%i %i} ",a[i].fi,a[i].se);printf("\n");
    for(int i=n,j=m;i>=1&&j>=1;i--){
		if(a[i].fi<=b[j]){
			res++;
			j--;
		}
    }
    printf("%i\n",res);
    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:12:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     int n,m;scanf("%i%i",&n,&m);
      |             ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:13:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for(int i=1;i<=n;i++) scanf("%i%i",&a[i].fi,&a[i].se);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:14:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     for(int i=1;i<=m;i++) scanf("%i",&b[i]);
      |                           ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	440 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	1 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	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	440 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	1 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	348 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	348 KB	Output is correct
24	Correct	1 ms	600 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	344 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	456 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	440 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	1 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	348 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	348 KB	Output is correct
24	Correct	1 ms	600 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	344 KB	Output is correct
28	Correct	1 ms	452 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	456 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	34 ms	4436 KB	Output is correct
39	Correct	32 ms	4444 KB	Output is correct
40	Correct	29 ms	4440 KB	Output is correct
41	Correct	34 ms	4436 KB	Output is correct
42	Correct	34 ms	4444 KB	Output is correct
43	Correct	35 ms	4444 KB	Output is correct
44	Correct	39 ms	4444 KB	Output is correct
45	Correct	37 ms	4284 KB	Output is correct
46	Correct	36 ms	4444 KB	Output is correct
47	Correct	34 ms	3912 KB	Output is correct
48	Correct	31 ms	3920 KB	Output is correct
49	Correct	30 ms	3420 KB	Output is correct
50	Correct	29 ms	3672 KB	Output is correct
51	Correct	40 ms	4444 KB	Output is correct
52	Correct	36 ms	4444 KB	Output is correct
53	Correct	38 ms	4436 KB	Output is correct
54	Correct	30 ms	4440 KB	Output is correct
55	Correct	40 ms	4396 KB	Output is correct
56	Correct	23 ms	2904 KB	Output is correct
57	Correct	15 ms	1628 KB	Output is correct
58	Correct	23 ms	3140 KB	Output is correct
59	Correct	21 ms	3160 KB	Output is correct
60	Correct	14 ms	1624 KB	Output is correct
61	Correct	22 ms	2896 KB	Output is correct
62	Correct	35 ms	4304 KB	Output is correct
63	Correct	36 ms	4488 KB	Output is correct
64	Correct	35 ms	4688 KB	Output is correct
65	Correct	36 ms	4432 KB	Output is correct
66	Correct	35 ms	4444 KB	Output is correct
67	Correct	35 ms	4440 KB	Output is correct
68	Correct	35 ms	4432 KB	Output is correct
69	Correct	36 ms	4444 KB	Output is correct
70	Correct	36 ms	4440 KB	Output is correct
71	Correct	34 ms	4312 KB	Output is correct
72	Correct	36 ms	4356 KB	Output is correct
73	Correct	35 ms	4440 KB	Output is correct

Submission #1097234

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