oj.uz

Submission #144675

# Submission time Handle Problem Language Result Execution time Memory
144675 2019-08-17T12:06:23 Z nhamtan Global Warming (CEOI18_glo) C++14
100 / 100
 1560 ms 46228 KB 
#include<bits/stdc++.h>
using namespace std;

#define y1 as214
#define ii pair < int , int >
#define iii pair < int , ii >
#define iv pair < ii , ii >

#define fi first
#define se second
#define fr front()
#define pb push_back
#define t top()

#define FOR(i , x , n) for(int i = x ; i <= n ; ++i)
#define REP(i , n) for(int i = 0 ; i < n ; ++i)
#define FORD(i , x , n) for(int i = x ; i >= n ; --i)

#define ll long long
#define oo 2e9
#define int long long

const int N = 2e5 + 5;
int n , val , res;
int a[2 * N] , f[2 * N] , b[2 * N];
int st[8 * N];
unordered_map < int , int > m;

void up(int id , int l , int r , int i , int val)
{
    if(l > i || r < i)
        return;
    if(l == r)
    {
        st[id] = max(st[id] , val);
        return;
    }
    int mid = (l + r) / 2;
    up(id * 2 , l , mid , i , val);
    up(id * 2 + 1 , mid + 1 , r , i , val);
    st[id] = max(st[id * 2] , st[id * 2 + 1]);
}

int get(int id , int l , int r , int u , int v)
{
    if(l > v || r < u)
        return 0;
    else if(l >= u && r <= v)
        return st[id];
    int mid = (l + r) / 2;
    return max(get(id * 2 , l , mid , u , v) , get(id * 2 + 1 , mid + 1 , r , u , v));
}

main()
{
    //freopen("GLO.inp","r",stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> val;
    FOR(i , 1 , n)
    {
        cin >> a[i];
        b[i] = a[i];
        a[i + n] = b[i + n] = a[i] + val;
    }


    sort(b + 1 , b + 1 + 2 * n);
    b[0] = -oo;
    int r = 0;
    FOR(i , 1 , 2 * n)
    {
        if(b[i] != b[i - 1])
            m[b[i]] = ++r;
        else
            m[b[i]] = r;
    }

    FORD(i , n , 1)
    {
        f[i] = get(1 , 1 , 2 * n , m[a[i + n]] + 1 , 2 * n) + 1;
        up(1 , 1 , 2 * n , m[a[i + n]] , f[i]);
    }
    memset(st , 0 , sizeof(st));
    FOR(i , 1 , n + 1)
    {
        res = max(res , get(1 , 1 , 2 * n , 1 , m[a[i + n]] - 1) + f[i]);
        up(1 , 1 , 2 * n , m[a[i]] , get(1 , 1 , 2 * n , 1 , m[a[i]] - 1) + 1);
    }
     /// hết phần dương.



    m.clear();
    FOR(i , 1 , n)
        a[i + n] = b[i + n] = a[i] - val;
    sort(b + 1 , b + 1 + 2 * n);
    b[0] = -oo;
    r = 0;
    FOR(i , 1 , 2 * n)
    {
        if(b[i] != b[i - 1])
            m[b[i]] = ++r;
        else
            m[b[i]] = r;
    }

    memset(st , 0 , sizeof(st));
    FOR(i , 1 , n)
    {
        f[i] = get(1 , 1 , 2 * n , 1 , m[a[i + n]] - 1) + 1;
        up(1 , 1 , 2 * n , m[a[i + n]] , f[i]);
    }
    memset(st , 0 , sizeof(st));
    FORD(i , n , 0)
    {
        res = max(res , get(1 , 1 , 2 * n , m[a[i + n]] + 1 , n) + f[i]);
        up(1 , 1 , 2 * n , m[a[i]] , get(1 , 1 , 2 * n , m[a[i]] + 1 , n) + 1);
    }

    cout << res;
}

Compilation message

glo.cpp:54:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12920 KB Output is correct
2 Correct 14 ms 12920 KB Output is correct
3 Correct 14 ms 12920 KB Output is correct
4 Correct 14 ms 12792 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 14 ms 12920 KB Output is correct
7 Correct 15 ms 12924 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 19 ms 12932 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12920 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12920 KB Output is correct
2 Correct 14 ms 12920 KB Output is correct
3 Correct 14 ms 12920 KB Output is correct
4 Correct 14 ms 12792 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 14 ms 12920 KB Output is correct
7 Correct 15 ms 12924 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 19 ms 12932 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12920 KB Output is correct
12 Correct 14 ms 12968 KB Output is correct
13 Correct 14 ms 12920 KB Output is correct
14 Correct 15 ms 12920 KB Output is correct
15 Correct 15 ms 12920 KB Output is correct
16 Correct 15 ms 12920 KB Output is correct
17 Correct 14 ms 12836 KB Output is correct
18 Correct 14 ms 12920 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12920 KB Output is correct
2 Correct 14 ms 12920 KB Output is correct
3 Correct 14 ms 12920 KB Output is correct
4 Correct 14 ms 12792 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 14 ms 12920 KB Output is correct
7 Correct 15 ms 12924 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 19 ms 12932 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12920 KB Output is correct
12 Correct 14 ms 12968 KB Output is correct
13 Correct 14 ms 12920 KB Output is correct
14 Correct 15 ms 12920 KB Output is correct
15 Correct 15 ms 12920 KB Output is correct
16 Correct 15 ms 12920 KB Output is correct
17 Correct 14 ms 12836 KB Output is correct
18 Correct 14 ms 12920 KB Output is correct
19 Correct 17 ms 13048 KB Output is correct
20 Correct 17 ms 13048 KB Output is correct
21 Correct 18 ms 13048 KB Output is correct
22 Correct 17 ms 12968 KB Output is correct
23 Correct 16 ms 12940 KB Output is correct
24 Correct 21 ms 12920 KB Output is correct
25 Correct 17 ms 12892 KB Output is correct
26 Correct 17 ms 13048 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1151 ms 29464 KB Output is correct
2 Correct 1216 ms 29500 KB Output is correct
3 Correct 1156 ms 29564 KB Output is correct
4 Correct 1148 ms 29672 KB Output is correct
5 Correct 626 ms 25408 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 21372 KB Output is correct
2 Correct 266 ms 21344 KB Output is correct
3 Correct 265 ms 21380 KB Output is correct
4 Correct 147 ms 16808 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 129 ms 16776 KB Output is correct
7 Correct 203 ms 19048 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 641 ms 25608 KB Output is correct
2 Correct 638 ms 25532 KB Output is correct
3 Correct 1560 ms 37512 KB Output is correct
4 Correct 738 ms 29436 KB Output is correct
5 Correct 269 ms 25400 KB Output is correct
6 Correct 508 ms 36612 KB Output is correct
7 Correct 514 ms 36696 KB Output is correct
8 Correct 515 ms 25784 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12920 KB Output is correct
2 Correct 14 ms 12920 KB Output is correct
3 Correct 14 ms 12920 KB Output is correct
4 Correct 14 ms 12792 KB Output is correct
5 Correct 14 ms 12920 KB Output is correct
6 Correct 14 ms 12920 KB Output is correct
7 Correct 15 ms 12924 KB Output is correct
8 Correct 14 ms 12920 KB Output is correct
9 Correct 19 ms 12932 KB Output is correct
10 Correct 14 ms 12920 KB Output is correct
11 Correct 14 ms 12920 KB Output is correct
12 Correct 14 ms 12968 KB Output is correct
13 Correct 14 ms 12920 KB Output is correct
14 Correct 15 ms 12920 KB Output is correct
15 Correct 15 ms 12920 KB Output is correct
16 Correct 15 ms 12920 KB Output is correct
17 Correct 14 ms 12836 KB Output is correct
18 Correct 14 ms 12920 KB Output is correct
19 Correct 17 ms 13048 KB Output is correct
20 Correct 17 ms 13048 KB Output is correct
21 Correct 18 ms 13048 KB Output is correct
22 Correct 17 ms 12968 KB Output is correct
23 Correct 16 ms 12940 KB Output is correct
24 Correct 21 ms 12920 KB Output is correct
25 Correct 17 ms 12892 KB Output is correct
26 Correct 17 ms 13048 KB Output is correct
27 Correct 1151 ms 29464 KB Output is correct
28 Correct 1216 ms 29500 KB Output is correct
29 Correct 1156 ms 29564 KB Output is correct
30 Correct 1148 ms 29672 KB Output is correct
31 Correct 626 ms 25408 KB Output is correct
32 Correct 269 ms 21372 KB Output is correct
33 Correct 266 ms 21344 KB Output is correct
34 Correct 265 ms 21380 KB Output is correct
35 Correct 147 ms 16808 KB Output is correct
36 Correct 14 ms 12920 KB Output is correct
37 Correct 129 ms 16776 KB Output is correct
38 Correct 203 ms 19048 KB Output is correct
39 Correct 641 ms 25608 KB Output is correct
40 Correct 638 ms 25532 KB Output is correct
41 Correct 1560 ms 37512 KB Output is correct
42 Correct 738 ms 29436 KB Output is correct
43 Correct 269 ms 25400 KB Output is correct
44 Correct 508 ms 36612 KB Output is correct
45 Correct 514 ms 36696 KB Output is correct
46 Correct 515 ms 25784 KB Output is correct
47 Correct 653 ms 29708 KB Output is correct
48 Correct 616 ms 29748 KB Output is correct
49 Correct 1458 ms 46228 KB Output is correct
50 Correct 678 ms 29632 KB Output is correct
51 Correct 438 ms 26140 KB Output is correct
52 Correct 565 ms 29624 KB Output is correct
53 Correct 527 ms 37712 KB Output is correct
54 Correct 538 ms 37636 KB Output is correct
55 Correct 1055 ms 36612 KB Output is correct