oj.uz

Submission #254350

# Submission time Handle Problem Language Result Execution time Memory
254350 2020-07-29T21:28:40 Z MarcoMeijer Global Warming (CEOI18_glo) C++14
100 / 100
 71 ms 6264 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi," ",x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 5e5;
ll n, x;
ll t[MX];
ll LIS[MX];
ll L[MX], m=0;

void program() {
    IN(n,x);
    RE(i,n) IN(t[i]);

    RE(i,n) {
        ll lb=-1, ub=m-1;
        while(lb != ub) {
            ll mid=(lb+ub+1)/2;
            if(L[mid] < t[i]) lb=mid;
            else ub=mid-1;
        }
        LIS[i] = lb+2;
        if(lb == m-1) L[m++] = t[i];
        L[lb+1] = min(L[lb+1], t[i]);
    }

    ll ans = 0;
    m = 0;
    REV(i,0,n) {
        ll lb=-1, ub=m-1;
        while(lb != ub) {
            ll mid=(lb+ub+1)/2;
            if(L[mid] < -t[i]) lb=mid;
            else ub=mid-1;
        }
        ans = max(ans, LIS[i]+lb+1);

        lb=-1, ub=m-1;
        while(lb != ub) {
            ll mid=(lb+ub+1)/2;
            if(L[mid] < -t[i]-x) lb=mid;
            else ub=mid-1;
        }
        if(lb == m-1) L[m++] = -t[i]-x;
        L[lb+1] = min(L[lb+1], -t[i]-x);
    }

    OUTL(ans);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 5240 KB Output is correct
2 Correct 67 ms 5240 KB Output is correct
3 Correct 69 ms 5240 KB Output is correct
4 Correct 68 ms 5240 KB Output is correct
5 Correct 40 ms 5240 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1536 KB Output is correct
2 Correct 17 ms 1664 KB Output is correct
3 Correct 17 ms 1628 KB Output is correct
4 Correct 10 ms 1664 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 9 ms 1664 KB Output is correct
7 Correct 13 ms 1664 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2816 KB Output is correct
2 Correct 30 ms 2940 KB Output is correct
3 Correct 58 ms 5368 KB Output is correct
4 Correct 44 ms 5496 KB Output is correct
5 Correct 19 ms 2944 KB Output is correct
6 Correct 32 ms 5240 KB Output is correct
7 Correct 40 ms 6008 KB Output is correct
8 Correct 24 ms 2936 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 68 ms 5240 KB Output is correct
28 Correct 67 ms 5240 KB Output is correct
29 Correct 69 ms 5240 KB Output is correct
30 Correct 68 ms 5240 KB Output is correct
31 Correct 40 ms 5240 KB Output is correct
32 Correct 17 ms 1536 KB Output is correct
33 Correct 17 ms 1664 KB Output is correct
34 Correct 17 ms 1628 KB Output is correct
35 Correct 10 ms 1664 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 9 ms 1664 KB Output is correct
38 Correct 13 ms 1664 KB Output is correct
39 Correct 28 ms 2816 KB Output is correct
40 Correct 30 ms 2940 KB Output is correct
41 Correct 58 ms 5368 KB Output is correct
42 Correct 44 ms 5496 KB Output is correct
43 Correct 19 ms 2944 KB Output is correct
44 Correct 32 ms 5240 KB Output is correct
45 Correct 40 ms 6008 KB Output is correct
46 Correct 24 ms 2936 KB Output is correct
47 Correct 33 ms 2944 KB Output is correct
48 Correct 33 ms 2936 KB Output is correct
49 Correct 71 ms 5604 KB Output is correct
50 Correct 40 ms 5492 KB Output is correct
51 Correct 33 ms 4344 KB Output is correct
52 Correct 41 ms 5612 KB Output is correct
53 Correct 33 ms 5504 KB Output is correct
54 Correct 42 ms 6264 KB Output is correct
55 Correct 56 ms 5496 KB Output is correct