Submission #926313

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926313	2024-02-12T19:08:25 Z	VMaksimoski008	Global Warming (CEOI18_glo)	C++14	100 / 100	485 ms	28540 KB

#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
 
struct SegTree {
    int n;
    vector<int> tree;
 
    SegTree(int _n) {
        n = _n;
        tree.resize(4*n+5);
    }
 
    void update(int u, int tl, int tr, int pos, int val) {
        if(tl == tr) {
            tree[u] = max(tree[u], val);
        } else {
            int tm = (tl + tr) / 2;
            if(pos <= tm)
                update(2*u, tl, tm, pos, val);
            else
                update(2*u+1, tm+1, tr, pos, val);
            tree[u] = max(tree[2*u], tree[2*u+1]);
        }
    }
 
    int query(int u, int tl, int tr, int l, int r) {
        if(tl > tr || l > tr || tl > r) return 0;
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return max(
            query(2*u, tl, tm, l, r),
            query(2*u+1, tm+1, tr, l, r)
        );
    }
 
    void update(int p, int v) { update(1, 0, n-1, p, v); }
    int query(int l, int r) { return query(1, 0, n-1, l, r); }
    void reset() { for(int i=0; i<tree.size(); i++) tree[i] = 0; }
};
 
int32_t main() {
    int n, X, ans = 0;
    cin >> n >> X;
 
    set<int> s;
    vector<int> v(n+1);
 
    for(int i=1; i<=n; i++) {
        cin >> v[i];
        s.insert(v[i]); s.insert(v[i] - X);
    }
 
    vector<int> comp(all(s));
 
    SegTree tree(2*n+5);
 
    vector<int> L(n+1);
    for(int i=1; i<=n; i++) {
        int p = lower_bound(all(comp), v[i]) - comp.begin();
        L[i] = tree.query(0, p-1) + 1;
        tree.update(p, L[i]);
    }
 
    tree.reset();
    for(int i=n; i>=1; i--) {
        int p = lower_bound(all(comp), v[i] - X) - comp.begin();
        int lis = tree.query(p+1, 2*n-1) + 1;
        ans = max(ans, L[i] + lis - 1);
        p = lower_bound(all(comp), v[i]) - comp.begin();
        tree.update(p, tree.query(p+1, 2*n-1) + 1);
    }
 
    cout << ans << '\n';
    return 0;
}

Compilation message

glo.cpp: In member function 'void SegTree::reset()':
glo.cpp:39:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     void reset() { for(int i=0; i<tree.size(); i++) tree[i] = 0; }
      |                                 ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	348 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	0 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	0 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	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	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	375 ms	18604 KB	Output is correct
2	Correct	398 ms	18440 KB	Output is correct
3	Correct	407 ms	18432 KB	Output is correct
4	Correct	374 ms	18256 KB	Output is correct
5	Correct	204 ms	13344 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	86 ms	7468 KB	Output is correct
2	Correct	90 ms	7468 KB	Output is correct
3	Correct	86 ms	7256 KB	Output is correct
4	Correct	54 ms	4696 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	55 ms	4928 KB	Output is correct
7	Correct	78 ms	6620 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	205 ms	14420 KB	Output is correct
2	Correct	218 ms	14516 KB	Output is correct
3	Correct	485 ms	28496 KB	Output is correct
4	Correct	233 ms	18196 KB	Output is correct
5	Correct	141 ms	14420 KB	Output is correct
6	Correct	305 ms	27220 KB	Output is correct
7	Correct	321 ms	26960 KB	Output is correct
8	Correct	171 ms	14444 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	348 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	0 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	0 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	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	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	375 ms	18604 KB	Output is correct
28	Correct	398 ms	18440 KB	Output is correct
29	Correct	407 ms	18432 KB	Output is correct
30	Correct	374 ms	18256 KB	Output is correct
31	Correct	204 ms	13344 KB	Output is correct
32	Correct	86 ms	7468 KB	Output is correct
33	Correct	90 ms	7468 KB	Output is correct
34	Correct	86 ms	7256 KB	Output is correct
35	Correct	54 ms	4696 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	55 ms	4928 KB	Output is correct
38	Correct	78 ms	6620 KB	Output is correct
39	Correct	205 ms	14420 KB	Output is correct
40	Correct	218 ms	14516 KB	Output is correct
41	Correct	485 ms	28496 KB	Output is correct
42	Correct	233 ms	18196 KB	Output is correct
43	Correct	141 ms	14420 KB	Output is correct
44	Correct	305 ms	27220 KB	Output is correct
45	Correct	321 ms	26960 KB	Output is correct
46	Correct	171 ms	14444 KB	Output is correct
47	Correct	199 ms	14420 KB	Output is correct
48	Correct	200 ms	14416 KB	Output is correct
49	Correct	473 ms	28500 KB	Output is correct
50	Correct	215 ms	18256 KB	Output is correct
51	Correct	181 ms	13812 KB	Output is correct
52	Correct	276 ms	18480 KB	Output is correct
53	Correct	313 ms	28500 KB	Output is correct
54	Correct	325 ms	28540 KB	Output is correct
55	Correct	344 ms	25256 KB	Output is correct

Submission #926313

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