답안 #118111

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118111	2019-06-18T08:02:46 Z	davitmarg	Global Warming (CEOI18_glo)	C++17	58 / 100	1051 ms	262144 KB

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <ctype.h>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n, x, mx, a[200005];
vector<int> t,L,R;

int addNode(int val=0)
{
	t.PB(val);
	L.PB(-1);
	R.PB(-1);
	return ((int)t.size() - 1);
}

void build()
{
	t.clear();
	addNode();
	addNode();
}

void add(int v, int l, int r, int pos,int val)
{
	if (l == r)
	{
		t[v] = max(t[v],val);
		return;
	}
	int m = (l + r) >> 1;
	if (L[v] == -1)
		L[v] = addNode();
	if (R[v] == -1)
		R[v] = addNode();
	if (pos <= m)
		add(L[v], l, m, pos, val);
	else
		add(R[v], m + 1, r, pos, val);
	t[v] = max(t[L[v]], t[R[v]]);
}

int get(int v,int l,int r,int pos)
{
	if (r == pos)
		return t[v];

	int m = (l + r) >> 1;
	if (L[v] == -1)
		L[v] = addNode();
	if (R[v] == -1)
		R[v] = addNode();

	if (pos <= m)
		return get(L[v], l, m, pos);
	else
		return max(t[L[v]], get(R[v], m + 1, r, pos));
}

int main()
{
	cin >> n >> x;
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", a + i);
		mx = max(mx, a[i]);
	}
	mx += x+10;
	build();
	for (int i = 1; i <= n; i++)
	{
		add(1, 0, mx, a[i] + x, get(1, 0, mx, a[i] + x - 1) + 1);
		add(1, 0, mx, a[i] + x, get(0, 0, mx, a[i] + x - 1) + 1);
		add(0, 0, mx, a[i], get(0, 0, mx, a[i] - 1) + 1);
	}

	cout << get(1, 0, mx, mx) << endl;

	return 0;
}


/*

3 1
1 1 3

*/

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:86:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + 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	2 ms	256 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	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	368 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 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	2 ms	256 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	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	368 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 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	2 ms	256 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	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	368 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	7 ms	1776 KB	Output is correct
20	Correct	7 ms	1776 KB	Output is correct
21	Correct	7 ms	1648 KB	Output is correct
22	Correct	7 ms	1532 KB	Output is correct
23	Correct	5 ms	1152 KB	Output is correct
24	Correct	5 ms	1152 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	512 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1043 ms	132800 KB	Output is correct
2	Correct	1051 ms	132984 KB	Output is correct
3	Correct	1035 ms	132876 KB	Output is correct
4	Correct	1049 ms	132836 KB	Output is correct
5	Correct	434 ms	68188 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	234 ms	37088 KB	Output is correct
2	Correct	243 ms	37224 KB	Output is correct
3	Correct	240 ms	37220 KB	Output is correct
4	Correct	110 ms	20492 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	41 ms	3288 KB	Output is correct
7	Correct	186 ms	34192 KB	Output is correct

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	377 ms	262144 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

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	2 ms	256 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	384 KB	Output is correct
7	Correct	2 ms	384 KB	Output is correct
8	Correct	2 ms	368 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	7 ms	1776 KB	Output is correct
20	Correct	7 ms	1776 KB	Output is correct
21	Correct	7 ms	1648 KB	Output is correct
22	Correct	7 ms	1532 KB	Output is correct
23	Correct	5 ms	1152 KB	Output is correct
24	Correct	5 ms	1152 KB	Output is correct
25	Correct	3 ms	384 KB	Output is correct
26	Correct	3 ms	512 KB	Output is correct
27	Correct	1043 ms	132800 KB	Output is correct
28	Correct	1051 ms	132984 KB	Output is correct
29	Correct	1035 ms	132876 KB	Output is correct
30	Correct	1049 ms	132836 KB	Output is correct
31	Correct	434 ms	68188 KB	Output is correct
32	Correct	234 ms	37088 KB	Output is correct
33	Correct	243 ms	37224 KB	Output is correct
34	Correct	240 ms	37220 KB	Output is correct
35	Correct	110 ms	20492 KB	Output is correct
36	Correct	2 ms	256 KB	Output is correct
37	Correct	41 ms	3288 KB	Output is correct
38	Correct	186 ms	34192 KB	Output is correct
39	Runtime error	377 ms	262144 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
40	Halted	0 ms	0 KB	-

답안 #118111

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 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
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 17.0

Subtask #7
0 / 25.0