oj.uz

Submission #518467

# Submission time Handle Problem Language Result Execution time Memory
518467 2022-01-23T21:17:03 Z Yazan_Alattar Global Warming (CEOI18_glo) C++14
75 / 100
 871 ms 189136 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 300007;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

#define int ll

int n, x, a[M], pref[M], suf[M], last[M], seg[32 * M], L[32 * M], R[32 * M], ans, nodesNum = 1;
map <int,int> lastocur;

void upd(int pos, int v, int node = 1, int l = 1, int r = 1e9)
{
    if(l == r){
        seg[node] = v;
        return;
    }
    int mid = (l + r) / 2;
    if(pos <= mid){
        if(!L[node]) L[node] = ++nodesNum;
        upd(pos, v, L[node], l, mid);
   }
    else{
        if(!R[node]) R[node] = ++nodesNum;
        upd(pos, v, R[node], mid + 1, r);
    }
    seg[node] = max(seg[L[node]], seg[R[node]]);
    return;
}

int get(int st, int en, int node = 1, int l = 1, int r = 1e9)
{
    if(l > en || r < st) return -inf;
    if(l >= st && r <= en) return seg[node];
    if(!L[node]) L[node] = ++nodesNum;
    if(!R[node]) R[node] = ++nodesNum;
    int mid = (l + r) / 2;
    return max(get(st, en, L[node], l, mid), get(st, en, R[node], mid + 1, r));
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> x;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    vector <int> lis;
    for(int i = 1; i <= n; ++i){
        int it = lower_bound(all(lis), a[i]) - lis.begin();
        if(it == lis.size()) lis.pb(a[i]);
        else lis[it] = a[i];
        pref[i] = it + 1;
    }
    ans = lis.size();
    lis.clear();
    for(int i = n; i; --i){
        int it = lower_bound(all(lis), - a[i]) - lis.begin();
        if(it == lis.size()) lis.pb(-a[i]);
        else lis[it] = -a[i];
        suf[i] = it  + 1;
        upd(a[i], it + 1);
        if(lastocur[a[i]]) last[i] = lastocur[a[i]];
        lastocur[a[i]] = i;
    }
    for(int i = 1; i <= n; ++i){
        upd(a[i], suf[last[i]]);
        ans = max(ans, pref[i] + get(max(1ll, a[i] - x + 1), min((ll)1e9, a[i] + x - 1)));
    }
    cout << ans << endl;
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:69:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         if(it == lis.size()) lis.pb(a[i]);
      |            ~~~^~~~~~~~~~~~~
glo.cpp:77:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         if(it == lis.size()) lis.pb(-a[i]);
      |            ~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 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 1 ms 332 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 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 1 ms 332 KB Output is correct
19 Correct 3 ms 1868 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 4 ms 1612 KB Output is correct
22 Correct 2 ms 844 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 972 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 658 ms 80700 KB Output is correct
2 Correct 658 ms 80804 KB Output is correct
3 Correct 626 ms 80808 KB Output is correct
4 Correct 645 ms 80652 KB Output is correct
5 Correct 240 ms 47440 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 38488 KB Output is correct
2 Correct 141 ms 38556 KB Output is correct
3 Correct 138 ms 38512 KB Output is correct
4 Correct 68 ms 21608 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 51 ms 5368 KB Output is correct
7 Correct 95 ms 27972 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 42824 KB Output is correct
2 Correct 246 ms 42816 KB Output is correct
3 Correct 552 ms 80632 KB Output is correct
4 Correct 202 ms 47396 KB Output is correct
5 Correct 82 ms 13972 KB Output is correct
6 Correct 150 ms 26264 KB Output is correct
7 Correct 175 ms 26516 KB Output is correct
8 Correct 153 ms 33160 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 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 1 ms 332 KB Output is correct
19 Correct 3 ms 1868 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 4 ms 1612 KB Output is correct
22 Correct 2 ms 844 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 972 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 658 ms 80700 KB Output is correct
28 Correct 658 ms 80804 KB Output is correct
29 Correct 626 ms 80808 KB Output is correct
30 Correct 645 ms 80652 KB Output is correct
31 Correct 240 ms 47440 KB Output is correct
32 Correct 130 ms 38488 KB Output is correct
33 Correct 141 ms 38556 KB Output is correct
34 Correct 138 ms 38512 KB Output is correct
35 Correct 68 ms 21608 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 51 ms 5368 KB Output is correct
38 Correct 95 ms 27972 KB Output is correct
39 Correct 256 ms 42824 KB Output is correct
40 Correct 246 ms 42816 KB Output is correct
41 Correct 552 ms 80632 KB Output is correct
42 Correct 202 ms 47396 KB Output is correct
43 Correct 82 ms 13972 KB Output is correct
44 Correct 150 ms 26264 KB Output is correct
45 Correct 175 ms 26516 KB Output is correct
46 Correct 153 ms 33160 KB Output is correct
47 Correct 341 ms 92624 KB Output is correct
48 Correct 347 ms 104912 KB Output is correct
49 Incorrect 871 ms 189136 KB Output isn't correct
50 Halted 0 ms 0 KB -