oj.uz

Submission #89142

# Submission time Handle Problem Language Result Execution time Memory
89142 2018-12-10T14:03:51 Z SpeedOfMagic Global Warming (CEOI18_glo) C++17
58 / 100
 790 ms 263168 KB 
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
using namespace std;
template<typename T> using v = vector<T>;
typedef long long longlong;
//#define int longlong
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define fs first
#define sc second
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
void read() {} template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){} template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
int getInt(){int a; get a; return a;}
//code goes here
const int N = 262144;
int segTree[N * 2];
void update(int p, int val, int cur = 1, int ll = 1, int rr = N) {
    if (ll == rr) {
        segTree[cur] = max(segTree[cur], val);
        return;
    }
    int mid = (ll + rr) / 2;
    if (p <= mid)
        update(p, val, cur * 2, ll, mid);
    else
        update(p, val, cur * 2 + 1, mid + 1, rr);
    segTree[cur] = max(segTree[cur * 2], segTree[cur * 2 + 1]);
}

int query(int l, int r, int cur = 1, int ll = 1, int rr = N) {
    if (l > r)
        return 0;
    else if (l == ll && r == rr)
        return segTree[cur];
    else {
        int mid = (ll + rr) / 2;
        int res = max(query(l, min(r, mid), cur * 2, ll, mid),
                      query(max(l, mid + 1), r, cur * 2 + 1, mid + 1, rr));
        return res;
    }
}

void run() {
    memset(segTree, 0, sizeof segTree);
    int n, k;
    read(n, k);
    int a[n];
    set<int> d;
    rep(i, 0, n) {
        get a[i];
        d.insert(a[i]);
        d.insert(a[i] - k);
    }
    map<int, int> inv;
    int p = 2;
    for (int j : d)
        inv[j] = p++;

    int v[n];
    rep(i, 0, n)
        v[i] = 1e9 + 1;
    int dp[n][2];
    rep(i, 0, n) {
        dp[i][0] = (lower_bound(v, v + n, a[i]) - v) + 1;
        v[dp[i][0] - 1] = a[i];
        dp[i][1] = query(1, inv[a[i]] - 1) + 1;
        update(inv[a[i] - k], dp[i][0]);
        update(inv[a[i]], dp[i][1]);
    }
    int ans = 0;
    rep(i, 0, n)
        ans = max(ans, dp[i][1]);
    put ans;
}
signed main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); put fixed << setprecision(12); run(); return 0;}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 3 ms 2424 KB Output is correct
3 Correct 4 ms 2504 KB Output is correct
4 Correct 3 ms 2584 KB Output is correct
5 Correct 3 ms 2608 KB Output is correct
6 Correct 3 ms 2632 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 3 ms 2640 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 4 ms 2648 KB Output is correct
11 Correct 4 ms 2652 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 3 ms 2424 KB Output is correct
3 Correct 4 ms 2504 KB Output is correct
4 Correct 3 ms 2584 KB Output is correct
5 Correct 3 ms 2608 KB Output is correct
6 Correct 3 ms 2632 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 3 ms 2640 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 4 ms 2648 KB Output is correct
11 Correct 4 ms 2652 KB Output is correct
12 Correct 4 ms 2672 KB Output is correct
13 Correct 4 ms 2672 KB Output is correct
14 Correct 4 ms 2708 KB Output is correct
15 Correct 4 ms 2712 KB Output is correct
16 Correct 4 ms 2712 KB Output is correct
17 Correct 4 ms 2712 KB Output is correct
18 Correct 5 ms 2724 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 3 ms 2424 KB Output is correct
3 Correct 4 ms 2504 KB Output is correct
4 Correct 3 ms 2584 KB Output is correct
5 Correct 3 ms 2608 KB Output is correct
6 Correct 3 ms 2632 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 3 ms 2640 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 4 ms 2648 KB Output is correct
11 Correct 4 ms 2652 KB Output is correct
12 Correct 4 ms 2672 KB Output is correct
13 Correct 4 ms 2672 KB Output is correct
14 Correct 4 ms 2708 KB Output is correct
15 Correct 4 ms 2712 KB Output is correct
16 Correct 4 ms 2712 KB Output is correct
17 Correct 4 ms 2712 KB Output is correct
18 Correct 5 ms 2724 KB Output is correct
19 Correct 5 ms 2856 KB Output is correct
20 Correct 5 ms 2872 KB Output is correct
21 Correct 5 ms 2916 KB Output is correct
22 Correct 5 ms 2916 KB Output is correct
23 Correct 5 ms 2916 KB Output is correct
24 Correct 5 ms 2916 KB Output is correct
25 Correct 5 ms 2916 KB Output is correct
26 Correct 5 ms 3052 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 759 ms 26664 KB Output is correct
2 Correct 726 ms 28676 KB Output is correct
3 Correct 665 ms 30468 KB Output is correct
4 Correct 649 ms 32388 KB Output is correct
5 Correct 266 ms 32388 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 32388 KB Output is correct
2 Correct 171 ms 32388 KB Output is correct
3 Correct 171 ms 32388 KB Output is correct
4 Correct 69 ms 32388 KB Output is correct
5 Correct 3 ms 32388 KB Output is correct
6 Correct 75 ms 32388 KB Output is correct
7 Correct 127 ms 32388 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 35432 KB Output is correct
2 Correct 519 ms 36492 KB Output is correct
3 Runtime error 790 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2424 KB Output is correct
2 Correct 3 ms 2424 KB Output is correct
3 Correct 4 ms 2504 KB Output is correct
4 Correct 3 ms 2584 KB Output is correct
5 Correct 3 ms 2608 KB Output is correct
6 Correct 3 ms 2632 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 3 ms 2640 KB Output is correct
9 Correct 3 ms 2644 KB Output is correct
10 Correct 4 ms 2648 KB Output is correct
11 Correct 4 ms 2652 KB Output is correct
12 Correct 4 ms 2672 KB Output is correct
13 Correct 4 ms 2672 KB Output is correct
14 Correct 4 ms 2708 KB Output is correct
15 Correct 4 ms 2712 KB Output is correct
16 Correct 4 ms 2712 KB Output is correct
17 Correct 4 ms 2712 KB Output is correct
18 Correct 5 ms 2724 KB Output is correct
19 Correct 5 ms 2856 KB Output is correct
20 Correct 5 ms 2872 KB Output is correct
21 Correct 5 ms 2916 KB Output is correct
22 Correct 5 ms 2916 KB Output is correct
23 Correct 5 ms 2916 KB Output is correct
24 Correct 5 ms 2916 KB Output is correct
25 Correct 5 ms 2916 KB Output is correct
26 Correct 5 ms 3052 KB Output is correct
27 Correct 759 ms 26664 KB Output is correct
28 Correct 726 ms 28676 KB Output is correct
29 Correct 665 ms 30468 KB Output is correct
30 Correct 649 ms 32388 KB Output is correct
31 Correct 266 ms 32388 KB Output is correct
32 Correct 161 ms 32388 KB Output is correct
33 Correct 171 ms 32388 KB Output is correct
34 Correct 171 ms 32388 KB Output is correct
35 Correct 69 ms 32388 KB Output is correct
36 Correct 3 ms 32388 KB Output is correct
37 Correct 75 ms 32388 KB Output is correct
38 Correct 127 ms 32388 KB Output is correct
39 Correct 489 ms 35432 KB Output is correct
40 Correct 519 ms 36492 KB Output is correct
41 Runtime error 790 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -