oj.uz

답안 #864300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864300 2023-10-22T11:00:42 Z vjudge1 Financial Report (JOI21_financial) C++17
17 / 100
 171 ms 45508 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

vector<ll> a;

struct SegmentTree {
    vector<ll> sgt;

    SegmentTree(int n) {
        sgt.resize(n, LLONG_MAX);
    }

    ll get(int k, int l, int r, ll v) {
        if (l == r) return l;
        int m = (l + r) / 2;
        if (sgt[k * 2 + 1] < v) return get(k * 2 + 1, m + 1, r, v);
        return get(k * 2, l, m, v);
    }

    void update(int k, int l, int r, int i, ll v) {
        if (l > i || r < i) return;
        if (l == r) {
            sgt[k] = v;
            return;
        }
        int m = (l + r) / 2;
        update(k * 2, l, m, i, v);
        update(k * 2 + 1, m + 1, r, i, v);
        sgt[k] = min(sgt[k * 2], sgt[k * 2 + 1]);
    }
} sgt(4 * (3e5 + 10));

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, d;
    cin >> n >> d;
    a.resize(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    if (d == 1) {
        deque<ll> dq;
        int ans = 0;
        dq.push_back(a[n]);
        for (int i = n - 1; i > 0; i--) {
            while (dq.size() && a[i] >= dq.front()) dq.pop_front();
            dq.push_front(a[i]);
            ans = max(ans, (int) dq.size());
        }
        cout << ans;
    }
    if (d == n) {
        ll ans = 0;
        multiset<ll> lis[n + 10];
        lis[0].insert(0);
        sgt.update(1, 0, n, 0, 0);
        ll dp[n + 10];
        dp[0] = 0;
        for (int i = 1; i <= n; i++) {
            ll mn;
            if (i > d + 1) {
                mn = *lis[dp[i - d - 1]].begin();
                lis[dp[i - d - 1]].erase(lis[dp[i - d - 1]].find(a[i - d - 1]));
                if (lis[dp[i - d - 1]].size()) {
                    if (*lis[dp[i - d - 1]].begin() != mn) sgt.update(1, 0, n, i - d - 1, *lis[dp[i - d - 1]].begin());
                }
                else sgt.update(1, 0, n, i - d - 1, LLONG_MAX);
            }
            dp[i] = sgt.get(1, 0, n, a[i]) + 1;
            if (lis[dp[i]].size()) mn = *lis[dp[i]].begin();
            lis[dp[i]].insert(a[i]);
            if (lis[dp[i]].size() == 1 || mn != *lis[dp[i]].begin()) sgt.update(1, 0, n, dp[i], a[i]);
            ans = max(ans, dp[i]);
            // cout << i << " : " << dp[i] << endl;
        }
        cout << ans;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:76:40: warning: 'mn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |             if (lis[dp[i]].size() == 1 || mn != *lis[dp[i]].begin()) sgt.update(1, 0, n, dp[i], a[i]);
      |                 ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 12120 KB Output is correct
2 Correct 28 ms 12120 KB Output is correct
3 Correct 27 ms 12120 KB Output is correct
4 Correct 27 ms 12124 KB Output is correct
5 Correct 27 ms 12124 KB Output is correct
6 Correct 27 ms 12124 KB Output is correct
7 Correct 26 ms 14500 KB Output is correct
8 Correct 25 ms 12376 KB Output is correct
9 Correct 33 ms 13996 KB Output is correct
10 Correct 29 ms 12120 KB Output is correct
11 Correct 27 ms 12376 KB Output is correct
12 Correct 27 ms 12124 KB Output is correct
13 Correct 25 ms 12136 KB Output is correct
14 Correct 25 ms 12120 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 42612 KB Output is correct
2 Correct 135 ms 42916 KB Output is correct
3 Correct 161 ms 42540 KB Output is correct
4 Correct 171 ms 42712 KB Output is correct
5 Correct 131 ms 42596 KB Output is correct
6 Correct 151 ms 42580 KB Output is correct
7 Correct 93 ms 42628 KB Output is correct
8 Correct 119 ms 45508 KB Output is correct
9 Correct 98 ms 45396 KB Output is correct
10 Correct 127 ms 45464 KB Output is correct
11 Correct 162 ms 45396 KB Output is correct
12 Correct 98 ms 45452 KB Output is correct

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 9816 KB Output isn't correct
2 Halted 0 ms 0 KB -