oj.uz

Submission #1014828

# Submission time Handle Problem Language Result Execution time Memory
1014828 2024-07-05T15:10:31 Z aufan Global Warming (CEOI18_glo) C++17
48 / 100
 401 ms 262144 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

const int inf = 1e9;

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

        void build(int start, int end) {
                st = start;
                en = end;

                val = 0;
        }

        void lazy() {
                if (left == NULL) {
                        int md = (st + en) / 2;
                        left = new node();
                        right = new node();

                        left->build(st, md);
                        right->build(md + 1, en);
                }
        }

        int query(int lf, int rg) {
                if (st > rg || en < lf || lf > rg) return 0ll;
                if (lf <= st && en <= rg) return val;
                lazy();
                return max(left->query(lf, rg), right->query(lf, rg));
        }

        void update(int id, int x) {
                if (st > id || en < id) return;
                if (st == en) {
                        val = max(val, x);
                        return;
                }

                lazy();
                left->update(id, x);
                right->update(id, x);

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

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n, x;
        cin >> n >> x;

        vector<int> a(n + 1);
        for (int i = 1; i <= n; i++) cin >> a[i];

        sg.build(1, inf);
        vector<int> dp(n + 1);
        for (int i = n; i >= 1; i--) {
                dp[i] = sg.query(a[i] + 1, inf) + 1;
                sg.update(a[i], dp[i]);
        }

        int ans = 0;
        sg2.build(1, inf);
        for (int i = 1; i <= n; i++) {
                ans = max(ans, dp[i] + sg2.query(1, a[i] - 1 + x));
                sg2.update(a[i], sg2.query(1, a[i] - 1) + 1);
        }

        cout << ans << '\n';
        
        return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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 Correct 9 ms 5724 KB Output is correct
20 Correct 5 ms 5468 KB Output is correct
21 Correct 5 ms 4956 KB Output is correct
22 Correct 4 ms 4188 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 604 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 401 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 147428 KB Output is correct
2 Correct 174 ms 147472 KB Output is correct
3 Correct 179 ms 147452 KB Output is correct
4 Correct 97 ms 79096 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 38 ms 10872 KB Output is correct
7 Correct 123 ms 102224 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 254932 KB Output is correct
2 Correct 345 ms 254744 KB Output is correct
3 Runtime error 375 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 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 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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 Correct 9 ms 5724 KB Output is correct
20 Correct 5 ms 5468 KB Output is correct
21 Correct 5 ms 4956 KB Output is correct
22 Correct 4 ms 4188 KB Output is correct
23 Correct 3 ms 2652 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Runtime error 401 ms 262144 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -