제출 #1092915

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1092915		RiverFlow	Financial Report (JOI21_financial)	C++14	100 / 100	341 ms	30656 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], dp[N];
int s[N], p[N], mi[N];

struct DSU {
int n;
    DSU() {};
    DSU (int _n) {
        n = _n;
        FOR(i, 1, n) s[i] = 1, p[i] = mi[i] = i;
    }
    int root(int u) {
        return u == p[u] ? u : p[u] = root(p[u]);
    }
    void unite(int u, int v) {
        u = root(u), v = root(v);
        if (u == v) return ;
        if (s[v] > s[u]) swap(u, v);
        s[u] += s[v], p[v] = u;
        mini(mi[u], mi[v]);
    }
    int getmin(int u) {
        return mi[root(u)];
    }
};

struct IT {
    int n;
    vector<int> t;
    IT (){};
    IT (int _n) {
        n = _n;
        t.resize(4 * n + 7);
    }
    void upd(int id, int l, int r, int p) {
        if (l == r) return void(t[id] = dp[p]);
        int m = (l + r) >> 1;
        if (p <= m)
            upd(id << 1, l, m, p);
        else
            upd(id << 1 | 1, m + 1, r, p);
        t[id] = max(t[id << 1], t[id << 1 | 1]);
    }
    void upd(int p) {
        upd(1, 1, n, p);
    }
    int get(int id, int l, int r, int u, int v) {
        if (l > v or r < u) return 0;
        if (l >= u and r <= v) return t[id];
        int m = (l + r) >> 1;
        return max(get(id << 1, l, m, u, v), get(id << 1 | 1, m + 1, r, u, v));
    }
    int get(int l, int r) {
        return get(1, 1, n, l, r);
    }
};

void main_code() {
    int n, d; cin >> n >> d;
    for(int i = 1; i <= n; ++i) cin >> a[i];

    vector<pair<int, int>> px;
    FOR(i, 1, n) px.push_back(_mp(a[i], i));
    sort(px.begin(), px.end());

    DSU dsu(n);
    set<int> pos;

    IT st(n);

    pos.insert(0);
    pos.insert(n + 1);

    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[j].fi)
            ++j;
        for(int k = i; k <= j; ++k) {
            int x = px[k].second;
            pos.insert(x);
            int t = *(--pos.lower_bound(x));
            if (t > 0 and x - t <= d)
                dsu.unite(x, t);
            t = *pos.upper_bound(x);
            if (t < n + 1 and t - x <= d)
                dsu.unite(x, t);
            int l = dsu.getmin(x);
            dp[x] = 1;
            if (l < x) {
                dp[x] = st.get(l, x - 1) + 1;
            }
        }
        for(int k = i; k <= j; ++k) {
            st.upd(px[k].second);
        }
    }
    cout << st.get(1, n);
}


/*     Let the river flows naturally     */

컴파일 시 표준 에러 (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: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 12 / 12
• Subtask 5: 5 / 5
• Subtask 6: 35 / 35