oj.uz

Submission #891299

# Submission time Handle Problem Language Result Execution time Memory
891299 2023-12-22T17:01:18 Z SorahISA Financial Report (JOI21_financial) C++17
12 / 100
 44 ms 7248 KB 
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

void solve() {
    int N, D; cin >> N >> D;
    
    vector<int> A(N);
    for (int &x : A) cin >> x;
    
    
    if (D == 1) {
        
        int ans = 1;
        deque<int> stk;
        for (int i = N-1; i >= 0; --i) {
            while (SZ(stk) and A[i] >= stk[0]) stk.pf();
            stk.ef(A[i]);
            chmax(ans, SZ(stk));
        }
        cout << ans << "\n";
        
    }
    else if (D == N) {
        
        reverse(ALL(A));
        for (int x : A) x *= -1;
        
        vector<int> lis{0};
        for (int x : A) {
            if (x > lis.back()) lis.eb(x);
            else *lower_bound(ALL(lis), x) = x;
        }
        cout << SZ(lis) << "\n";
        
    }
    else {
        
        vector<int> dp(N, 1);
        for (int i = N-1; i >= 0; --i) {
            for (int j = i+1, cnt = 1; cnt <= D and j < N; ++j, ++cnt) {
                    if (A[j] >  A[i]) chmax(dp[i], dp[j] + 1);
                else if (A[j] == A[i]) chmax(dp[i], dp[j]), cnt = 0;
                else if (A[j] <  A[i]) cnt = 0;
            }
            // debug(i, A[i], dp[i]);
        }
        cout << *max_element(ALL(dp)) << "\n";
        
    }
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using int64 = long long;
#define int int64
using float80 = long double;
#define double float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "\u001b[33m"), \
    fprintf(stderr, "At [%s], line %d: (%s) = ", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), \
    fprintf(stderr, "\u001b[0m")
template <typename T> void _do(T &&_t) { cerr << _t << "\n"; }
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) { cerr << _t << ", ", _do(_u...); }
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) { return lhs > rhs ? lhs = rhs, 1 : 0; }
template <typename T, typename U> bool chmax(T &lhs, U rhs) { return lhs < rhs ? lhs = rhs, 1 : 0; }

#endif

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4444 KB Output is correct
2 Correct 26 ms 4208 KB Output is correct
3 Correct 27 ms 4444 KB Output is correct
4 Correct 40 ms 2652 KB Output is correct
5 Correct 25 ms 2652 KB Output is correct
6 Correct 27 ms 4716 KB Output is correct
7 Correct 34 ms 6876 KB Output is correct
8 Correct 30 ms 4444 KB Output is correct
9 Correct 26 ms 7248 KB Output is correct
10 Correct 44 ms 5460 KB Output is correct
11 Correct 27 ms 5604 KB Output is correct
12 Correct 27 ms 5460 KB Output is correct
13 Correct 25 ms 5724 KB Output is correct
14 Correct 25 ms 5460 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 4440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -