Submission #452039

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
452039	2021-08-03T16:29:07 Z	ljuba	Global Warming (CEOI18_glo)	C++17	100 / 100	70 ms	5288 KB

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
typedef vector<int> vi;
typedef vector<ll> vll;
 
typedef vector<vi> vvi;
typedef vector<vll> vvll;
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
 
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
 
namespace debug {
    void __print(int x) {cerr << x;}
    void __print(long long x) {cerr << x;}
    void __print(double x) {cerr << x;}
    void __print(long double x) {cerr << x;}
    void __print(char x) {cerr << '\'' << x << '\'';}
    void __print(const string &x) {cerr << '\"' << x << '\"';}
    void __print(const char *x) {cerr << '\"' << x << '\"';}
    void __print(bool x) {cerr << (x ? "true" : "false");}
 
    template<typename T, typename V>
    void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
    template<typename T>
    void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
    void _print() {cerr << "]\n";}
    template <typename T, typename... V>
    void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
 
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
 
using namespace debug;
 
const char nl = '\n';
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
/*
погледај сампле тестове, пре него што имплементираш (можда имаш погрешну идеју) 
уместо да разматраш неке глупе случајеве на папиру, размишљај заправо о задатку
*/

void solve() {
    int n, x;
    cin >> n >> x;
    vi v(n);
    for(auto &z : v)
        cin >> z;

    //4 100
    //1 2 2 1

    vi odg(n);
    vi dp;

    for(int i = 0; i < n; ++i) {
        auto it = lower_bound(all(dp), v[i]+x);
        if(it == dp.begin()) {
            odg[i] = 1;
        } else {
            --it;
            odg[i] = (it-dp.begin()+2);
        }
        it = lower_bound(all(dp), v[i]);
        if(it == dp.end()) {
            dp.pb(v[i]);
        } else {
            *it = v[i];
        }
        dbg(i, dp);
    }

    dbg(odg);

    int ans = 0;
    dp.clear();
    vi suf;

    //suf treba da bude 1 0 0 0

    for(int i = n-1; ~i; --i) {
        auto it = lower_bound(all(dp), -v[i]);
        int res = odg[i];

        if(it == dp.begin()) {
            res += 0;
            suf.pb(0);
        } else {
            --it;
            int bruh = (it-dp.begin()+1);
            suf.pb(bruh);
            res += bruh;
        }

        ckmax(ans, res);

        it = lower_bound(all(dp), -v[i]);
        if(it == dp.end()) {
            dp.pb(-v[i]);
        } else {
            *it = -v[i];
        }
    }

    reverse(all(suf));
    dbg(suf);

    cout << ans << nl;
}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int testCases = 1;
    //cin >> testCases;
    while(testCases--)
        solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	66 ms	3108 KB	Output is correct
2	Correct	66 ms	3012 KB	Output is correct
3	Correct	65 ms	3092 KB	Output is correct
4	Correct	68 ms	3096 KB	Output is correct
5	Correct	38 ms	3400 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	1168 KB	Output is correct
2	Correct	15 ms	1100 KB	Output is correct
3	Correct	16 ms	1176 KB	Output is correct
4	Correct	9 ms	1216 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1484 KB	Output is correct
7	Correct	13 ms	1484 KB	Output is correct

Subtask #6
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	1816 KB	Output is correct
2	Correct	35 ms	1812 KB	Output is correct
3	Correct	60 ms	3092 KB	Output is correct
4	Correct	39 ms	3400 KB	Output is correct
5	Correct	19 ms	2448 KB	Output is correct
6	Correct	33 ms	4540 KB	Output is correct
7	Correct	37 ms	5192 KB	Output is correct
8	Correct	25 ms	2748 KB	Output is correct

Subtask #7
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	312 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	66 ms	3108 KB	Output is correct
28	Correct	66 ms	3012 KB	Output is correct
29	Correct	65 ms	3092 KB	Output is correct
30	Correct	68 ms	3096 KB	Output is correct
31	Correct	38 ms	3400 KB	Output is correct
32	Correct	15 ms	1168 KB	Output is correct
33	Correct	15 ms	1100 KB	Output is correct
34	Correct	16 ms	1176 KB	Output is correct
35	Correct	9 ms	1216 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	10 ms	1484 KB	Output is correct
38	Correct	13 ms	1484 KB	Output is correct
39	Correct	29 ms	1816 KB	Output is correct
40	Correct	35 ms	1812 KB	Output is correct
41	Correct	60 ms	3092 KB	Output is correct
42	Correct	39 ms	3400 KB	Output is correct
43	Correct	19 ms	2448 KB	Output is correct
44	Correct	33 ms	4540 KB	Output is correct
45	Correct	37 ms	5192 KB	Output is correct
46	Correct	25 ms	2748 KB	Output is correct
47	Correct	31 ms	2636 KB	Output is correct
48	Correct	31 ms	2728 KB	Output is correct
49	Correct	70 ms	4980 KB	Output is correct
50	Correct	38 ms	4588 KB	Output is correct
51	Correct	33 ms	3892 KB	Output is correct
52	Correct	39 ms	4708 KB	Output is correct
53	Correct	34 ms	4680 KB	Output is correct
54	Correct	40 ms	5288 KB	Output is correct
55	Correct	52 ms	4928 KB	Output is correct

Submission #452039

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