oj.uz

Submission #313939

# Submission time Handle Problem Language Result Execution time Memory
313939 2020-10-17T11:52:18 Z BeanZ Global Warming (CEOI18_glo) C++14
100 / 100
 57 ms 6512 KB 
// I_Love_LPL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 2e5 + 5;
ll dp[N], a[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (fopen("A.inp", "r")){
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ll n, x;
    cin >> n >> x;
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<ll> val;
    ll ans = 0;
    for (int i = n; i >= 1; i--){
        ll l = 0, h = val.size() - 1;
        while (l <= h){
            ll mid = (l + h) >> 1;
            if (val[mid] > a[i]) l = mid + 1;
            else h = mid - 1;
        }
        if (l == val.size()) val.push_back(a[i]);
        else {
            val[l] = max(val[l], a[i]);
        }
        dp[i] = l + 1;
        ans = max(ans, dp[i]);
    }
    val.clear();
    for (int i = 1; i <= n; i++){
        ll l = 0, h = val.size() - 1;
        while (l <= h){
            ll mid = (l + h) >> 1;
            if (val[mid] < a[i]) l = mid + 1;
            else h = mid - 1;
        }
        if (l == val.size()) val.push_back(a[i]);
        else {
            val[l] = min(val[l], a[i]);
        }
        ans = max(ans, (ll)val.size());
        if (i == n) continue;
        l = 0, h = val.size() - 1;
        while (l <= h){
            ll mid = (l + h) >> 1;
            if (val[mid] >= (a[i + 1] + x)){
                h = mid - 1;
            } else l = mid + 1;
        }
        ans = max(ans, h + 1 + dp[i + 1]);
    }
    cout << ans;
}
/*
*/

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:27:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         if (l == val.size()) val.push_back(a[i]);
      |             ~~^~~~~~~~~~~~~
glo.cpp:42:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         if (l == val.size()) val.push_back(a[i]);
      |             ~~^~~~~~~~~~~~~
glo.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   12 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:13:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5372 KB Output is correct
2 Correct 55 ms 5496 KB Output is correct
3 Correct 55 ms 5496 KB Output is correct
4 Correct 55 ms 5368 KB Output is correct
5 Correct 33 ms 5496 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1664 KB Output is correct
2 Correct 13 ms 1664 KB Output is correct
3 Correct 13 ms 1664 KB Output is correct
4 Correct 8 ms 1792 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 8 ms 1792 KB Output is correct
7 Correct 12 ms 1664 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2944 KB Output is correct
2 Correct 25 ms 2944 KB Output is correct
3 Correct 50 ms 5472 KB Output is correct
4 Correct 33 ms 5488 KB Output is correct
5 Correct 16 ms 3068 KB Output is correct
6 Correct 29 ms 5500 KB Output is correct
7 Correct 32 ms 6000 KB Output is correct
8 Correct 21 ms 2944 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 55 ms 5372 KB Output is correct
28 Correct 55 ms 5496 KB Output is correct
29 Correct 55 ms 5496 KB Output is correct
30 Correct 55 ms 5368 KB Output is correct
31 Correct 33 ms 5496 KB Output is correct
32 Correct 14 ms 1664 KB Output is correct
33 Correct 13 ms 1664 KB Output is correct
34 Correct 13 ms 1664 KB Output is correct
35 Correct 8 ms 1792 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 8 ms 1792 KB Output is correct
38 Correct 12 ms 1664 KB Output is correct
39 Correct 25 ms 2944 KB Output is correct
40 Correct 25 ms 2944 KB Output is correct
41 Correct 50 ms 5472 KB Output is correct
42 Correct 33 ms 5488 KB Output is correct
43 Correct 16 ms 3068 KB Output is correct
44 Correct 29 ms 5500 KB Output is correct
45 Correct 32 ms 6000 KB Output is correct
46 Correct 21 ms 2944 KB Output is correct
47 Correct 27 ms 2940 KB Output is correct
48 Correct 28 ms 3064 KB Output is correct
49 Correct 57 ms 5368 KB Output is correct
50 Correct 33 ms 5496 KB Output is correct
51 Correct 28 ms 4492 KB Output is correct
52 Correct 34 ms 5616 KB Output is correct
53 Correct 32 ms 5756 KB Output is correct
54 Correct 34 ms 6512 KB Output is correct
55 Correct 46 ms 5368 KB Output is correct