Submission #554802

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
554802	2022-04-29T12:50:55 Z	AA_Surely	Global Warming (CEOI18_glo)	C++14	100 / 100	149 ms	9772 KB

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

#define lc now << 1
#define rc now << 1 | 1

int n, x;
int ns[N], in[N];
int bk[N], fd[N], lis[N];
int tree[N << 2];
PII st[N];

inline void init() {
    cin >> n >> x;
    int mx = 0;
    F0R(i, n) {
        cin >> ns[i];
        mx = max(mx, ns[i]);
    }

    F0R(i, n) in[i] = mx + 1 - ns[i];
    return;
}

inline void backwards() {
    fill(lis, lis + n + 1, INF);
    lis[0] = -1;

    R0F(i, n) {
        int pl = lower_bound(lis, lis + n, in[i]) - lis;
        lis[pl] = in[i];
        bk[i] = pl;
    }

    return;
}

inline void forwards() {
    fill(lis, lis + n + 1, INF);
    lis[0] = -1;

    F0R(i, n) {
        int pl = lower_bound(lis, lis + n, ns[i]) - lis;
        lis[pl] = ns[i];
        fd[i] = pl;
    }

    return;
}

void change(int id, int val, int now = 1, int ls = 0, int rs = n - 1) {
    if (ls == rs) {
        tree[now] = val;
        return;
    }

    int mid = (ls + rs) >> 1;
    if (id <= mid) change(id, val, lc, ls, mid);
    else change(id, val, rc, mid + 1, rs);
    
    tree[now] = max(tree[lc], tree[rc]);
    return;
}

int get(int lq, int rq, int now = 1, int ls = 0, int rs = n - 1) {
    if (rq < lq || rq < ls || rs < lq) return 0;
    if (lq <= ls && rs <= rq) return tree[now];
    int mid = (ls + rs) >> 1;
    return max(get(lq, rq, lc, ls, mid), get(lq, rq, rc, mid + 1, rs));
}

int main() {
    IOS;
    
    init();
    forwards();
    backwards();

    F0R(i, n) st[i] = {ns[i], i};
    sort(st, st + n, greater<PII>());
    
    int ptr = 0, ans = 0;
    F0R(i, n) {
        while(ptr < n && st[ptr].F + x > st[i].F) {
            change(st[ptr].S, bk[ st[ptr].S ]);
            ptr++;
        }

        ans = max(ans, fd[ st[i].S ] + get(st[i].S + 1, n - 1));
    }

    /*F0R(i, n) cout << fd[i] << ' ';
    cout << endl;
    F0R(i, n) cout << bk[i] << ' ';
    cout << endl;*/

    cout << ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	131 ms	9768 KB	Output is correct
2	Correct	125 ms	9756 KB	Output is correct
3	Correct	126 ms	9764 KB	Output is correct
4	Correct	135 ms	9764 KB	Output is correct
5	Correct	88 ms	8944 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	2600 KB	Output is correct
2	Correct	27 ms	2664 KB	Output is correct
3	Correct	29 ms	2672 KB	Output is correct
4	Correct	22 ms	2512 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	20 ms	2508 KB	Output is correct
7	Correct	24 ms	2604 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	4992 KB	Output is correct
2	Correct	63 ms	5072 KB	Output is correct
3	Correct	149 ms	9668 KB	Output is correct
4	Correct	110 ms	8944 KB	Output is correct
5	Correct	45 ms	4616 KB	Output is correct
6	Correct	78 ms	8700 KB	Output is correct
7	Correct	83 ms	9420 KB	Output is correct
8	Correct	51 ms	5088 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	0 ms	328 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	131 ms	9768 KB	Output is correct
28	Correct	125 ms	9756 KB	Output is correct
29	Correct	126 ms	9764 KB	Output is correct
30	Correct	135 ms	9764 KB	Output is correct
31	Correct	88 ms	8944 KB	Output is correct
32	Correct	31 ms	2600 KB	Output is correct
33	Correct	27 ms	2664 KB	Output is correct
34	Correct	29 ms	2672 KB	Output is correct
35	Correct	22 ms	2512 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	20 ms	2508 KB	Output is correct
38	Correct	24 ms	2604 KB	Output is correct
39	Correct	62 ms	4992 KB	Output is correct
40	Correct	63 ms	5072 KB	Output is correct
41	Correct	149 ms	9668 KB	Output is correct
42	Correct	110 ms	8944 KB	Output is correct
43	Correct	45 ms	4616 KB	Output is correct
44	Correct	78 ms	8700 KB	Output is correct
45	Correct	83 ms	9420 KB	Output is correct
46	Correct	51 ms	5088 KB	Output is correct
47	Correct	59 ms	5068 KB	Output is correct
48	Correct	62 ms	4948 KB	Output is correct
49	Correct	136 ms	9772 KB	Output is correct
50	Correct	95 ms	8916 KB	Output is correct
51	Correct	69 ms	7312 KB	Output is correct
52	Correct	86 ms	9108 KB	Output is correct
53	Correct	82 ms	9084 KB	Output is correct
54	Correct	89 ms	9728 KB	Output is correct
55	Correct	108 ms	9716 KB	Output is correct

Submission #554802

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