oj.uz

Submission #162074

# Submission time Handle Problem Language Result Execution time Memory
162074 2019-11-06T08:55:15 Z Akashi Global Warming (CEOI18_glo) C++14
58 / 100
 903 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

int n, x;
int a[200005], s[200005];
int suf[200005], pref[200005];

int Sol = 0;

void find_lis(int d[], int st, int dr, int sgn){
    int L = 0;
    memset(s, 0, sizeof(s));

    for(int i = st; i != dr ; i += sgn){
        a[i] = a[i] * sgn;

        if(s[L] < a[i] || L == 0){
            s[++L] = a[i];
            d[i] = L;
        }
        else{
            int l = 1, dr = L;
            bool ok = true;
            while(l <= dr){
                int mij = (l + dr) / 2;

                if(s[mij] == a[i]){
                    ok = false;
                    d[i] = mij;
                    break ;
                }

                if(s[mij] > a[i]) dr = mij - 1;
                else l = mij + 1;
            }

            if(s[dr] == a[i]){
                ok = false;
                d[i] = dr;
            }

            if(!ok) continue ;

            s[l] = a[i], d[i] = l;
        }
    }

    Sol = max(Sol, L);

    for(int i = 1; i <= n ; ++i) a[i] = a[i] * sgn;
}

struct node{
    int val;
    node *left, *right;

    node(){
        val = 0;
        left = right = 0;
    }
};

node *arb;

int query(int x, int y, int st = 1, int dr = 1e9, node *nod = arb){
    if(nod == NULL) return 0;
    if(x <= st && dr <= y) return nod->val;

    int mij = (st + dr) / 2;
    int a1 = 0, a2 = 0;
    if(x <= mij) a1 = query(x, y, st, mij, nod->left);
    if(mij + 1 <= y) a2 = query(x, y, mij + 1, dr, nod->right);

    return max(a1, a2);
}

void update(int val, int pos, int st = 1, int dr = 1e9, node *nod = arb){
    if(st == dr){
        nod->val = val;
        return ;
    }

    if(nod->left == NULL) nod->left = new node;
    if(nod->right == NULL) nod->right = new node;

    int mij = (st + dr) / 2;
    if(pos <= mij){
        update(val, pos, st, mij, nod->left);
    }
    else{
        update(val, pos, mij + 1, dr, nod->right);
    }

    nod->val = max(nod->left->val, nod->right->val);
}

int main()
{
//    freopen("1.in", "r", stdin);

    scanf("%d%d", &n, &x);

    for(int i = 1; i <= n ; ++i) scanf("%d", &a[i]);

    find_lis(pref, 1, n + 1, 1);
    find_lis(suf, n, 0, -1);

    if(x == 0){
        printf("%d", Sol);
        return 0;
    }

    arb = new node;
    update(pref[1], a[1]);
    for(int i = 1; i < n ; ++i){
        int aux = suf[i + 1];
        aux = aux + query(max(a[i + 1] - x + 1, 1), min(a[i + 1] + x - 1, 1000000000));
        Sol = max(Sol, aux);

        update(pref[i + 1], a[i + 1]);
    }

    arb = new node;
    update(suf[n], a[n]);
    for(int i = n; i > 1 ; --i){
        int aux = pref[i - 1];
        aux = aux + query(max(a[i - 1] - x + 1, 1), min(a[i - 1] + x - 1, 1000000000));
        Sol = max(Sol, aux);

        update(suf[i - 1], a[i - 1]);
    }

    printf("%d", Sol);

    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &x);
     ~~~~~^~~~~~~~~~~~~~~~
glo.cpp:103:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n ; ++i) scanf("%d", &a[i]);
                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1148 KB Output is correct
4 Correct 12 ms 1168 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1148 KB Output is correct
4 Correct 12 ms 1168 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1148 KB Output is correct
4 Correct 12 ms 1168 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 9 ms 3704 KB Output is correct
20 Correct 9 ms 3576 KB Output is correct
21 Correct 9 ms 3704 KB Output is correct
22 Correct 9 ms 1144 KB Output is correct
23 Correct 6 ms 2424 KB Output is correct
24 Correct 6 ms 2424 KB Output is correct
25 Correct 4 ms 1148 KB Output is correct
26 Correct 5 ms 1400 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 5428 KB Output is correct
2 Correct 72 ms 5372 KB Output is correct
3 Correct 73 ms 5368 KB Output is correct
4 Correct 72 ms 5288 KB Output is correct
5 Correct 39 ms 4600 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 91924 KB Output is correct
2 Correct 272 ms 92024 KB Output is correct
3 Correct 271 ms 91896 KB Output is correct
4 Correct 142 ms 49912 KB Output is correct
5 Correct 4 ms 1144 KB Output is correct
6 Correct 86 ms 7900 KB Output is correct
7 Correct 271 ms 64076 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 170344 KB Output is correct
2 Correct 510 ms 170212 KB Output is correct
3 Runtime error 903 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1148 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1148 KB Output is correct
4 Correct 12 ms 1168 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1144 KB Output is correct
19 Correct 9 ms 3704 KB Output is correct
20 Correct 9 ms 3576 KB Output is correct
21 Correct 9 ms 3704 KB Output is correct
22 Correct 9 ms 1144 KB Output is correct
23 Correct 6 ms 2424 KB Output is correct
24 Correct 6 ms 2424 KB Output is correct
25 Correct 4 ms 1148 KB Output is correct
26 Correct 5 ms 1400 KB Output is correct
27 Correct 72 ms 5428 KB Output is correct
28 Correct 72 ms 5372 KB Output is correct
29 Correct 73 ms 5368 KB Output is correct
30 Correct 72 ms 5288 KB Output is correct
31 Correct 39 ms 4600 KB Output is correct
32 Correct 276 ms 91924 KB Output is correct
33 Correct 272 ms 92024 KB Output is correct
34 Correct 271 ms 91896 KB Output is correct
35 Correct 142 ms 49912 KB Output is correct
36 Correct 4 ms 1144 KB Output is correct
37 Correct 86 ms 7900 KB Output is correct
38 Correct 271 ms 64076 KB Output is correct
39 Correct 502 ms 170344 KB Output is correct
40 Correct 510 ms 170212 KB Output is correct
41 Runtime error 903 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -