답안 #478559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
478559	2021-10-08T01:47:13 Z	MonkeyKing	Exhibition (JOI19_ho_t2)	C++14	100 / 100	89 ms	3212 KB

joi2019_ho_t2

#include <numeric>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#include <assert.h>
#include <bitset>
#include <time.h>
#define Endl endl
#define mp make_pair
#define mt make_tuple
#define ll long long 
#define ull unsigned long long
#define pii pair<int,int>
#define over(A) {cout<<A<<endl;exit(0);}
#define all(A) A.begin(),A.end()
#define quickcin ios_base::sync_with_stdio(false);
const int mod=1000000007;
const int gmod=3;
const int inf=1039074182;
const double eps=1e-9;
const double pi=3.141592653589793238462643383279;
const ll llinf=2LL*inf*inf;
template <typename T1,typename T2> inline void chmin(T1 &x,T2 b) {if(b<x) x=b;}
template <typename T1,typename T2> inline void chmax(T1 &x,T2 b) {if(b>x) x=b;}
inline void chadd(int &x,int b) {x+=b-mod;x+=(x>>31 & mod);}
template <typename T1,typename T2> inline void chadd(T1 &x,T2 b) {x+=b;if(x>=mod) x-=mod;}
template <typename T1,typename T2> inline void chmul(T1 &x,T2 b) {x=1LL*x*b%mod;}
template <typename T1,typename T2> inline void chmod(T1 &x,T2 b) {x%=b,x+=b;if(x>=b) x-=b;}
template <typename T> inline T mabs(T x) {return (x<0?-x:x);}
using namespace std;
int n,m;
vector<pii> vSort;
int b[100005];
int a[100005];

int main()
{
	// freopen("a.in","r",stdin);
	// freopen("a.out","w",stdout);
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		vSort.emplace_back(y,x);
	}
	sort(all(vSort));
	for(int i=0;i<n;i++) a[i]=vSort[i].second;
	for(int i=0;i<m;i++) scanf("%d",b+i);
	sort(b,b+m);
	int res=0,pre=m;
	for(int i=n-1;i>=0;i--)
	{
		int pos=lower_bound(b,b+m,a[i])-b;
		if(pos>=pre) continue;
		pre--;
		res++;
	}
	cout<<res<<endl;
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:53:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |   scanf("%d%d",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:58:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |  for(int i=0;i<m;i++) scanf("%d",b+i);
      |                       ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	2 ms	320 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	316 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	444 KB	Output is correct
35	Correct	1 ms	312 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	304 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	2 ms	320 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	316 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	444 KB	Output is correct
35	Correct	1 ms	312 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	73 ms	3164 KB	Output is correct
39	Correct	59 ms	3200 KB	Output is correct
40	Correct	52 ms	3200 KB	Output is correct
41	Correct	62 ms	3124 KB	Output is correct
42	Correct	64 ms	3188 KB	Output is correct
43	Correct	60 ms	3176 KB	Output is correct
44	Correct	63 ms	3128 KB	Output is correct
45	Correct	74 ms	3140 KB	Output is correct
46	Correct	60 ms	3116 KB	Output is correct
47	Correct	63 ms	3052 KB	Output is correct
48	Correct	54 ms	3068 KB	Output is correct
49	Correct	57 ms	2872 KB	Output is correct
50	Correct	54 ms	2760 KB	Output is correct
51	Correct	64 ms	3212 KB	Output is correct
52	Correct	58 ms	3124 KB	Output is correct
53	Correct	60 ms	3144 KB	Output is correct
54	Correct	54 ms	3200 KB	Output is correct
55	Correct	64 ms	3188 KB	Output is correct
56	Correct	45 ms	2736 KB	Output is correct
57	Correct	21 ms	1664 KB	Output is correct
58	Correct	39 ms	2800 KB	Output is correct
59	Correct	45 ms	2820 KB	Output is correct
60	Correct	23 ms	1636 KB	Output is correct
61	Correct	43 ms	2440 KB	Output is correct
62	Correct	70 ms	3100 KB	Output is correct
63	Correct	89 ms	3204 KB	Output is correct
64	Correct	76 ms	3136 KB	Output is correct
65	Correct	81 ms	3200 KB	Output is correct
66	Correct	75 ms	3096 KB	Output is correct
67	Correct	74 ms	3160 KB	Output is correct
68	Correct	76 ms	3200 KB	Output is correct
69	Correct	80 ms	3176 KB	Output is correct
70	Correct	83 ms	3128 KB	Output is correct
71	Correct	86 ms	3084 KB	Output is correct
72	Correct	75 ms	3208 KB	Output is correct
73	Correct	66 ms	3136 KB	Output is correct

답안 #478559

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