답안 #963364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963364	2024-04-14T21:41:23 Z	Saul0906	Exhibition (JOI19_ho_t2)	C++14	50 / 100	1000 ms	5552 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define rep(a,b,c) for(int a=b; a<c; a++)
#define fi first
#define se second
#define pll pair<int, int>

using namespace std;

int main(){
	ll n, m;
	cin>>n>>m;
	pll pic[n];
	ll frame[m], dp[m]{}, ans=0;
	rep(i,0,n) cin>>pic[i].se>>pic[i].fi;
	sort(pic,pic+n);
	rep(i,0,m) cin>>frame[i];
	sort(frame,frame+m);
	rep(i,0,n){
		ll mx=0, mx2=0;
		rep(j,0,m){
			mx2=max(mx,dp[j]);
			if(frame[j]>=pic[i].se)dp[j]=max(dp[j],mx+1);
			mx=max(mx,mx2);
			ans=max(ans,dp[j]);
		}
	}
	cout<<ans<<endl;
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	1 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	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 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	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	1 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	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 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	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	3 ms	352 KB	Output is correct
21	Correct	2 ms	352 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	3 ms	488 KB	Output is correct
24	Correct	3 ms	604 KB	Output is correct
25	Correct	3 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	3 ms	480 KB	Output is correct
30	Correct	2 ms	344 KB	Output is correct
31	Correct	3 ms	348 KB	Output is correct
32	Correct	1 ms	448 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	2 ms	448 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	344 KB	Output is correct

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	1 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	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 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	344 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	3 ms	352 KB	Output is correct
21	Correct	2 ms	352 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	3 ms	488 KB	Output is correct
24	Correct	3 ms	604 KB	Output is correct
25	Correct	3 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	3 ms	480 KB	Output is correct
30	Correct	2 ms	344 KB	Output is correct
31	Correct	3 ms	348 KB	Output is correct
32	Correct	1 ms	448 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	2 ms	448 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	344 KB	Output is correct
38	Execution timed out	1094 ms	5552 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-