oj.uz

Submission #1038577

# Submission time Handle Problem Language Result Execution time Memory
1038577 2024-07-30T02:24:47 Z vjudge1 Global Warming (CEOI18_glo) C++17
42 / 100
 58 ms 7004 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define lwb lower_bound
#define upb upper_bound

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int maxN = 1e6+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n, x, a[maxN], b[maxN];
pii lo[maxN], hi[maxN];

int main()
{
    init();
    cin >> n >> x;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = INF;
    }
    b[0] = -INF;
    for(int i = 1; i <= n; i++)
    {
        int pos = lower_bound(b, b + n + 1, a[i]) - b;
        b[pos] = a[i];
        //cout << a[i] << " " << pos << '\n';
        if(pos > lo[i-1].fi)
        {
            lo[i] = {pos, a[i]};
        } else if(pos == lo[i-1].fi && a[i] < lo[i-1].se)
        {
            lo[i].fi = lo[i-1].fi;
            lo[i].se = a[i];
        } else
        {
            lo[i] = lo[i-1];
        }
    }
    for(int i = 1; i <= n; i++)
    {
        b[i] = INF;
    }
    b[0] = -INF;
    for(int i = n; i >= 1; i--)
    {
        int pos = lower_bound(b, b + n + 1, -a[i]) - b;
        b[pos] = -a[i];
        if(pos > hi[i+1].fi)
        {
            hi[i] = {pos, a[i]};
        } else if(pos == hi[i-1].fi && a[i] > hi[i-1].se)
        {
            hi[i].fi = hi[i-1].fi;
            hi[i].se = a[i];
        } else
        {
            hi[i] = hi[i-1];
        }
    }
    int res = lo[n].fi;
    for(int i = 2; i <= n; i++)
    {
        if(abs(lo[i-1].se - hi[i].se) + 1 <= x) res = max(res, lo[i-1].fi + hi[i].fi);
    }
    cout << res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 1 ms 344 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6992 KB Output is correct
2 Correct 38 ms 6876 KB Output is correct
3 Correct 58 ms 6876 KB Output is correct
4 Correct 36 ms 7000 KB Output is correct
5 Correct 26 ms 6232 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2136 KB Output is correct
2 Correct 9 ms 1908 KB Output is correct
3 Correct 9 ms 1964 KB Output is correct
4 Incorrect 7 ms 1880 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3676 KB Output is correct
2 Correct 21 ms 3676 KB Output is correct
3 Correct 35 ms 7004 KB Output is correct
4 Correct 27 ms 6092 KB Output is correct
5 Correct 14 ms 3164 KB Output is correct
6 Correct 24 ms 5980 KB Output is correct
7 Correct 26 ms 6740 KB Output is correct
8 Correct 15 ms 3668 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 1 ms 344 KB Output isn't correct
20 Halted 0 ms 0 KB -