답안 #97736 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97736	2019-02-17T21:00:34 Z	luciocf	Global Warming (CEOI18_glo)	C++14	65 / 100	2000 ms	86816 KB

#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e5+10;
const int maxv = 2e9+10;

struct Node
{
	int v;
	Node *l, *r;

	Node()
	{
		v = 0;
		l = r = NULL;
	}
};

int n, x;
int num[maxn];
int pref[maxn], suf[maxn];

int get(Node *t) {return (t ? t->v : 0);}

void clear(Node *node, int l, int r)
{
	if (!node) return;

	if (l == r)
	{
		node->v = 0;
		return;
	}

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

	clear(node->l, l, mid); clear(node->r, mid+1, r);

	node->v = 0;
}

void upd(Node *node, int l, int r, int pos, int v)
{
	if (l == r)
	{
		node->v = max(v, node->v);
		return;
	}

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

	if (pos <= mid)
	{
		if (!node->l) node->l = new Node();
		upd(node->l, l, mid, pos, v);
	}
	else
	{
		if (!node->r) node->r = new Node();
		upd(node->r, mid+1, r, pos, v);
	}

	node->v = max(get(node->l), get(node->r));
}

int query(Node *node, int l, int r, int a, int b)
{
	if (!node || l > b || r < a) return 0;
	if (l >= a && r <= b) return node->v;

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

	int p1 = query(node->l, l, mid, a, b);
	int p2 = query(node->r, mid+1, r, a, b);

	return max(p1, p2);
}

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

	Node *t = new Node();

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

	for (int i = 1; i <= n; i++)
	{
		int val = 0;

		if (num[i] > 1) 
			val = query(t, 1, maxv-1, 1, num[i]-1);

		pref[i] = val+1;

		upd(t, 1, maxv-1, num[i], pref[i]);
	}

	clear(t, 1, maxv-1);

	for (int i = n; i >= 1; i--)
	{
		int val = query(t, 1, maxv-1, num[i]+1, maxv-1);

		suf[i] = val+1;

		upd(t, 1, maxv-1, num[i], suf[i]);
	}

	int ans = 0;

	clear(t, 1, maxv-1);

	for (int i = 1; i <= n; i++)
	{
		int val = 0;
		if (num[i]+x > 1) val = query(t, 1, maxv-1, 1, num[i]+x-1);

		ans = max(ans, suf[i]+val);

		upd(t, 1, maxv-1, num[i], pref[i]);
	}

	clear(t, 1, maxv-1);

	for (int i = n; i >= 1; i--)
	{
		int val = query(t, 1, maxv-1, max(1, num[i]-x+1), maxv-1);

		ans = max(ans, pref[i]+val);

		upd(t, 1, maxv-1, num[i], suf[i]);
	}

	printf("%d\n", ans);
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	6 ms	1068 KB	Output is correct
20	Correct	9 ms	1024 KB	Output is correct
21	Correct	7 ms	1024 KB	Output is correct
22	Correct	7 ms	1024 KB	Output is correct
23	Correct	6 ms	768 KB	Output is correct
24	Correct	5 ms	768 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct

Subtask #4
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2031 ms	86732 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	381 ms	25080 KB	Output is correct
2	Correct	376 ms	25228 KB	Output is correct
3	Correct	407 ms	25080 KB	Output is correct
4	Correct	151 ms	13908 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	93 ms	3244 KB	Output is correct
7	Correct	277 ms	18040 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	860 ms	46716 KB	Output is correct
2	Correct	858 ms	46712 KB	Output is correct
3	Correct	1853 ms	86816 KB	Output is correct
4	Correct	495 ms	47860 KB	Output is correct
5	Correct	175 ms	8440 KB	Output is correct
6	Correct	271 ms	15736 KB	Output is correct
7	Correct	294 ms	16504 KB	Output is correct
8	Correct	493 ms	34936 KB	Output is correct

Subtask #7
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	3 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	3 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	6 ms	1068 KB	Output is correct
20	Correct	9 ms	1024 KB	Output is correct
21	Correct	7 ms	1024 KB	Output is correct
22	Correct	7 ms	1024 KB	Output is correct
23	Correct	6 ms	768 KB	Output is correct
24	Correct	5 ms	768 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Execution timed out	2031 ms	86732 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

답안 #97736

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
0 / 25.0