답안 #306221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306221	2020-09-24T22:46:46 Z	Lawliet	Mountains (IOI17_mountains)	C++17	100 / 100	39 ms	14328 KB

mountains

#include "mountains.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

const int MAXN = 2010;

struct point
{
	lli x, y;

	point(lli x = 0, lli y = 0)
		: x(x), y(y) {}

	lli operator * (point a) { return x*a.y - y*a.x; }
	point operator - (point a) { return point( x - a.x , y - a.y ); }
};

int n;

int v[MAXN];
int dp[MAXN][MAXN];

int maximum_deevs(vector<int> y) 
{
	n = (int)y.size();

	for(int i = 1 ; i <= n ; i++)
		v[i] = y[i - 1];

	for(int L = n ; L > 0 ; L--)
	{
		dp[L][L] = 1;

		int sum = 0;
		int last = L + 1;
		vector<point> cHull( 1 , point( L , v[L] ) );

		for(int R = L + 1 ; R <= n ; R++)
		{
			point cur( R , v[R] );
			dp[L][R] = dp[L + 1][R];

			while( (int)cHull.size() > 1 )
			{
				point A = cHull[ (int)cHull.size() - 1 ];
				point origin = cHull[ (int)cHull.size() - 2 ];

				if( (cur - origin)*(A - origin) > 0 ) break;

				cHull.pop_back();
			}

			if( (int)cHull.size() == 1 )
			{
				sum += dp[last][R - 1];
				last = R + 1;
			}

			cHull.push_back( cur );
			dp[L][R] = max( dp[L][R] , sum + 1 + dp[last][R] );
		}
	}

	return dp[1][n];
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	512 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	1 ms	512 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	512 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	512 KB	Output is correct
27	Correct	1 ms	512 KB	Output is correct
28	Correct	1 ms	512 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	512 KB	Output is correct
37	Correct	1 ms	512 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	1152 KB	Output is correct
40	Correct	2 ms	1792 KB	Output is correct
41	Correct	2 ms	1664 KB	Output is correct
42	Correct	3 ms	1664 KB	Output is correct
43	Correct	2 ms	1664 KB	Output is correct
44	Correct	2 ms	1664 KB	Output is correct
45	Correct	2 ms	1664 KB	Output is correct
46	Correct	2 ms	1664 KB	Output is correct
47	Correct	2 ms	1664 KB	Output is correct
48	Correct	2 ms	1664 KB	Output is correct
49	Correct	2 ms	1664 KB	Output is correct
50	Correct	2 ms	1664 KB	Output is correct
51	Correct	2 ms	1664 KB	Output is correct
52	Correct	2 ms	1664 KB	Output is correct
53	Correct	3 ms	1664 KB	Output is correct
54	Correct	2 ms	1664 KB	Output is correct
55	Correct	2 ms	1664 KB	Output is correct
56	Correct	2 ms	1664 KB	Output is correct
57	Correct	2 ms	1664 KB	Output is correct
58	Correct	2 ms	1664 KB	Output is correct
59	Correct	2 ms	1664 KB	Output is correct
60	Correct	2 ms	1664 KB	Output is correct
61	Correct	3 ms	1664 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	512 KB	Output is correct
18	Correct	1 ms	512 KB	Output is correct
19	Correct	1 ms	512 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	1 ms	512 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	512 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	1 ms	512 KB	Output is correct
27	Correct	1 ms	512 KB	Output is correct
28	Correct	1 ms	512 KB	Output is correct
29	Correct	1 ms	512 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	512 KB	Output is correct
33	Correct	1 ms	512 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	1 ms	512 KB	Output is correct
36	Correct	1 ms	512 KB	Output is correct
37	Correct	1 ms	512 KB	Output is correct
38	Correct	1 ms	512 KB	Output is correct
39	Correct	1 ms	1152 KB	Output is correct
40	Correct	2 ms	1792 KB	Output is correct
41	Correct	2 ms	1664 KB	Output is correct
42	Correct	3 ms	1664 KB	Output is correct
43	Correct	2 ms	1664 KB	Output is correct
44	Correct	2 ms	1664 KB	Output is correct
45	Correct	2 ms	1664 KB	Output is correct
46	Correct	2 ms	1664 KB	Output is correct
47	Correct	2 ms	1664 KB	Output is correct
48	Correct	2 ms	1664 KB	Output is correct
49	Correct	2 ms	1664 KB	Output is correct
50	Correct	2 ms	1664 KB	Output is correct
51	Correct	2 ms	1664 KB	Output is correct
52	Correct	2 ms	1664 KB	Output is correct
53	Correct	3 ms	1664 KB	Output is correct
54	Correct	2 ms	1664 KB	Output is correct
55	Correct	2 ms	1664 KB	Output is correct
56	Correct	2 ms	1664 KB	Output is correct
57	Correct	2 ms	1664 KB	Output is correct
58	Correct	2 ms	1664 KB	Output is correct
59	Correct	2 ms	1664 KB	Output is correct
60	Correct	2 ms	1664 KB	Output is correct
61	Correct	3 ms	1664 KB	Output is correct
62	Correct	10 ms	6272 KB	Output is correct
63	Correct	35 ms	14252 KB	Output is correct
64	Correct	35 ms	14200 KB	Output is correct
65	Correct	35 ms	14200 KB	Output is correct
66	Correct	35 ms	14208 KB	Output is correct
67	Correct	39 ms	14328 KB	Output is correct
68	Correct	35 ms	14200 KB	Output is correct
69	Correct	36 ms	14200 KB	Output is correct
70	Correct	31 ms	14200 KB	Output is correct
71	Correct	31 ms	14200 KB	Output is correct
72	Correct	30 ms	14208 KB	Output is correct
73	Correct	30 ms	14208 KB	Output is correct
74	Correct	30 ms	14200 KB	Output is correct
75	Correct	31 ms	14200 KB	Output is correct
76	Correct	31 ms	14200 KB	Output is correct
77	Correct	35 ms	14200 KB	Output is correct
78	Correct	34 ms	14208 KB	Output is correct
79	Correct	34 ms	14200 KB	Output is correct
80	Correct	35 ms	14200 KB	Output is correct
81	Correct	34 ms	14200 KB	Output is correct
82	Correct	29 ms	14200 KB	Output is correct
83	Correct	37 ms	14200 KB	Output is correct
84	Correct	35 ms	14200 KB	Output is correct
85	Correct	34 ms	14200 KB	Output is correct
86	Correct	39 ms	14200 KB	Output is correct

답안 #306221

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 30.0 / 30.0

Subtask #4 30.0 / 30.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
30.0 / 30.0

Subtask #4
30.0 / 30.0