oj.uz

답안 #972972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972972 2024-05-01T11:06:34 Z efedmrlr Global Warming (CEOI18_glo) C++17
100 / 100
 136 ms 9312 KB 
#include <bits/stdc++.h>

#define lli long long int
#define pb push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define ld long double

using namespace std;

const int N = 1e5 + 5;
const int INF = 1e9 + 500;
const int MX = 1e9 + 5;
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

int n, x;
vector<int> t;
vector<int> pr, suf;

void solve() {
    cin >> n >> x;
    t.assign(n + 1, 0);
    pr.resize(n + 3);
    suf.resize(n + 3);
    for(int i = 1; i <= n; i++) {
        cin >> t[i];
    }
    set<array<int, 2> > st;
    for(int i = 1; i <= n; i++) {
        auto itr = st.lower_bound({t[i], 0});
        if(itr == st.end()) {
            pr[i] = st.size() + 1;
        }
        else {
            pr[i] = (*itr)[1];
            st.erase(itr);
        }
        st.insert({t[i], pr[i]});
    }
    st.clear();
    for(int i = n; i >= 1; i--) {
        auto itr = st.lower_bound({-t[i], 0});
        if(itr == st.end()) {
            suf[i] = st.size() + 1;
        }
        else {
            suf[i] = (*itr)[1];
            st.erase(itr);
        }
        st.insert({-t[i], suf[i]});
    }
    st.clear();
    int ans = 0;
    st.insert({INF, 0});
    for(int i = n; i >= 1; i--) {
        int ret = pr[i];
        if(t[i] + 1 - x <= MX) {
            ret += (*st.lower_bound({t[i] + 1 - x, 0}))[1];
        }
        ans = max(ans, ret);
        auto itr = st.upper_bound({t[i], suf[i]});
        if(itr != st.end() && (*itr)[1] >= suf[i]) {
            continue;
        }
        while(itr != st.begin()) {
            itr--;
            if((*itr)[1] > suf[i]) {
                break;
            }
            else {
                itr = st.erase(itr);
            }
        }
        st.insert({t[i], suf[i]});
    }
    cout << ans << "\n";

}

signed main() {
    fastio();
    solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 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 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 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 1 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 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 1 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 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 124 ms 2844 KB Output is correct
2 Correct 122 ms 2836 KB Output is correct
3 Correct 123 ms 2840 KB Output is correct
4 Correct 121 ms 2648 KB Output is correct
5 Correct 118 ms 7248 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 856 KB Output is correct
2 Correct 30 ms 1068 KB Output is correct
3 Correct 29 ms 860 KB Output is correct
4 Correct 26 ms 2136 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 27 ms 1984 KB Output is correct
7 Correct 23 ms 860 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1628 KB Output is correct
2 Correct 55 ms 1876 KB Output is correct
3 Correct 115 ms 2648 KB Output is correct
4 Correct 117 ms 7492 KB Output is correct
5 Correct 58 ms 3964 KB Output is correct
6 Correct 92 ms 7140 KB Output is correct
7 Correct 109 ms 7052 KB Output is correct
8 Correct 45 ms 1624 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 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 1 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 124 ms 2844 KB Output is correct
28 Correct 122 ms 2836 KB Output is correct
29 Correct 123 ms 2840 KB Output is correct
30 Correct 121 ms 2648 KB Output is correct
31 Correct 118 ms 7248 KB Output is correct
32 Correct 29 ms 856 KB Output is correct
33 Correct 30 ms 1068 KB Output is correct
34 Correct 29 ms 860 KB Output is correct
35 Correct 26 ms 2136 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 27 ms 1984 KB Output is correct
38 Correct 23 ms 860 KB Output is correct
39 Correct 55 ms 1628 KB Output is correct
40 Correct 55 ms 1876 KB Output is correct
41 Correct 115 ms 2648 KB Output is correct
42 Correct 117 ms 7492 KB Output is correct
43 Correct 58 ms 3964 KB Output is correct
44 Correct 92 ms 7140 KB Output is correct
45 Correct 109 ms 7052 KB Output is correct
46 Correct 45 ms 1624 KB Output is correct
47 Correct 59 ms 1652 KB Output is correct
48 Correct 61 ms 1628 KB Output is correct
49 Correct 125 ms 4948 KB Output is correct
50 Correct 120 ms 8656 KB Output is correct
51 Correct 136 ms 7556 KB Output is correct
52 Correct 126 ms 8784 KB Output is correct
53 Correct 104 ms 8968 KB Output is correct
54 Correct 132 ms 9312 KB Output is correct
55 Correct 98 ms 4800 KB Output is correct