oj.uz

Submission #70184

# Submission time Handle Problem Language Result Execution time Memory
70184 2018-08-22T13:03:04 Z model_code Global Warming (CEOI18_glo) C++17
100 / 100
 1210 ms 29568 KB 
/*/
   GLO
   O(nlogn)
   Author: Aleksander Lukasiewicz
/*/
#include<iostream>
#include<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];
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++){
        res_without_shift[i] = query_max(0, renum[temperature[i]] - 1, tree_without) + 1;
        res_with_shift[i] = query_max(0, renum[temperature[i]] - 1, tree_with) + 1;
        update(renum[temperature[i]], res_without_shift[i], tree_without);
        update(renum[temperature[i]], 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

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 20128 KB Output is correct
2 Correct 872 ms 20132 KB Output is correct
3 Correct 823 ms 20132 KB Output is correct
4 Correct 864 ms 20132 KB Output is correct
5 Correct 316 ms 20132 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 20132 KB Output is correct
2 Correct 212 ms 20132 KB Output is correct
3 Correct 168 ms 20132 KB Output is correct
4 Correct 78 ms 20132 KB Output is correct
5 Correct 3 ms 20132 KB Output is correct
6 Correct 88 ms 20132 KB Output is correct
7 Correct 129 ms 20132 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 20132 KB Output is correct
2 Correct 485 ms 20132 KB Output is correct
3 Correct 1210 ms 28040 KB Output is correct
4 Correct 395 ms 28040 KB Output is correct
5 Correct 245 ms 28040 KB Output is correct
6 Correct 487 ms 28040 KB Output is correct
7 Correct 513 ms 28040 KB Output is correct
8 Correct 419 ms 28040 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 612 KB Output is correct
4 Correct 2 ms 740 KB Output is correct
5 Correct 2 ms 740 KB Output is correct
6 Correct 2 ms 740 KB Output is correct
7 Correct 2 ms 740 KB Output is correct
8 Correct 3 ms 740 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 2 ms 740 KB Output is correct
11 Correct 2 ms 740 KB Output is correct
12 Correct 3 ms 740 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 3 ms 740 KB Output is correct
15 Correct 3 ms 740 KB Output is correct
16 Correct 3 ms 740 KB Output is correct
17 Correct 3 ms 740 KB Output is correct
18 Correct 3 ms 740 KB Output is correct
19 Correct 5 ms 748 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 5 ms 748 KB Output is correct
22 Correct 5 ms 748 KB Output is correct
23 Correct 3 ms 748 KB Output is correct
24 Correct 4 ms 752 KB Output is correct
25 Correct 4 ms 752 KB Output is correct
26 Correct 4 ms 752 KB Output is correct
27 Correct 822 ms 20128 KB Output is correct
28 Correct 872 ms 20132 KB Output is correct
29 Correct 823 ms 20132 KB Output is correct
30 Correct 864 ms 20132 KB Output is correct
31 Correct 316 ms 20132 KB Output is correct
32 Correct 198 ms 20132 KB Output is correct
33 Correct 212 ms 20132 KB Output is correct
34 Correct 168 ms 20132 KB Output is correct
35 Correct 78 ms 20132 KB Output is correct
36 Correct 3 ms 20132 KB Output is correct
37 Correct 88 ms 20132 KB Output is correct
38 Correct 129 ms 20132 KB Output is correct
39 Correct 462 ms 20132 KB Output is correct
40 Correct 485 ms 20132 KB Output is correct
41 Correct 1210 ms 28040 KB Output is correct
42 Correct 395 ms 28040 KB Output is correct
43 Correct 245 ms 28040 KB Output is correct
44 Correct 487 ms 28040 KB Output is correct
45 Correct 513 ms 28040 KB Output is correct
46 Correct 419 ms 28040 KB Output is correct
47 Correct 439 ms 28040 KB Output is correct
48 Correct 420 ms 28040 KB Output is correct
49 Correct 1004 ms 29568 KB Output is correct
50 Correct 391 ms 29568 KB Output is correct
51 Correct 320 ms 29568 KB Output is correct
52 Correct 504 ms 29568 KB Output is correct
53 Correct 511 ms 29568 KB Output is correct
54 Correct 544 ms 29568 KB Output is correct
55 Correct 755 ms 29568 KB Output is correct