답안 #70185 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
70185	2018-08-22T13:03:10 Z	model_code	Global Warming (CEOI18_glo)	C++17	100 / 100	874 ms	26788 KB

/*/
   GLO
   O(nlogn)
   Author: Aleksander Lukasiewicz
/*/
#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
using namespace std;

const int MAXN = 2*100*1000;

int n, x;
int temperature[MAXN + 3], res_without_shift[MAXN + 3], res_with_shift[MAXN + 3];
unordered_map<int, int> renum;
vector<int> V;

int tree_without[4*MAXN + 3], tree_with[4*MAXN + 3];

int query_max(int a, int b, int tree[]){
    if(b < a) return 0;
    a+=2*MAXN; b+=2*MAXN;
    int result = 0;
    while(a <= b){
        if(a % 2 == 1) result = max(result, tree[a]);
        if(b % 2 == 0) result = max(result, tree[b]);
        a = (a+1)/2;
        b = (b-1)/2;
    }
    
    return result;
}

void update(int a, int val, int tree[]){
    a += 2*MAXN;
    while(a >= 1){
        tree[a] = max(tree[a], val);
        a/=2;
    }
}

int main(){
    cin >> n >> x;
    for(int i=0; i<n; i++){
        cin >> temperature[i];
        V.push_back(temperature[i]);
        V.push_back(temperature[i] - x);
    }
    
    sort(V.begin(), V.end());
    for(int i=0; i<(int)V.size(); i++)
        renum[V[i]] = i;
    
    int result = 0;
    for(int i=0; i<n; i++){
        int r = renum[temperature[i]];
        res_without_shift[i] = query_max(0, r - 1, tree_without) + 1;
        res_with_shift[i] = query_max(0, r - 1, tree_with) + 1;
        update(r, res_without_shift[i], tree_without);
        update(r, res_with_shift[i], tree_with);
        update(renum[temperature[i]-x], res_without_shift[i], tree_with);
        result = max(result, res_without_shift[i]);
        result = max(result, res_with_shift[i]);
    }
    
    cout << result << "\n";
 
    return 0;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	3 ms	612 KB	Output is correct
7	Correct	4 ms	656 KB	Output is correct
8	Correct	2 ms	688 KB	Output is correct
9	Correct	3 ms	688 KB	Output is correct
10	Correct	3 ms	688 KB	Output is correct
11	Correct	2 ms	688 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	3 ms	612 KB	Output is correct
7	Correct	4 ms	656 KB	Output is correct
8	Correct	2 ms	688 KB	Output is correct
9	Correct	3 ms	688 KB	Output is correct
10	Correct	3 ms	688 KB	Output is correct
11	Correct	2 ms	688 KB	Output is correct
12	Correct	2 ms	688 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	3 ms	688 KB	Output is correct
16	Correct	2 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	2 ms	688 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	3 ms	612 KB	Output is correct
7	Correct	4 ms	656 KB	Output is correct
8	Correct	2 ms	688 KB	Output is correct
9	Correct	3 ms	688 KB	Output is correct
10	Correct	3 ms	688 KB	Output is correct
11	Correct	2 ms	688 KB	Output is correct
12	Correct	2 ms	688 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	3 ms	688 KB	Output is correct
16	Correct	2 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	2 ms	688 KB	Output is correct
19	Correct	4 ms	748 KB	Output is correct
20	Correct	3 ms	748 KB	Output is correct
21	Correct	5 ms	876 KB	Output is correct
22	Correct	3 ms	876 KB	Output is correct
23	Correct	4 ms	876 KB	Output is correct
24	Correct	3 ms	876 KB	Output is correct
25	Correct	4 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	524 ms	18840 KB	Output is correct
2	Correct	593 ms	18840 KB	Output is correct
3	Correct	494 ms	18840 KB	Output is correct
4	Correct	583 ms	18840 KB	Output is correct
5	Correct	250 ms	18840 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	150 ms	18840 KB	Output is correct
2	Correct	127 ms	18840 KB	Output is correct
3	Correct	142 ms	18840 KB	Output is correct
4	Correct	60 ms	18840 KB	Output is correct
5	Correct	2 ms	18840 KB	Output is correct
6	Correct	53 ms	18840 KB	Output is correct
7	Correct	122 ms	18840 KB	Output is correct

Subtask #6
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	347 ms	18840 KB	Output is correct
2	Correct	373 ms	18840 KB	Output is correct
3	Correct	874 ms	25268 KB	Output is correct
4	Correct	380 ms	25268 KB	Output is correct
5	Correct	142 ms	25268 KB	Output is correct
6	Correct	230 ms	25268 KB	Output is correct
7	Correct	248 ms	25268 KB	Output is correct
8	Correct	300 ms	25268 KB	Output is correct

Subtask #7
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	604 KB	Output is correct
5	Correct	3 ms	604 KB	Output is correct
6	Correct	3 ms	612 KB	Output is correct
7	Correct	4 ms	656 KB	Output is correct
8	Correct	2 ms	688 KB	Output is correct
9	Correct	3 ms	688 KB	Output is correct
10	Correct	3 ms	688 KB	Output is correct
11	Correct	2 ms	688 KB	Output is correct
12	Correct	2 ms	688 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	3 ms	688 KB	Output is correct
16	Correct	2 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	2 ms	688 KB	Output is correct
19	Correct	4 ms	748 KB	Output is correct
20	Correct	3 ms	748 KB	Output is correct
21	Correct	5 ms	876 KB	Output is correct
22	Correct	3 ms	876 KB	Output is correct
23	Correct	4 ms	876 KB	Output is correct
24	Correct	3 ms	876 KB	Output is correct
25	Correct	4 ms	876 KB	Output is correct
26	Correct	4 ms	876 KB	Output is correct
27	Correct	524 ms	18840 KB	Output is correct
28	Correct	593 ms	18840 KB	Output is correct
29	Correct	494 ms	18840 KB	Output is correct
30	Correct	583 ms	18840 KB	Output is correct
31	Correct	250 ms	18840 KB	Output is correct
32	Correct	150 ms	18840 KB	Output is correct
33	Correct	127 ms	18840 KB	Output is correct
34	Correct	142 ms	18840 KB	Output is correct
35	Correct	60 ms	18840 KB	Output is correct
36	Correct	2 ms	18840 KB	Output is correct
37	Correct	53 ms	18840 KB	Output is correct
38	Correct	122 ms	18840 KB	Output is correct
39	Correct	347 ms	18840 KB	Output is correct
40	Correct	373 ms	18840 KB	Output is correct
41	Correct	874 ms	25268 KB	Output is correct
42	Correct	380 ms	25268 KB	Output is correct
43	Correct	142 ms	25268 KB	Output is correct
44	Correct	230 ms	25268 KB	Output is correct
45	Correct	248 ms	25268 KB	Output is correct
46	Correct	300 ms	25268 KB	Output is correct
47	Correct	363 ms	25268 KB	Output is correct
48	Correct	346 ms	25268 KB	Output is correct
49	Correct	857 ms	26788 KB	Output is correct
50	Correct	345 ms	26788 KB	Output is correct
51	Correct	220 ms	26788 KB	Output is correct
52	Correct	233 ms	26788 KB	Output is correct
53	Correct	305 ms	26788 KB	Output is correct
54	Correct	302 ms	26788 KB	Output is correct
55	Correct	616 ms	26788 KB	Output is correct

답안 #70185

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