oj.uz

Submission #518469

# Submission time Handle Problem Language Result Execution time Memory
518469 2022-01-23T21:20:55 Z Yazan_Alattar Global Warming (CEOI18_glo) C++14
100 / 100
 623 ms 74944 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};


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 + 1)
{
    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 + 1)
{
    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));
}

int 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(1, a[i] - x + 1), 1e9 + 1));
    }
    cout << ans << endl;
    return 0;
}

Compilation message

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

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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 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 332 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 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 332 KB Output is correct
19 Correct 2 ms 844 KB Output is correct
20 Correct 2 ms 844 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 352 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 43684 KB Output is correct
2 Correct 610 ms 43656 KB Output is correct
3 Correct 569 ms 43572 KB Output is correct
4 Correct 539 ms 43664 KB Output is correct
5 Correct 218 ms 25492 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 17988 KB Output is correct
2 Correct 98 ms 18056 KB Output is correct
3 Correct 106 ms 18020 KB Output is correct
4 Correct 51 ms 10204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 46 ms 3268 KB Output is correct
7 Correct 76 ms 13516 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 23092 KB Output is correct
2 Correct 201 ms 23160 KB Output is correct
3 Correct 475 ms 43796 KB Output is correct
4 Correct 186 ms 25400 KB Output is correct
5 Correct 75 ms 8712 KB Output is correct
6 Correct 153 ms 16268 KB Output is correct
7 Correct 155 ms 16324 KB Output is correct
8 Correct 125 ms 18296 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 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 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 332 KB Output is correct
19 Correct 2 ms 844 KB Output is correct
20 Correct 2 ms 844 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 547 ms 43684 KB Output is correct
28 Correct 610 ms 43656 KB Output is correct
29 Correct 569 ms 43572 KB Output is correct
30 Correct 539 ms 43664 KB Output is correct
31 Correct 218 ms 25492 KB Output is correct
32 Correct 102 ms 17988 KB Output is correct
33 Correct 98 ms 18056 KB Output is correct
34 Correct 106 ms 18020 KB Output is correct
35 Correct 51 ms 10204 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 46 ms 3268 KB Output is correct
38 Correct 76 ms 13516 KB Output is correct
39 Correct 188 ms 23092 KB Output is correct
40 Correct 201 ms 23160 KB Output is correct
41 Correct 475 ms 43796 KB Output is correct
42 Correct 186 ms 25400 KB Output is correct
43 Correct 75 ms 8712 KB Output is correct
44 Correct 153 ms 16268 KB Output is correct
45 Correct 155 ms 16324 KB Output is correct
46 Correct 125 ms 18296 KB Output is correct
47 Correct 249 ms 37104 KB Output is correct
48 Correct 266 ms 39364 KB Output is correct
49 Correct 623 ms 74944 KB Output is correct
50 Correct 223 ms 42928 KB Output is correct
51 Correct 118 ms 10556 KB Output is correct
52 Correct 257 ms 18628 KB Output is correct
53 Correct 148 ms 18364 KB Output is correct
54 Correct 163 ms 19140 KB Output is correct
55 Correct 357 ms 56704 KB Output is correct