Submission #936700

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936700	2024-03-02T14:49:57 Z	dwuy	Global Warming (CEOI18_glo)	C++14	100 / 100	232 ms	10912 KB

#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 200005;

struct SMT{
    int n;
    vector<int> tree;

    SMT(int n=0){
        this->n = n;
        this->tree.assign(n<<2|1, 0);
    }

    void update(int pos, int val){
        int id = 1;
        for(int l=1, r=n; l<r;){
            int mid = (l+r)>>1;
            if(pos<=mid) r = mid, id <<= 1;
            else l = mid + 1, id = id<<1|1;
        }
        tree[id] = val;
        for(id>>=1; id; id>>=1) tree[id] = max(tree[id<<1], tree[id<<1|1]);
    }

    int get(int l, int r, int id, const int &u, const int &v){
        if(l>v || r<u) return 0;
        if(l>=u && r<=v) return tree[id];
        int mid = (l+r)>>1;
        return max(get(l, mid, id<<1, u, v), get(mid+1, r, id<<1|1, u, v));
    }

    int get(int l, int r){
        return get(1, n, 1, l, r);
    }
};

int n, d;
int a[MX];
int f[MX];
vector<int> val;

void nhap(){
    cin >> n >> d;
    for(int i=1; i<=n; i++) cin >> a[i];
    val.resize(n);

    for(int i=1; i<=n; i++) val[i-1] = a[i];
    sort(val.begin(), val.end());
    val.erase(unique(val.begin(), val.end()), val.end());
}

int ec(int x){
    return lower_bound(val.begin(), val.end(), x) - val.begin() + 1;
}

void solve(){
    SMT smt(n+5);
    for(int i=1; i<=n; i++){
        int id = ec(a[i]);
        f[i] = smt.get(1, id-1) + 1;
        smt.update(id, f[i]);
    }

    int ans = 0;
    smt = SMT(n+5);
    for(int i=n; i>=1; i--){
        ans = max(ans, f[i] + smt.get(ec(a[i] - d + 1), n+5));
        smt.update(ec(a[i]), smt.get(ec(a[i])+1, n+5) + 1);
    }
    cout << ans;
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	504 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	344 KB	Output is correct
9	Correct	1 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	504 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	344 KB	Output is correct
9	Correct	1 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	504 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	344 KB	Output is correct
9	Correct	1 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 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	1 ms	348 KB	Output is correct
23	Correct	1 ms	604 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	232 ms	10888 KB	Output is correct
2	Correct	223 ms	10832 KB	Output is correct
3	Correct	231 ms	10836 KB	Output is correct
4	Correct	231 ms	10836 KB	Output is correct
5	Correct	108 ms	10068 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	49 ms	2900 KB	Output is correct
2	Correct	50 ms	2960 KB	Output is correct
3	Correct	49 ms	2900 KB	Output is correct
4	Correct	24 ms	2904 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	26 ms	2808 KB	Output is correct
7	Correct	40 ms	2924 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	107 ms	5716 KB	Output is correct
2	Correct	89 ms	5712 KB	Output is correct
3	Correct	193 ms	10760 KB	Output is correct
4	Correct	93 ms	10068 KB	Output is correct
5	Correct	63 ms	5712 KB	Output is correct
6	Correct	102 ms	9704 KB	Output is correct
7	Correct	103 ms	10296 KB	Output is correct
8	Correct	75 ms	5712 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	504 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	344 KB	Output is correct
9	Correct	1 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 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	1 ms	348 KB	Output is correct
23	Correct	1 ms	604 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	232 ms	10888 KB	Output is correct
28	Correct	223 ms	10832 KB	Output is correct
29	Correct	231 ms	10836 KB	Output is correct
30	Correct	231 ms	10836 KB	Output is correct
31	Correct	108 ms	10068 KB	Output is correct
32	Correct	49 ms	2900 KB	Output is correct
33	Correct	50 ms	2960 KB	Output is correct
34	Correct	49 ms	2900 KB	Output is correct
35	Correct	24 ms	2904 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	26 ms	2808 KB	Output is correct
38	Correct	40 ms	2924 KB	Output is correct
39	Correct	107 ms	5716 KB	Output is correct
40	Correct	89 ms	5712 KB	Output is correct
41	Correct	193 ms	10760 KB	Output is correct
42	Correct	93 ms	10068 KB	Output is correct
43	Correct	63 ms	5712 KB	Output is correct
44	Correct	102 ms	9704 KB	Output is correct
45	Correct	103 ms	10296 KB	Output is correct
46	Correct	75 ms	5712 KB	Output is correct
47	Correct	114 ms	5716 KB	Output is correct
48	Correct	106 ms	5672 KB	Output is correct
49	Correct	226 ms	10832 KB	Output is correct
50	Correct	106 ms	10212 KB	Output is correct
51	Correct	88 ms	7760 KB	Output is correct
52	Correct	143 ms	10108 KB	Output is correct
53	Correct	107 ms	10328 KB	Output is correct
54	Correct	111 ms	10836 KB	Output is correct
55	Correct	186 ms	10912 KB	Output is correct

Submission #936700

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