oj.uz

Submission #70983

# Submission time Handle Problem Language Result Execution time Memory
70983 2018-08-24T00:45:26 Z 강태규(#2201) Global Warming (CEOI18_glo) C++11
100 / 100
 217 ms 3872 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>

using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;

int n, x, m;
int t[200001];
int dp[200001][2];
int cp[200000];

int find(int x) {
    return lower_bound(cp, cp + m, x) - cp + 1;
}

int seg0[200001];
int seg1[200001];
void update(int seg[], int i, int x) {
    while (i <= m) {
        seg[i] = max(seg[i], x);
        i += i & -i;
    }
}

int query(int seg[], int i) {
    int ret = 0;
    while (i) {
        ret = max(ret, seg[i]);
        i -= i & -i;
    }
    return ret;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	scanf("%d%d", &n, &x);
	for (int i = 1; i <= n; ++i) {
        scanf("%d", t + i);
        cp[i - 1] = t[i];
	}
	sort(cp, cp + n);
	m = unique(cp, cp + n) - cp;
	for (int i = 1; i <= n; ++i) {
        int pr0 = find(t[i]);
        int pr1 = find(t[i] + x) - 1;
        int dp0 = query(seg0, pr0 - 1) + 1;
        int dp1 = max(query(seg0, pr1), query(seg1, pr0 - 1)) + 1;
        update(seg0, pr0, dp0);
        update(seg1, pr0, dp1);
	}
	printf("%d\n", max(query(seg0, m), query(seg1, m)));
	return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:50: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:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", t + i);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 2 ms 608 KB Output is correct
15 Correct 2 ms 608 KB Output is correct
16 Correct 3 ms 608 KB Output is correct
17 Correct 3 ms 608 KB Output is correct
18 Correct 2 ms 608 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 2 ms 608 KB Output is correct
15 Correct 2 ms 608 KB Output is correct
16 Correct 3 ms 608 KB Output is correct
17 Correct 3 ms 608 KB Output is correct
18 Correct 2 ms 608 KB Output is correct
19 Correct 3 ms 608 KB Output is correct
20 Correct 3 ms 608 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 4 ms 608 KB Output is correct
23 Correct 3 ms 608 KB Output is correct
24 Correct 3 ms 608 KB Output is correct
25 Correct 2 ms 608 KB Output is correct
26 Correct 4 ms 608 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 3824 KB Output is correct
2 Correct 173 ms 3824 KB Output is correct
3 Correct 149 ms 3824 KB Output is correct
4 Correct 158 ms 3872 KB Output is correct
5 Correct 76 ms 3872 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3872 KB Output is correct
2 Correct 33 ms 3872 KB Output is correct
3 Correct 36 ms 3872 KB Output is correct
4 Correct 18 ms 3872 KB Output is correct
5 Correct 2 ms 3872 KB Output is correct
6 Correct 20 ms 3872 KB Output is correct
7 Correct 31 ms 3872 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 3872 KB Output is correct
2 Correct 60 ms 3872 KB Output is correct
3 Correct 137 ms 3872 KB Output is correct
4 Correct 69 ms 3872 KB Output is correct
5 Correct 35 ms 3872 KB Output is correct
6 Correct 74 ms 3872 KB Output is correct
7 Correct 75 ms 3872 KB Output is correct
8 Correct 59 ms 3872 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 3 ms 508 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 540 KB Output is correct
7 Correct 2 ms 544 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 564 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 3 ms 564 KB Output is correct
14 Correct 2 ms 608 KB Output is correct
15 Correct 2 ms 608 KB Output is correct
16 Correct 3 ms 608 KB Output is correct
17 Correct 3 ms 608 KB Output is correct
18 Correct 2 ms 608 KB Output is correct
19 Correct 3 ms 608 KB Output is correct
20 Correct 3 ms 608 KB Output is correct
21 Correct 3 ms 608 KB Output is correct
22 Correct 4 ms 608 KB Output is correct
23 Correct 3 ms 608 KB Output is correct
24 Correct 3 ms 608 KB Output is correct
25 Correct 2 ms 608 KB Output is correct
26 Correct 4 ms 608 KB Output is correct
27 Correct 217 ms 3824 KB Output is correct
28 Correct 173 ms 3824 KB Output is correct
29 Correct 149 ms 3824 KB Output is correct
30 Correct 158 ms 3872 KB Output is correct
31 Correct 76 ms 3872 KB Output is correct
32 Correct 33 ms 3872 KB Output is correct
33 Correct 33 ms 3872 KB Output is correct
34 Correct 36 ms 3872 KB Output is correct
35 Correct 18 ms 3872 KB Output is correct
36 Correct 2 ms 3872 KB Output is correct
37 Correct 20 ms 3872 KB Output is correct
38 Correct 31 ms 3872 KB Output is correct
39 Correct 73 ms 3872 KB Output is correct
40 Correct 60 ms 3872 KB Output is correct
41 Correct 137 ms 3872 KB Output is correct
42 Correct 69 ms 3872 KB Output is correct
43 Correct 35 ms 3872 KB Output is correct
44 Correct 74 ms 3872 KB Output is correct
45 Correct 75 ms 3872 KB Output is correct
46 Correct 59 ms 3872 KB Output is correct
47 Correct 79 ms 3872 KB Output is correct
48 Correct 82 ms 3872 KB Output is correct
49 Correct 190 ms 3872 KB Output is correct
50 Correct 94 ms 3872 KB Output is correct
51 Correct 70 ms 3872 KB Output is correct
52 Correct 85 ms 3872 KB Output is correct
53 Correct 80 ms 3872 KB Output is correct
54 Correct 73 ms 3872 KB Output is correct
55 Correct 139 ms 3872 KB Output is correct