답안 #290480

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290480	2020-09-03T21:45:55 Z	luciocf	Bigger segments (IZhO19_segments)	C++14	100 / 100	340 ms	27128 KB

segments

#include <bits/stdc++.h>
 
#define ff first
#define ss second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, ll> pii; 

const int maxn = 5e5+10;
const ll inf = 1e18+10;

int a[maxn];
ll pref[maxn];

pii dp[maxn];
ll v[maxn];


struct SegmentTree
{
	ll tree[4*maxn];
 
	void upd(int node, int l, int r, int pos, ll v)
	{
		if (l == r)
		{
			tree[node] = v;
			return;
		}

		int mid = (l+r)>>1;

		if (pos <= mid) upd(2*node, l, mid, pos, v);
		else upd(2*node+1, mid+1, r, pos, v);

		tree[node] = min(tree[2*node], tree[2*node+1]);
	}
 
	int query(int node, int l, int r, int a, int b, ll v)
	{
		if (l > b || r < a || tree[node] > v) return -1;
		if (l == r) return l;
 
		int mid = (l+r)>>1;
 
		int p1 = query(2*node+1, mid+1, r, a, b, v);
 
		if (p1 == -1) return query(2*node, l, mid, a, b, v);
		return p1;
	}
} seg;

int main(void)
{
	int n;
	scanf("%d", &n);
 
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);

		pref[i] = pref[i-1] + 1ll*a[i];
	}
 
	dp[1] = {1, a[1]+pref[1]};
 	seg.upd(1, 1, n, 1, dp[1].ss);

 	int l1 = 0, r1 = 0, l2 = 1, r2 = 1;

	for (int i = 2; i <= n; i++)
	{
		int p1 = seg.query(1, 1, n, l1, r1, pref[i]);
		int p2 = seg.query(1, 1, n, l2, r2, pref[i]);

		if (p2 != -1)
		{
			dp[i].ff = dp[p2].ff+1;
			dp[i].ss = 2*pref[i] - pref[p2];

			l1 = l2, r1 = r2;
			l2 = r2 = i;
		}
		else
		{
			dp[i].ff = dp[p1].ff+1;
			dp[i].ss = 2*pref[i] - pref[p1];

			++r2;
		}

		seg.upd(1, 1, n, i, dp[i].ss);
	}
 
	printf("%d\n", dp[n].ff);
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:58:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   58 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
segments.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	2 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	2 ms	512 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	2 ms	512 KB	Output is correct
40	Correct	2 ms	512 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	2 ms	512 KB	Output is correct
43	Correct	2 ms	512 KB	Output is correct
44	Correct	2 ms	512 KB	Output is correct
45	Correct	2 ms	512 KB	Output is correct

Subtask #4
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	2 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	2 ms	512 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	2 ms	512 KB	Output is correct
40	Correct	2 ms	512 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	2 ms	512 KB	Output is correct
43	Correct	2 ms	512 KB	Output is correct
44	Correct	2 ms	512 KB	Output is correct
45	Correct	2 ms	512 KB	Output is correct
46	Correct	40 ms	5112 KB	Output is correct
47	Correct	54 ms	5624 KB	Output is correct
48	Correct	60 ms	6008 KB	Output is correct
49	Correct	62 ms	6008 KB	Output is correct
50	Correct	57 ms	6136 KB	Output is correct
51	Correct	64 ms	6136 KB	Output is correct
52	Correct	31 ms	3200 KB	Output is correct
53	Correct	19 ms	1920 KB	Output is correct
54	Correct	54 ms	5368 KB	Output is correct
55	Correct	61 ms	6120 KB	Output is correct
56	Correct	53 ms	5624 KB	Output is correct
57	Correct	58 ms	5520 KB	Output is correct
58	Correct	55 ms	5624 KB	Output is correct
59	Correct	54 ms	5752 KB	Output is correct
60	Correct	56 ms	5752 KB	Output is correct

Subtask #5
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 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	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	2 ms	512 KB	Output is correct
32	Correct	2 ms	512 KB	Output is correct
33	Correct	2 ms	512 KB	Output is correct
34	Correct	2 ms	512 KB	Output is correct
35	Correct	2 ms	512 KB	Output is correct
36	Correct	3 ms	512 KB	Output is correct
37	Correct	2 ms	512 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	2 ms	512 KB	Output is correct
40	Correct	2 ms	512 KB	Output is correct
41	Correct	2 ms	512 KB	Output is correct
42	Correct	2 ms	512 KB	Output is correct
43	Correct	2 ms	512 KB	Output is correct
44	Correct	2 ms	512 KB	Output is correct
45	Correct	2 ms	512 KB	Output is correct
46	Correct	40 ms	5112 KB	Output is correct
47	Correct	54 ms	5624 KB	Output is correct
48	Correct	60 ms	6008 KB	Output is correct
49	Correct	62 ms	6008 KB	Output is correct
50	Correct	57 ms	6136 KB	Output is correct
51	Correct	64 ms	6136 KB	Output is correct
52	Correct	31 ms	3200 KB	Output is correct
53	Correct	19 ms	1920 KB	Output is correct
54	Correct	54 ms	5368 KB	Output is correct
55	Correct	61 ms	6120 KB	Output is correct
56	Correct	53 ms	5624 KB	Output is correct
57	Correct	58 ms	5520 KB	Output is correct
58	Correct	55 ms	5624 KB	Output is correct
59	Correct	54 ms	5752 KB	Output is correct
60	Correct	56 ms	5752 KB	Output is correct
61	Correct	212 ms	24188 KB	Output is correct
62	Correct	246 ms	24200 KB	Output is correct
63	Correct	284 ms	24568 KB	Output is correct
64	Correct	331 ms	26744 KB	Output is correct
65	Correct	297 ms	27128 KB	Output is correct
66	Correct	340 ms	27128 KB	Output is correct
67	Correct	270 ms	23416 KB	Output is correct
68	Correct	130 ms	11896 KB	Output is correct
69	Correct	296 ms	23416 KB	Output is correct
70	Correct	327 ms	27128 KB	Output is correct
71	Correct	284 ms	24184 KB	Output is correct
72	Correct	307 ms	24568 KB	Output is correct
73	Correct	293 ms	25208 KB	Output is correct
74	Correct	296 ms	25720 KB	Output is correct
75	Correct	297 ms	25592 KB	Output is correct

답안 #290480

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 10.0 / 10.0

Subtask #4 36.0 / 36.0

Subtask #5 27.0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
10.0 / 10.0

Subtask #4
36.0 / 36.0

Subtask #5
27.0 / 27.0