답안 #831239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831239	2023-08-20T01:47:27 Z	DP_196	Exhibition (JOI19_ho_t2)	C++14	100 / 100	40 ms	4648 KB

joi2019_ho_t2

#include <bits/stdc++.h>
 
using namespace std;
 
#define sz(x) (int)x.size()
#define MASK(i) ((1LL) << (i))
#define all(x) x.begin(), x.end()
#define BIT(x, i) ((x) >> (i) & (1LL))
#define dbg(...) cerr << "#" << __LINE__ << ":[" << #__VA_ARGS__ \
<< "] = [" ,DBG(__VA_ARGS__)
 
string to_string(const string& s) { return '"' + s + '"'; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << to_string(h); if(sizeof...(t)) cerr << ", "; DBG(t...);
}
 
template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b) : 0); }
 
const int MAXN = 1e5 + 6;
const int INF = 1e9;
const int MOD = 1e9 + 7;
 
int nPic, nFrame;
int frame_size[MAXN], dp[1005][1005];
 
struct dat {
	int Size, Val;
} pic[MAXN];
 
void solve() {
	cin >> nPic >> nFrame;
	
	for (int i = 1; i <= nPic; i++) {
		cin >> pic[i].Size >> pic[i].Val;
	}
	
	for (int i = 1; i <= nFrame; i++) cin >> frame_size[i];
	
	sort(pic + 1, pic + nPic + 1, [] (dat pic1, dat pic2) {
		if (pic1.Val == pic2.Val) return pic1.Size < pic2.Size;
		return pic1.Val < pic2.Val;
	});
	
	sort(frame_size + 1, frame_size + nFrame + 1);
	
	int res = 0, j = nFrame;
	
	for (int i = nPic; i >= 1; --i) {
		if (pic[i].Size <= frame_size[j]) {
			++res;
			--j;
		}
		
		if (j == 0) break;
	}
	
	cout << res;
}
 
#define TASK ""
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);
 
    int ntest = 1;
    //cin >> ntest;
    while (ntest--) solve();
 
    return 0;
}
//612

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct

Subtask #2
40.0 / 40.0

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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 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	340 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	0 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	35 ms	1476 KB	Output is correct
39	Correct	38 ms	4368 KB	Output is correct
40	Correct	31 ms	4292 KB	Output is correct
41	Correct	36 ms	4288 KB	Output is correct
42	Correct	36 ms	4304 KB	Output is correct
43	Correct	37 ms	4300 KB	Output is correct
44	Correct	36 ms	4300 KB	Output is correct
45	Correct	40 ms	4648 KB	Output is correct
46	Correct	35 ms	4260 KB	Output is correct
47	Correct	32 ms	3952 KB	Output is correct
48	Correct	32 ms	3924 KB	Output is correct
49	Correct	34 ms	3492 KB	Output is correct
50	Correct	33 ms	3572 KB	Output is correct
51	Correct	37 ms	4404 KB	Output is correct
52	Correct	38 ms	4348 KB	Output is correct
53	Correct	36 ms	4316 KB	Output is correct
54	Correct	39 ms	4308 KB	Output is correct
55	Correct	36 ms	4404 KB	Output is correct
56	Correct	23 ms	3040 KB	Output is correct
57	Correct	15 ms	1688 KB	Output is correct
58	Correct	22 ms	2928 KB	Output is correct
59	Correct	22 ms	3028 KB	Output is correct
60	Correct	14 ms	1624 KB	Output is correct
61	Correct	28 ms	2548 KB	Output is correct
62	Correct	37 ms	4324 KB	Output is correct
63	Correct	37 ms	4264 KB	Output is correct
64	Correct	37 ms	4356 KB	Output is correct
65	Correct	40 ms	4448 KB	Output is correct
66	Correct	36 ms	4308 KB	Output is correct
67	Correct	36 ms	4360 KB	Output is correct
68	Correct	36 ms	4308 KB	Output is correct
69	Correct	37 ms	4324 KB	Output is correct
70	Correct	38 ms	4312 KB	Output is correct
71	Correct	35 ms	4300 KB	Output is correct
72	Correct	38 ms	4364 KB	Output is correct
73	Correct	34 ms	4276 KB	Output is correct

답안 #831239

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