Submission #1092782

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092782		RiverFlow	Financial Report (JOI21_financial)	C++14	14 / 100	4022 ms	9412 KiB

Main

#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)3e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int a[N];
int b[N], dp[N];
bool on[N];

void main_code() {
    int n, d; cin >> n >> d;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    vector<ii> px;
    FOR(i, 1, n) px.push_back(_mp(a[i], i));
    sort(px.begin(), px.end());
    for(int i = 0, j = 0; i < sz(px); i = j + 1) {
        j = i;
        while (j + 1 < sz(px) and px[j + 1].fi == px[i].fi) ++j;
        FOR(k, i, j) {
            int x = px[k].second;
            b[x] = 1;
            FOD(l, x - 1, max(x - d, 1)) {
                b[x] = max(b[x], dp[l] + 1);
            }
            on[x] = 1;
        }
        FOR(k, i, j) {
            int x = px[k].second;
            dp[x] = b[x];
            for(int t = x, dx = 0; t <= n; ++t) {
                if (on[t]) dx = 0;
                if (dx > d) break ;
                if (on[t])
                    dp[t] = max(dp[t], dp[x]);
                ++dx;
            }
        }
//        FOR(i, 1, n) cout << dp[i] << ' '; cout << nl;
    }
    cout << *max_element(dp + 1, dp + n + 1);
}


/*     Let the river flows naturally     */

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35