oj.uz

답안 #585338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585338 2022-06-28T17:00:54 Z BhavayGoyal Global Warming (CEOI18_glo) C++14
100 / 100
 50 ms 4420 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};


// -------------------------------------------------- Main Code --------------------------------------------------

void sol() {
    int n, k; cin >> n >> k;
    int arr[n], longestPref[n] = {0};
    for (int i = 0; i < n; i++) cin >> arr[i];
    int ans = 1; vi dp;
    for (int i = 0; i < n; i++) {
        int x = lower_bound(all(dp), arr[i]) - dp.begin();
        longestPref[i] = x+1;
        ans = max(ans, longestPref[i]);
        if (x == dp.size()) dp.pb(arr[i]);
        else dp[x] = arr[i];
    }
    dp.clear();
    for (int i = n-1; i >= 0; i--) {
        int x = lower_bound(all(dp), -arr[i]+k) - dp.begin();
        ans = max(ans, longestPref[i] + x);
        x = lower_bound(all(dp), -arr[i]) - dp.begin();
        if (x == dp.size()) dp.pb(-arr[i]);
        else dp[x] = -arr[i];
    }
    cout << ans << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Compilation message

glo.cpp: In function 'void sol()':
glo.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         if (x == dp.size()) dp.pb(arr[i]);
      |             ~~^~~~~~~~~~~~
glo.cpp:49:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         if (x == dp.size()) dp.pb(-arr[i]);
      |             ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 1876 KB Output is correct
2 Correct 48 ms 3776 KB Output is correct
3 Correct 47 ms 3808 KB Output is correct
4 Correct 49 ms 3764 KB Output is correct
5 Correct 34 ms 3656 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 596 KB Output is correct
2 Correct 12 ms 1076 KB Output is correct
3 Correct 11 ms 1068 KB Output is correct
4 Correct 8 ms 1108 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1184 KB Output is correct
7 Correct 11 ms 1200 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 1108 KB Output is correct
2 Correct 21 ms 1980 KB Output is correct
3 Correct 42 ms 3784 KB Output is correct
4 Correct 27 ms 3656 KB Output is correct
5 Correct 24 ms 1976 KB Output is correct
6 Correct 21 ms 3576 KB Output is correct
7 Correct 31 ms 4312 KB Output is correct
8 Correct 20 ms 1968 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 50 ms 1876 KB Output is correct
28 Correct 48 ms 3776 KB Output is correct
29 Correct 47 ms 3808 KB Output is correct
30 Correct 49 ms 3764 KB Output is correct
31 Correct 34 ms 3656 KB Output is correct
32 Correct 11 ms 596 KB Output is correct
33 Correct 12 ms 1076 KB Output is correct
34 Correct 11 ms 1068 KB Output is correct
35 Correct 8 ms 1108 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 7 ms 1184 KB Output is correct
38 Correct 11 ms 1200 KB Output is correct
39 Correct 24 ms 1108 KB Output is correct
40 Correct 21 ms 1980 KB Output is correct
41 Correct 42 ms 3784 KB Output is correct
42 Correct 27 ms 3656 KB Output is correct
43 Correct 24 ms 1976 KB Output is correct
44 Correct 21 ms 3576 KB Output is correct
45 Correct 31 ms 4312 KB Output is correct
46 Correct 20 ms 1968 KB Output is correct
47 Correct 24 ms 1952 KB Output is correct
48 Correct 23 ms 1980 KB Output is correct
49 Correct 46 ms 3776 KB Output is correct
50 Correct 30 ms 3640 KB Output is correct
51 Correct 24 ms 2896 KB Output is correct
52 Correct 33 ms 3768 KB Output is correct
53 Correct 24 ms 3780 KB Output is correct
54 Correct 28 ms 4420 KB Output is correct
55 Correct 37 ms 3788 KB Output is correct