답안 #89141 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89141	2018-12-10T14:02:51 Z	SpeedOfMagic	Global Warming (CEOI18_glo)	C++17	58 / 100	881 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
inline int lsb(int a) { return a & -a; }

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] = inf;
    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

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4408 KB	Output is correct
2	Correct	6 ms	4608 KB	Output is correct
3	Correct	6 ms	4724 KB	Output is correct
4	Correct	6 ms	4724 KB	Output is correct
5	Correct	6 ms	4724 KB	Output is correct
6	Correct	6 ms	4724 KB	Output is correct
7	Correct	7 ms	4724 KB	Output is correct
8	Correct	6 ms	4804 KB	Output is correct
9	Correct	6 ms	4804 KB	Output is correct
10	Correct	6 ms	4824 KB	Output is correct
11	Correct	6 ms	4824 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4408 KB	Output is correct
2	Correct	6 ms	4608 KB	Output is correct
3	Correct	6 ms	4724 KB	Output is correct
4	Correct	6 ms	4724 KB	Output is correct
5	Correct	6 ms	4724 KB	Output is correct
6	Correct	6 ms	4724 KB	Output is correct
7	Correct	7 ms	4724 KB	Output is correct
8	Correct	6 ms	4804 KB	Output is correct
9	Correct	6 ms	4804 KB	Output is correct
10	Correct	6 ms	4824 KB	Output is correct
11	Correct	6 ms	4824 KB	Output is correct
12	Correct	6 ms	4824 KB	Output is correct
13	Correct	6 ms	4824 KB	Output is correct
14	Correct	6 ms	4824 KB	Output is correct
15	Correct	6 ms	4824 KB	Output is correct
16	Correct	6 ms	4824 KB	Output is correct
17	Correct	6 ms	4824 KB	Output is correct
18	Correct	6 ms	4824 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4408 KB	Output is correct
2	Correct	6 ms	4608 KB	Output is correct
3	Correct	6 ms	4724 KB	Output is correct
4	Correct	6 ms	4724 KB	Output is correct
5	Correct	6 ms	4724 KB	Output is correct
6	Correct	6 ms	4724 KB	Output is correct
7	Correct	7 ms	4724 KB	Output is correct
8	Correct	6 ms	4804 KB	Output is correct
9	Correct	6 ms	4804 KB	Output is correct
10	Correct	6 ms	4824 KB	Output is correct
11	Correct	6 ms	4824 KB	Output is correct
12	Correct	6 ms	4824 KB	Output is correct
13	Correct	6 ms	4824 KB	Output is correct
14	Correct	6 ms	4824 KB	Output is correct
15	Correct	6 ms	4824 KB	Output is correct
16	Correct	6 ms	4824 KB	Output is correct
17	Correct	6 ms	4824 KB	Output is correct
18	Correct	6 ms	4824 KB	Output is correct
19	Correct	8 ms	5008 KB	Output is correct
20	Correct	8 ms	5016 KB	Output is correct
21	Correct	8 ms	5032 KB	Output is correct
22	Correct	7 ms	5032 KB	Output is correct
23	Correct	7 ms	5032 KB	Output is correct
24	Correct	8 ms	5032 KB	Output is correct
25	Correct	7 ms	5032 KB	Output is correct
26	Correct	8 ms	5032 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	869 ms	35084 KB	Output is correct
2	Correct	878 ms	36880 KB	Output is correct
3	Correct	833 ms	38724 KB	Output is correct
4	Correct	881 ms	40844 KB	Output is correct
5	Correct	286 ms	40844 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	187 ms	40844 KB	Output is correct
2	Correct	199 ms	40844 KB	Output is correct
3	Correct	190 ms	40844 KB	Output is correct
4	Correct	82 ms	40844 KB	Output is correct
5	Correct	5 ms	40844 KB	Output is correct
6	Correct	97 ms	40844 KB	Output is correct
7	Correct	153 ms	40844 KB	Output is correct

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	531 ms	42364 KB	Output is correct
2	Correct	639 ms	43292 KB	Output is correct
3	Runtime error	793 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

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4408 KB	Output is correct
2	Correct	6 ms	4608 KB	Output is correct
3	Correct	6 ms	4724 KB	Output is correct
4	Correct	6 ms	4724 KB	Output is correct
5	Correct	6 ms	4724 KB	Output is correct
6	Correct	6 ms	4724 KB	Output is correct
7	Correct	7 ms	4724 KB	Output is correct
8	Correct	6 ms	4804 KB	Output is correct
9	Correct	6 ms	4804 KB	Output is correct
10	Correct	6 ms	4824 KB	Output is correct
11	Correct	6 ms	4824 KB	Output is correct
12	Correct	6 ms	4824 KB	Output is correct
13	Correct	6 ms	4824 KB	Output is correct
14	Correct	6 ms	4824 KB	Output is correct
15	Correct	6 ms	4824 KB	Output is correct
16	Correct	6 ms	4824 KB	Output is correct
17	Correct	6 ms	4824 KB	Output is correct
18	Correct	6 ms	4824 KB	Output is correct
19	Correct	8 ms	5008 KB	Output is correct
20	Correct	8 ms	5016 KB	Output is correct
21	Correct	8 ms	5032 KB	Output is correct
22	Correct	7 ms	5032 KB	Output is correct
23	Correct	7 ms	5032 KB	Output is correct
24	Correct	8 ms	5032 KB	Output is correct
25	Correct	7 ms	5032 KB	Output is correct
26	Correct	8 ms	5032 KB	Output is correct
27	Correct	869 ms	35084 KB	Output is correct
28	Correct	878 ms	36880 KB	Output is correct
29	Correct	833 ms	38724 KB	Output is correct
30	Correct	881 ms	40844 KB	Output is correct
31	Correct	286 ms	40844 KB	Output is correct
32	Correct	187 ms	40844 KB	Output is correct
33	Correct	199 ms	40844 KB	Output is correct
34	Correct	190 ms	40844 KB	Output is correct
35	Correct	82 ms	40844 KB	Output is correct
36	Correct	5 ms	40844 KB	Output is correct
37	Correct	97 ms	40844 KB	Output is correct
38	Correct	153 ms	40844 KB	Output is correct
39	Correct	531 ms	42364 KB	Output is correct
40	Correct	639 ms	43292 KB	Output is correct
41	Runtime error	793 ms	263168 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
42	Halted	0 ms	0 KB	-

답안 #89141

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 0 / 17.0

Subtask #7 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
0 / 17.0

Subtask #7
0 / 25.0