oj.uz

답안 #1095033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095033 2024-10-01T07:40:25 Z SoMotThanhXuan Global Warming (CEOI18_glo) C++17
100 / 100
 241 ms 8528 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 5;
int N, X, T[maxN];
namespace subtask1{
    bool check(){
        return X <= 50 && N <= 50;
    }
    int b[55], f[55];
    int res = 0;
    void sol(int a[]){
        for(int i = 1; i <= N; ++i)f[i] = 0;
        int ans = 0;
        for(int i = 1; i <= N; ++i){
            f[i] = 1;
            for(int j = 1; j < i; ++j){
                if(b[j] < b[i]) f[i] = max(f[i], f[j] + 1);
            }
            ans = max(ans, f[i]);
        }
        res = max(res, ans);
    }
    void solve(){
        for(int d = -X; d <= X; ++d){
            for(int i = 1; i <= N; ++i){
                for(int j = i; j <= N; ++j){
                    for(int k = 1; k <= N; ++k)b[k] = T[k];
                    for(int x = i; x <= j; ++x)b[x] += d;
                    sol(b);
                }
            }
        }
        cout << res;
    }
}
namespace subtask3{
    int it[4 * maxN];
    int comp[maxN];
    bool check(){
        return X == 0;
    }
    void update(int id, int l, int r, int p, int v){
        if(l > p || r < p) return ;
        if(l == r){
            it[id] = v;
            return ;
        }
        int mid = l + r >> 1;
        if(p <= mid) update(id << 1, l, mid, p, v);
        else update(id << 1 | 1, mid + 1, r, p, v);
        it[id] = max(it[id << 1], it[id << 1 | 1]);
    }
    int get(int id, int l, int r, int u, int v){
        if(l > v || r < u) return 0;
        if(l >= u && r <= v) return it[id];
        int mid = l + r >> 1;
        return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
    }
    void solve(){
        for(int i = 1; i <= N; ++i)comp[i] = T[i];
        sort(comp + 1, comp + 1 + N);
        for(int i = 1; i <= N; ++i){
            T[i] = lower_bound(comp + 1, comp + 1 + N, T[i]) - comp;
            update(1, 1, N, T[i], get(1, 1, N, 1, T[i] - 1) + 1);
        }
        cout << it[1];
    }
}
namespace subtask6{
    int it[4 * maxN];
    void build(int id, int l, int r){
        if(l == r){
            it[id] = 0;
            return ;
        }
        int mid = l + r >> 1;
        build(id << 1, l, mid);
        build(id << 1 | 1, mid + 1, r);
        it[id] = 0;
    }
    void update(int id, int l, int r, int p, int v){
        if(l > p || r < p) return ;
        if(l == r){
            it[id] = v;
            return ;
        }
        int mid = l + r >> 1;
        if(p <= mid) update(id << 1, l, mid, p, v);
        else update(id << 1 | 1, mid + 1, r, p, v);
        it[id] = max(it[id << 1], it[id << 1 | 1]);
    }
    int get(int id, int l, int r, int u, int v){
        if(l > v || r < u) return 0;
        if(l >= u && r <= v) return it[id];
        int mid = l + r >> 1;
        return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
    }
    int comp[maxN];
    #define left __left
    #define right __right
    int left[maxN], right[maxN];
    int tmp[maxN];
    void solve(){
        for(int i = 1; i <= N; ++i)comp[i] = T[i];
        sort(comp + 1, comp + 1 + N);
        for(int i = 1; i <= N; ++i)tmp[i] = lower_bound(comp + 1, comp + 1 + N, T[i]) - comp;
        for(int i = 1; i <= N; ++i){
            left[i] = get(1, 1, N, 1, tmp[i] - 1) + 1;
            update(1, 1, N, tmp[i], left[i]);
        }
        build(1, 1, N);
        for(int i = N; i >= 1; --i){
            right[i] = get(1, 1, N, tmp[i] + 1, N) + 1;
            update(1, 1, N, tmp[i], right[i]);
        }
        int res = it[1];
        build(1, 1, N);
        for(int i = 1; i <= N; ++i){
            int x = lower_bound(comp + 1, comp + 1 + N, T[i] + X) - comp;
            res = max(res, get(1, 1, N, 1, x - 1) + right[i]);
            update(1, 1, N, tmp[i], left[i]);
        }
        cout << res;
    }
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> N >> X;
    for(int i = 1; i <= N; ++i)cin >> T[i];
//    if(subtask1 :: check()) return subtask1 :: solve(), 0;
//    if(subtask2 :: check()) return subtask2 :: solve(), 0;
//    if(subtask3 :: check()) return subtask3 :: solve(), 0;
//    if(subtask4 :: check()) return subtask4 :: solve(), 0;
//    if(subtask5 :: check()) return subtask5 :: solve(), 0;
    return subtask6 :: solve(), 0;
    return 0;
}
/*
8 0
7 3 5 12 2 7 3 4
*/

Compilation message

glo.cpp: In function 'void subtask3::update(int, int, int, int, int)':
glo.cpp:48:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   48 |         int mid = l + r >> 1;
      |                   ~~^~~
glo.cpp: In function 'int subtask3::get(int, int, int, int, int)':
glo.cpp:56:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |         int mid = l + r >> 1;
      |                   ~~^~~
glo.cpp: In function 'void subtask6::build(int, int, int)':
glo.cpp:76:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |         int mid = l + r >> 1;
      |                   ~~^~~
glo.cpp: In function 'void subtask6::update(int, int, int, int, int)':
glo.cpp:87:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |         int mid = l + r >> 1;
      |                   ~~^~~
glo.cpp: In function 'int subtask6::get(int, int, int, int, int)':
glo.cpp:95:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 8276 KB Output is correct
2 Correct 240 ms 8240 KB Output is correct
3 Correct 241 ms 8332 KB Output is correct
4 Correct 238 ms 8528 KB Output is correct
5 Correct 125 ms 7428 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2392 KB Output is correct
2 Correct 51 ms 2384 KB Output is correct
3 Correct 50 ms 2388 KB Output is correct
4 Correct 30 ms 2132 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 31 ms 2248 KB Output is correct
7 Correct 43 ms 2392 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 4496 KB Output is correct
2 Correct 88 ms 4180 KB Output is correct
3 Correct 197 ms 8276 KB Output is correct
4 Correct 105 ms 7500 KB Output is correct
5 Correct 61 ms 3920 KB Output is correct
6 Correct 106 ms 7248 KB Output is correct
7 Correct 110 ms 8016 KB Output is correct
8 Correct 74 ms 4432 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 241 ms 8276 KB Output is correct
28 Correct 240 ms 8240 KB Output is correct
29 Correct 241 ms 8332 KB Output is correct
30 Correct 238 ms 8528 KB Output is correct
31 Correct 125 ms 7428 KB Output is correct
32 Correct 53 ms 2392 KB Output is correct
33 Correct 51 ms 2384 KB Output is correct
34 Correct 50 ms 2388 KB Output is correct
35 Correct 30 ms 2132 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 31 ms 2248 KB Output is correct
38 Correct 43 ms 2392 KB Output is correct
39 Correct 92 ms 4496 KB Output is correct
40 Correct 88 ms 4180 KB Output is correct
41 Correct 197 ms 8276 KB Output is correct
42 Correct 105 ms 7500 KB Output is correct
43 Correct 61 ms 3920 KB Output is correct
44 Correct 106 ms 7248 KB Output is correct
45 Correct 110 ms 8016 KB Output is correct
46 Correct 74 ms 4432 KB Output is correct
47 Correct 110 ms 4416 KB Output is correct
48 Correct 107 ms 4176 KB Output is correct
49 Correct 234 ms 8104 KB Output is correct
50 Correct 122 ms 7504 KB Output is correct
51 Correct 121 ms 6308 KB Output is correct
52 Correct 152 ms 7468 KB Output is correct
53 Correct 114 ms 7508 KB Output is correct
54 Correct 118 ms 8272 KB Output is correct
55 Correct 195 ms 8268 KB Output is correct