제출 #1276415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276415		icebear	Financial Report (JOI21_financial)	C++20	100 / 100	733 ms	42616 KiB

Main

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 3e5 + 5;
int n, D, a[N], f[N], last[N], node[N << 2];
vector<int> compress;

void update(int pos, int val) {
    int id = 1, l = 1, r = n;
    while(l < r) {
        int mid = (l + r) >> 1;
        if (pos > mid) id = (id << 1 | 1), l = mid + 1;
        else id = (id << 1), r = mid;
    }
    node[id] = val;
    while(id > 1) {
        id >>= 1;
        node[id] = max(node[id << 1], node[id << 1 | 1]);
    }
}

int walk(int id, int l, int r, int u, int v, int k) {
    if (l > v || r < u || node[id] <= k) return -1;
    if (l == r) return l;
    int mid = (l + r) >> 1;
    int ret = walk(id << 1, l, mid, u, v, k);
    if (ret != -1) return ret;
    return walk(id << 1 | 1, mid + 1, r, u, v, k);
}

int getMax(int id, int l, int r, int u, int v) {
    if (l > v || r < u || u > v) return 0;
    if (u <= l && r <= v) return node[id];
    int mid = (l + r) >> 1;
    return max(getMax(id << 1, l, mid, u, v), getMax(id << 1 | 1, mid + 1, r, u, v));
}

int pos[N], used[N];
vector<int> del[N];

void init(void) {
    cin >> n >> D;
    FOR(i, 1, n) cin >> a[i], compress.pb(a[i]);
    sort(all(compress));
    FORR(i, n, 1) { // a[i] =  a[j] but i < j is not considered
        int p = lower_bound(all(compress), a[i]) - compress.begin();
        used[p]++;
        a[i] = p + used[p];
        pos[a[i]] = i;
    }
}

void process(void) {
    set<int> obs;
    obs.insert(0); obs.insert(inf);
    FOR(i, 1, n) {
        auto it = obs.lower_bound(pos[i]);
        auto it2 = it; it2--;
        if (*it2 > 0) update(*it2, pos[i] - *it2);
        update(pos[i], *it - pos[i]);
        last[pos[i]] = walk(1, 1, n, pos[i], n, D);
        if (last[pos[i]] == -1) last[pos[i]] = n;
        obs.insert(pos[i]);
    }

    memset(node, 0, sizeof node);
    FOR(i, 1, n) {
        for(int x : del[i]) update(x, 0);
        maximize(f[i], getMax(1, 1, n, 1, a[i] - 1) + 1);
        update(a[i], f[i]);
        del[min(last[i] + D, n) + 1].pb(a[i]);
    }

    cout << *max_element(f + 1, f + n + 1);
}

int main() {
    ios_base::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);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:115:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         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