답안 #110347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
110347	2019-05-10T17:51:42 Z	luciocf	Exhibition (JOI19_ho_t2)	C++14	50 / 100	32 ms	4600 KB

joi2019_ho_t2

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e3+10;

struct P
{
	int s, v;
} p[maxn];

int c[maxn];

int n, m;

int dp[maxn][maxn];

bool comp(P a, P b)
{
	if (a.v == b.v) return a.s < b.s;
	return a.v < b.v;
}

int solve(int i, int j)
{
	if (i == n+1 || j == m+1) return 0;
	if (dp[i][j] != -1) return dp[i][j];

	int ans = 0;

	if (p[i].s <= c[j])
		ans = max(ans, 1+solve(i+1, j+1));

	ans = max(ans, solve(i+1, j));
	ans = max(ans, solve(i, j+1));

	return dp[i][j] = ans;
}

int main(void)
{
	scanf("%d %d", &n, &m);

	for (int i = 1; i <= n; i++)
		scanf("%d %d", &p[i].s, &p[i].v);

	for (int i = 1; i <= m; i++)
		scanf("%d", &c[i]);

	sort(p+1, p+n+1, comp);
	sort(c+1, c+m+1);

	memset(dp, -1, sizeof dp);

	printf("%d\n", solve(1, 1));
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &p[i].s, &p[i].v);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &c[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

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

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4352 KB	Output is correct
2	Correct	6 ms	4352 KB	Output is correct
3	Correct	7 ms	4352 KB	Output is correct
4	Correct	6 ms	4352 KB	Output is correct
5	Correct	6 ms	4352 KB	Output is correct
6	Correct	5 ms	4352 KB	Output is correct
7	Correct	6 ms	4352 KB	Output is correct
8	Correct	5 ms	4352 KB	Output is correct
9	Correct	6 ms	4352 KB	Output is correct
10	Correct	6 ms	4352 KB	Output is correct
11	Correct	6 ms	4352 KB	Output is correct
12	Correct	5 ms	4352 KB	Output is correct
13	Correct	6 ms	4352 KB	Output is correct
14	Correct	7 ms	4352 KB	Output is correct
15	Correct	6 ms	4352 KB	Output is correct
16	Correct	7 ms	4352 KB	Output is correct
17	Correct	6 ms	4352 KB	Output is correct
18	Correct	6 ms	4352 KB	Output is correct
19	Correct	6 ms	4352 KB	Output is correct
20	Correct	32 ms	4480 KB	Output is correct
21	Correct	22 ms	4480 KB	Output is correct
22	Correct	20 ms	4480 KB	Output is correct
23	Correct	24 ms	4452 KB	Output is correct
24	Correct	24 ms	4480 KB	Output is correct
25	Correct	29 ms	4600 KB	Output is correct
26	Correct	29 ms	4480 KB	Output is correct
27	Correct	17 ms	4480 KB	Output is correct
28	Correct	17 ms	4480 KB	Output is correct
29	Correct	23 ms	4480 KB	Output is correct
30	Correct	22 ms	4480 KB	Output is correct
31	Correct	22 ms	4480 KB	Output is correct
32	Correct	6 ms	4352 KB	Output is correct
33	Correct	6 ms	4348 KB	Output is correct
34	Correct	12 ms	4480 KB	Output is correct
35	Correct	6 ms	4480 KB	Output is correct
36	Correct	20 ms	4480 KB	Output is correct
37	Correct	19 ms	4480 KB	Output is correct

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	4352 KB	Output is correct
2	Correct	6 ms	4352 KB	Output is correct
3	Correct	7 ms	4352 KB	Output is correct
4	Correct	6 ms	4352 KB	Output is correct
5	Correct	6 ms	4352 KB	Output is correct
6	Correct	5 ms	4352 KB	Output is correct
7	Correct	6 ms	4352 KB	Output is correct
8	Correct	5 ms	4352 KB	Output is correct
9	Correct	6 ms	4352 KB	Output is correct
10	Correct	6 ms	4352 KB	Output is correct
11	Correct	6 ms	4352 KB	Output is correct
12	Correct	5 ms	4352 KB	Output is correct
13	Correct	6 ms	4352 KB	Output is correct
14	Correct	7 ms	4352 KB	Output is correct
15	Correct	6 ms	4352 KB	Output is correct
16	Correct	7 ms	4352 KB	Output is correct
17	Correct	6 ms	4352 KB	Output is correct
18	Correct	6 ms	4352 KB	Output is correct
19	Correct	6 ms	4352 KB	Output is correct
20	Correct	32 ms	4480 KB	Output is correct
21	Correct	22 ms	4480 KB	Output is correct
22	Correct	20 ms	4480 KB	Output is correct
23	Correct	24 ms	4452 KB	Output is correct
24	Correct	24 ms	4480 KB	Output is correct
25	Correct	29 ms	4600 KB	Output is correct
26	Correct	29 ms	4480 KB	Output is correct
27	Correct	17 ms	4480 KB	Output is correct
28	Correct	17 ms	4480 KB	Output is correct
29	Correct	23 ms	4480 KB	Output is correct
30	Correct	22 ms	4480 KB	Output is correct
31	Correct	22 ms	4480 KB	Output is correct
32	Correct	6 ms	4352 KB	Output is correct
33	Correct	6 ms	4348 KB	Output is correct
34	Correct	12 ms	4480 KB	Output is correct
35	Correct	6 ms	4480 KB	Output is correct
36	Correct	20 ms	4480 KB	Output is correct
37	Correct	19 ms	4480 KB	Output is correct
38	Execution timed out	5 ms	640 KB	Time limit exceeded (wall clock)
39	Halted	0 ms	0 KB	-