Submission #1024118

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1024118	2024-07-15T12:15:39 Z	NValchanov	Global Warming (CEOI18_glo)	C++17	100 / 100	45 ms	11720 KB

#include <bits/stdc++.h>

#define endl '\n'

using namespace std;

typedef long long ll;

const ll MAXN = 2e5 + 10;
const ll MAXA = 4e18 + 10;
const ll MAXX = 1e9 + 10;

struct update
{
    ll idx;
    ll val;
    ll old;

    update()
    {
        idx = 0;
        val = old = -1;
    }

    update(ll _idx, ll _val, ll _old)
    {
        idx = _idx;
        val = _val;
        old = _old;
    }
};

ll n, x;
ll a[MAXN];
vector < update > updates;
ll lis[MAXN];
ll lis_suff[MAXN];
ll ans;

void read()
{
    cin >> n >> x;
    for(ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
}

void find_lis_suff()
{
    ll len = 1;

    lis_suff[0] = -MAXA;
    lis_suff[1] = -a[n - 1];

    updates.push_back(update(1, a[n - 1], 0));

    for(ll i = n - 2; i >= 0; i--)
    {
        ll j = lower_bound(lis_suff, lis_suff + len + 1, -a[i]) - lis_suff;

        updates.push_back(update(j, a[i], -lis_suff[j]));

        lis_suff[j] = -a[i];

        len = max(len, j);
    }

    ans = len;

    /* 

    for(update u : updates)
    {
        cout << "Change at position " << u.idx << " : from " << u.old << " to " << u.val << endl;
        cout << "idx : " << u.idx << endl;
        cout << "old : " << u.old << endl;
        cout << "val : " << u.val << endl;
    }

    */

    for(ll i = 1; i <= n; i++)
    {
        lis_suff[i] *= -1;
    }
}

void rollback()
{
    assert(!updates.empty());

    update u = updates.back();

    lis_suff[u.idx] = u.old;

    updates.pop_back();
}

ll bs(ll k)
{
    ll left = 0;
    ll right = n + 1;
    ll mid;

    while(right - left > 1)
    {
        mid = left + (right - left) / 2;

        if(lis_suff[mid] != 0 && lis_suff[mid] > k)
            left = mid;
        else
            right = mid;
    }

    return left;
}

void check(ll len)
{
    ll val = lis[len] - x;

    ll pos = bs(val);

    ans = max(ans, len + pos);
}

void print()
{
    cout << "Reversed LIS : " << endl;
    for(ll i = 1; i <= n; i++)
    {
        cout << lis_suff[i] << " ";
    }
    cout << endl << endl;
    cout << "Normal LIS : " << endl;
    for(ll i = 1; i <= n; i++)
    {
        cout << lis[i] << " ";
    }
    cout << endl << endl;
}

void solve()
{
    ll len = 1;

    lis[0] = -MAXA;
    lis[1] = a[0];

    rollback();

   /// print();    

    check(len);

    for(ll i = 1; i < n; i++)
    {
        ll j = lower_bound(lis, lis + len + 1, a[i]) - lis;

        lis[j] = a[i];

        len = max(len, j);

        rollback();

        ///print();

        check(j);
    }

    ans = max(ans, len);

   /// cout << "Answer : " << ans << endl;

   cout << ans << endl;
}

int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    read();
    find_lis_suff();
    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	0 ms	4444 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4440 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	1 ms	4444 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4440 KB	Output is correct
26	Correct	1 ms	4440 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	10688 KB	Output is correct
2	Correct	45 ms	10512 KB	Output is correct
3	Correct	43 ms	11212 KB	Output is correct
4	Correct	45 ms	10696 KB	Output is correct
5	Correct	31 ms	10568 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	5836 KB	Output is correct
2	Correct	11 ms	5836 KB	Output is correct
3	Correct	13 ms	5840 KB	Output is correct
4	Correct	8 ms	4308 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	8 ms	4308 KB	Output is correct
7	Correct	9 ms	6092 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	7116 KB	Output is correct
2	Correct	20 ms	7116 KB	Output is correct
3	Correct	39 ms	11180 KB	Output is correct
4	Correct	33 ms	11200 KB	Output is correct
5	Correct	15 ms	6088 KB	Output is correct
6	Correct	28 ms	11328 KB	Output is correct
7	Correct	26 ms	10692 KB	Output is correct
8	Correct	18 ms	7132 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	0 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	0 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	0 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	0 ms	4444 KB	Output is correct
17	Correct	1 ms	4440 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4440 KB	Output is correct
20	Correct	1 ms	4440 KB	Output is correct
21	Correct	1 ms	4444 KB	Output is correct
22	Correct	1 ms	4444 KB	Output is correct
23	Correct	1 ms	4444 KB	Output is correct
24	Correct	1 ms	4444 KB	Output is correct
25	Correct	1 ms	4440 KB	Output is correct
26	Correct	1 ms	4440 KB	Output is correct
27	Correct	45 ms	10688 KB	Output is correct
28	Correct	45 ms	10512 KB	Output is correct
29	Correct	43 ms	11212 KB	Output is correct
30	Correct	45 ms	10696 KB	Output is correct
31	Correct	31 ms	10568 KB	Output is correct
32	Correct	16 ms	5836 KB	Output is correct
33	Correct	11 ms	5836 KB	Output is correct
34	Correct	13 ms	5840 KB	Output is correct
35	Correct	8 ms	4308 KB	Output is correct
36	Correct	1 ms	4444 KB	Output is correct
37	Correct	8 ms	4308 KB	Output is correct
38	Correct	9 ms	6092 KB	Output is correct
39	Correct	19 ms	7116 KB	Output is correct
40	Correct	20 ms	7116 KB	Output is correct
41	Correct	39 ms	11180 KB	Output is correct
42	Correct	33 ms	11200 KB	Output is correct
43	Correct	15 ms	6088 KB	Output is correct
44	Correct	28 ms	11328 KB	Output is correct
45	Correct	26 ms	10692 KB	Output is correct
46	Correct	18 ms	7132 KB	Output is correct
47	Correct	22 ms	7116 KB	Output is correct
48	Correct	22 ms	7236 KB	Output is correct
49	Correct	44 ms	11208 KB	Output is correct
50	Correct	37 ms	11348 KB	Output is correct
51	Correct	31 ms	9948 KB	Output is correct
52	Correct	30 ms	11720 KB	Output is correct
53	Correct	24 ms	11372 KB	Output is correct
54	Correct	27 ms	10360 KB	Output is correct
55	Correct	36 ms	10948 KB	Output is correct

Submission #1024118

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 13.0 / 13.0

Subtask #4 10.0 / 10.0

Subtask #5 20.0 / 20.0

Subtask #6 17.0 / 17.0

Subtask #7 25.0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
13.0 / 13.0

Subtask #4
10.0 / 10.0

Subtask #5
20.0 / 20.0

Subtask #6
17.0 / 17.0

Subtask #7
25.0 / 25.0