답안 #973587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
973587	2024-05-02T07:45:43 Z	TAhmed33	Global Warming (CEOI18_glo)	C++	100 / 100	153 ms	14792 KB

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 25;
#define mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
struct BIT {
  int tree[MAXN];
  void update (int a, int b) {
    for (; a < MAXN; a += a & (-a)) tree[a] = max(tree[a], b);
  }
  int get (int x) {
    int ret = 0;
    for (; x > 0; x -= x & (-x)) ret = max(ret, tree[x]);
    return ret;
  }
} cur[2];
int n, x, a[MAXN], dp[MAXN][2];
vector <int> comp;
int f (int x) {
  return lower_bound(comp.begin(), comp.end(), x) - comp.begin();
}
void solve () {
  cin >> n >> x;
  for (int i = 1; i <= n; i++) cin >> a[i];
  comp.push_back(-1e9); comp.back()--;
  for (int i = 1; i <= n; i++) {
    comp.push_back(a[i]);
    comp.push_back(a[i] - x);
  }
  sort(comp.begin(), comp.end());
  comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
  int u = comp.size();
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    dp[i][0] = cur[0].get(f(a[i] - x) - 1) + 1;
    dp[i][1] = max(cur[0].get(f(a[i]) - 1), cur[1].get(f(a[i]) - 1)) + 1;
    cur[0].update(f(a[i] - x), dp[i][0]);
    cur[1].update(f(a[i]), dp[i][1]);
    ans = max({ans, dp[i][0], dp[i][1]});
  }
  cout << ans << '\n';
}
signed main () {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  while (t--) solve();
}

Compilation message

glo.cpp: In function 'void solve()':
glo.cpp:33:7: warning: unused variable 'u' [-Wunused-variable]
   33 |   int u = comp.size();
      |       ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	133 ms	11312 KB	Output is correct
2	Correct	131 ms	11204 KB	Output is correct
3	Correct	133 ms	11388 KB	Output is correct
4	Correct	131 ms	11720 KB	Output is correct
5	Correct	66 ms	11208 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	32 ms	7636 KB	Output is correct
2	Correct	32 ms	7644 KB	Output is correct
3	Correct	32 ms	7636 KB	Output is correct
4	Correct	19 ms	7432 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	16 ms	7416 KB	Output is correct
7	Correct	27 ms	7644 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	7884 KB	Output is correct
2	Correct	69 ms	8112 KB	Output is correct
3	Correct	153 ms	11328 KB	Output is correct
4	Correct	68 ms	11976 KB	Output is correct
5	Correct	44 ms	8908 KB	Output is correct
6	Correct	71 ms	12456 KB	Output is correct
7	Correct	76 ms	13016 KB	Output is correct
8	Correct	59 ms	8904 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4440 KB	Output is correct
4	Correct	1 ms	4696 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4440 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	2 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	1 ms	4596 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4444 KB	Output is correct
26	Correct	1 ms	4444 KB	Output is correct
27	Correct	133 ms	11312 KB	Output is correct
28	Correct	131 ms	11204 KB	Output is correct
29	Correct	133 ms	11388 KB	Output is correct
30	Correct	131 ms	11720 KB	Output is correct
31	Correct	66 ms	11208 KB	Output is correct
32	Correct	32 ms	7636 KB	Output is correct
33	Correct	32 ms	7644 KB	Output is correct
34	Correct	32 ms	7636 KB	Output is correct
35	Correct	19 ms	7432 KB	Output is correct
36	Correct	1 ms	4444 KB	Output is correct
37	Correct	16 ms	7416 KB	Output is correct
38	Correct	27 ms	7644 KB	Output is correct
39	Correct	69 ms	7884 KB	Output is correct
40	Correct	69 ms	8112 KB	Output is correct
41	Correct	153 ms	11328 KB	Output is correct
42	Correct	68 ms	11976 KB	Output is correct
43	Correct	44 ms	8908 KB	Output is correct
44	Correct	71 ms	12456 KB	Output is correct
45	Correct	76 ms	13016 KB	Output is correct
46	Correct	59 ms	8904 KB	Output is correct
47	Correct	69 ms	9432 KB	Output is correct
48	Correct	74 ms	9420 KB	Output is correct
49	Correct	141 ms	14792 KB	Output is correct
50	Correct	64 ms	13000 KB	Output is correct
51	Correct	66 ms	11220 KB	Output is correct
52	Correct	82 ms	12860 KB	Output is correct
53	Correct	75 ms	12628 KB	Output is correct
54	Correct	78 ms	13256 KB	Output is correct
55	Correct	118 ms	14396 KB	Output is correct

답안 #973587

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 17.0 / 17.0

Subtask #7 25.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
17.0 / 17.0

Subtask #7
25.0 / 25.0