oj.uz

Submission #518680

# Submission time Handle Problem Language Result Execution time Memory
518680 2022-01-24T12:13:18 Z zhangjishen Global Warming (CEOI18_glo) C++
100 / 100
 128 ms 7860 KB 
#include<bits/stdc++.h>
using namespace std;

template<typename T> bool chkmin(T &a, T b){return b < a ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return b > a ? a = b, 1 : 0;}
typedef long long ll;
const int MAXN = 2e5 + 10;

int n, x, a[MAXN], b[MAXN], t, d[MAXN], f[MAXN], g[MAXN];

// fenwick tree
struct BIT{
	int c[MAXN];
	void update(int i, int k){
		for(; i <= t; i += i & -i)
			chkmax(c[i], k);
	}
	int qry(int i){
		int ans = 0;
		for(; i; i -= i & -i)
			chkmax(ans, c[i]);
		return ans;
	}
}c1, c2;

int main(){
	// input
	scanf("%d %d", &n, &x);
	for(int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	// disc
	for(int i = 1; i <= n; i++)
		d[i] = a[i];
	sort(d + 1, d + 1 + n);
	t = unique(d + 1, d + 1 + n) - (d + 1);
	for(int i = 1; i <= n; i++)
		b[i] = lower_bound(d + 1, d + 1 + t, a[i]) - d;
	// dp
	for(int i = 1; i <= n; i++){
		// update f
		f[i] = c1.qry(b[i] - 1) + 1;	
		// update g
		chkmax(g[i], c2.qry(b[i] - 1) + 1);
		int m = lower_bound(d + 1, d + 1 + t, a[i] + x) - d;
		chkmax(g[i], c1.qry(m - 1) + 1);
		// update c1, c2 to [1, i]
		c1.update(b[i], f[i]);
		c2.update(b[i], g[i]);
	}
	int ans = 0;
	for(int i = 1; i <= n; i++)
		chkmax(ans, g[i]);
	printf("%d\n", ans);
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 296 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 300 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 7696 KB Output is correct
2 Correct 128 ms 7624 KB Output is correct
3 Correct 112 ms 7564 KB Output is correct
4 Correct 113 ms 7860 KB Output is correct
5 Correct 51 ms 6052 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2092 KB Output is correct
2 Correct 26 ms 2040 KB Output is correct
3 Correct 30 ms 2096 KB Output is correct
4 Correct 17 ms 1740 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1740 KB Output is correct
7 Correct 21 ms 2120 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 3908 KB Output is correct
2 Correct 41 ms 3908 KB Output is correct
3 Correct 91 ms 7608 KB Output is correct
4 Correct 57 ms 6196 KB Output is correct
5 Correct 26 ms 3548 KB Output is correct
6 Correct 46 ms 6716 KB Output is correct
7 Correct 51 ms 7236 KB Output is correct
8 Correct 36 ms 4004 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 304 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 127 ms 7696 KB Output is correct
28 Correct 128 ms 7624 KB Output is correct
29 Correct 112 ms 7564 KB Output is correct
30 Correct 113 ms 7860 KB Output is correct
31 Correct 51 ms 6052 KB Output is correct
32 Correct 24 ms 2092 KB Output is correct
33 Correct 26 ms 2040 KB Output is correct
34 Correct 30 ms 2096 KB Output is correct
35 Correct 17 ms 1740 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 13 ms 1740 KB Output is correct
38 Correct 21 ms 2120 KB Output is correct
39 Correct 48 ms 3908 KB Output is correct
40 Correct 41 ms 3908 KB Output is correct
41 Correct 91 ms 7608 KB Output is correct
42 Correct 57 ms 6196 KB Output is correct
43 Correct 26 ms 3548 KB Output is correct
44 Correct 46 ms 6716 KB Output is correct
45 Correct 51 ms 7236 KB Output is correct
46 Correct 36 ms 4004 KB Output is correct
47 Correct 52 ms 3996 KB Output is correct
48 Correct 57 ms 3980 KB Output is correct
49 Correct 111 ms 7668 KB Output is correct
50 Correct 55 ms 6060 KB Output is correct
51 Correct 49 ms 4780 KB Output is correct
52 Correct 65 ms 7096 KB Output is correct
53 Correct 62 ms 6948 KB Output is correct
54 Correct 51 ms 7628 KB Output is correct
55 Correct 90 ms 7620 KB Output is correct