Submission #483422

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
483422	2021-10-29T10:10:24 Z	keertan	Global Warming (CEOI18_glo)	C++17	100 / 100	46 ms	2640 KB

/**
 * If you live in imaginary world when your imaginary situation encounter in 
 * real situation you can't enjoiy it because you have to do pending work.
 * {This pending work appeared because you wasted that time for your useless
 * imagianry thinking.}
 */
#include<bits/stdc++.h>
using namespace std;
//#define int  int64_t
#define all(x) x.begin(),x.end()
#define all1(x) x.rbegin(),x.rend()
#define sz(x) (int32_t)(x.size())
const int N=1e2;


void solve(){
    int n,m;
    cin>>n>>m;
    vector<int> z(n);
    for (int &it:z){cin>>it;}
    vector<int> dp;
    int pref[n];
    for (int i=0;i<n;i++){
        int pos=lower_bound(all(dp),z[i])-dp.begin();
        pref[i]=pos+1;
        if (pos==sz(dp)){
            dp.push_back(z[i]);
        }
        else{
            dp[pos]=z[i];
        }
    }
    dp.clear();
    int ans=0;
    for (int i=n-1;~i;i--){
        int pos=lower_bound(all(dp),-z[i]+m)-dp.begin();
        ans=max(ans,pref[i]+pos);
        pos=lower_bound(all(dp),-z[i])-dp.begin();
        if (pos==sz(dp)){
            dp.push_back(-z[i]);
        }
        else{
            dp[pos]=-z[i];
        }
    }
    cout<<ans;
}
int32_t main(){
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int tq=1;
    //cin>>tq;
    for (;tq;tq--){solve();}
}
//is a bruteforce possible?
//think greedier, make more assumptions
// if we you find solution using loop to decrease complexity use bs
//stuck for more than 5 minutes? move on

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	1868 KB	Output is correct
2	Correct	45 ms	1888 KB	Output is correct
3	Correct	44 ms	1876 KB	Output is correct
4	Correct	46 ms	1860 KB	Output is correct
5	Correct	26 ms	2516 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	588 KB	Output is correct
2	Correct	12 ms	588 KB	Output is correct
3	Correct	14 ms	652 KB	Output is correct
4	Correct	6 ms	844 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	6 ms	844 KB	Output is correct
7	Correct	9 ms	588 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	1100 KB	Output is correct
2	Correct	20 ms	1100 KB	Output is correct
3	Correct	42 ms	1876 KB	Output is correct
4	Correct	25 ms	2512 KB	Output is correct
5	Correct	12 ms	1484 KB	Output is correct
6	Correct	22 ms	2384 KB	Output is correct
7	Correct	27 ms	2384 KB	Output is correct
8	Correct	16 ms	1100 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	45 ms	1868 KB	Output is correct
28	Correct	45 ms	1888 KB	Output is correct
29	Correct	44 ms	1876 KB	Output is correct
30	Correct	46 ms	1860 KB	Output is correct
31	Correct	26 ms	2516 KB	Output is correct
32	Correct	14 ms	588 KB	Output is correct
33	Correct	12 ms	588 KB	Output is correct
34	Correct	14 ms	652 KB	Output is correct
35	Correct	6 ms	844 KB	Output is correct
36	Correct	0 ms	204 KB	Output is correct
37	Correct	6 ms	844 KB	Output is correct
38	Correct	9 ms	588 KB	Output is correct
39	Correct	19 ms	1100 KB	Output is correct
40	Correct	20 ms	1100 KB	Output is correct
41	Correct	42 ms	1876 KB	Output is correct
42	Correct	25 ms	2512 KB	Output is correct
43	Correct	12 ms	1484 KB	Output is correct
44	Correct	22 ms	2384 KB	Output is correct
45	Correct	27 ms	2384 KB	Output is correct
46	Correct	16 ms	1100 KB	Output is correct
47	Correct	21 ms	1100 KB	Output is correct
48	Correct	22 ms	1104 KB	Output is correct
49	Correct	45 ms	1876 KB	Output is correct
50	Correct	26 ms	2516 KB	Output is correct
51	Correct	23 ms	2072 KB	Output is correct
52	Correct	25 ms	2520 KB	Output is correct
53	Correct	21 ms	2520 KB	Output is correct
54	Correct	29 ms	2640 KB	Output is correct
55	Correct	35 ms	1876 KB	Output is correct

Submission #483422

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