oj.uz

답안 #970962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970962 2024-04-27T16:05:22 Z underwaterkillerwhale Financial Report (JOI21_financial) C++17
100 / 100
 639 ms 35688 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 3e5 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const int INF = 2e9 + 7;
const int BASE = 137;

int n, D;
int a[N], BoundR[N];
pair<int,int> b[N];
int dp[N];

struct Segment_tree {
    int Range;
    int st[N << 2], lz[N << 2];

    void init (int n) {
        Range = n;
    }

    void down (int id) {
        rep (i, id << 1, id << 1 | 1) {
            lz[i] = max(lz[id], lz[i]);
            st[i] = max(lz[id], st[i]);
        }
        lz[id] = 0;
    }

    void update_Val (int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            st[id] = max(st[id], val);
            lz[id] = max(lz[id], val);
            return;
        }
        int mid = l + r >> 1;
        down(id);
        update_Val (id << 1, l, mid, u, v, val);
        update_Val (id << 1 | 1, mid + 1, r, u, v, val);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }

    int get_Val (int id, int l, int r, int pos) {
        if (l > pos || r < pos) return 0;
        if (l == r) return st[id];
        int mid = l + r >> 1;
        down(id);
        return max (get_Val(id << 1, l, mid, pos),
                    get_Val (id << 1 | 1 , mid + 1, r, pos) );
    }

    void update_Val (int u, int v, int val) {
        update_Val (1, 1, Range, u, v, val);
    }
    int get_Val (int pos) {
        return get_Val (1, 1, Range, pos);
    }
}ST;

struct DSU {
    int Range;
    int lab[N], sz[N], mx[N];

    void init (int n) {
        rep (i, 1, n) lab[i] = i, sz[i] = 1, mx[i] = i;
    }
    int Find (int u) {
        if (lab[u] == u) return u;
        return lab[u] = Find(lab[u]);
    }
    void Join (int u, int v) {
        u = Find(u);
        v = Find(v);
        if (u == v) return;
        if (sz[u] < sz[v]) swap (u, v);
        lab[v] = u;
        sz[u] += sz[v];
        mx[u] = max(mx[u], mx[v]);
    }
}DSU;

void solution () {
    cin >> n >> D;
    rep (i, 1, n) {
        cin >> a[i];
    }
    rep (i, 1, n) b[i] = {a[i], i};
    sort (b + 1, b + 1 + n);
    ST.init(n);
    DSU.init(n);
    set<int> S;
    b[n + 1].fs = -1;
    rep (i, 1, n) {
        if (b[i].fs != b[i - 1].fs) {
            int neo = i;
            while (neo < n && b[neo].fs == b[neo + 1].fs) ++neo;
            rep (j, i, neo) {
                S.insert(b[j].se);
                auto it = S.lower_bound(b[j].se);
                if (it != S.begin()) {
                    if (*it - *prev(it) <= D) {
                        DSU.Join(*it, *prev(it));
                    }
                }
                if (next(it) != S.end()) {
                    if (*next(it) - *it <= D) {
                        DSU.Join(*it, *next(it));
                    }
                }
            }
        }
        int pos = b[i].se;
        dp[pos] = ST.get_Val (pos);
        BoundR[pos] = min(n, DSU.mx[DSU.Find(pos)] + D);
        ST.update_Val (pos, BoundR[pos], dp[pos]);
        if (b[i].fs != b[i + 1].fs) {
            int neo = i;
            while (neo > 1 && b[neo].fs == b[neo - 1].fs) --neo;
            rep (j, neo, i) {
                int pos = b[j].se;
                dp[pos]++;
//                cout << pos <<" "<<dp[pos]<<" "<<BoundR[pos] <<"\n";
                ST.update_Val (pos, BoundR[pos], dp[pos]);
            }
        }
    }

    cout << *max_element (dp + 1, dp + 1 + n) <<"\n";

}

#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);

int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
14 3
74 17 88 80 70 24 66 29 24 63 84 36 72 43

*/

Compilation message

Main.cpp: In member function 'void Segment_tree::update_Val(int, int, int, int, int, int)':
Main.cpp:54:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   54 |         int mid = l + r >> 1;
      |                   ~~^~~
Main.cpp: In member function 'int Segment_tree::get_Val(int, int, int, int)':
Main.cpp:64:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   64 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10840 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 1 ms 10588 KB Output is correct
25 Correct 3 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10840 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 1 ms 10588 KB Output is correct
25 Correct 3 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10584 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10788 KB Output is correct
34 Correct 2 ms 10588 KB Output is correct
35 Correct 2 ms 10712 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 10588 KB Output is correct
39 Correct 2 ms 10588 KB Output is correct
40 Correct 2 ms 10588 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10840 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 1 ms 10588 KB Output is correct
25 Correct 3 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10584 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10788 KB Output is correct
34 Correct 2 ms 10588 KB Output is correct
35 Correct 2 ms 10712 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 10588 KB Output is correct
39 Correct 2 ms 10588 KB Output is correct
40 Correct 2 ms 10588 KB Output is correct
41 Correct 7 ms 11100 KB Output is correct
42 Correct 8 ms 11096 KB Output is correct
43 Correct 7 ms 11100 KB Output is correct
44 Correct 9 ms 11356 KB Output is correct
45 Correct 7 ms 10980 KB Output is correct
46 Correct 7 ms 11100 KB Output is correct
47 Correct 7 ms 11100 KB Output is correct
48 Correct 9 ms 11100 KB Output is correct
49 Correct 8 ms 11100 KB Output is correct
50 Correct 8 ms 11096 KB Output is correct
51 Correct 7 ms 11100 KB Output is correct
52 Correct 7 ms 11100 KB Output is correct
53 Correct 6 ms 11100 KB Output is correct
54 Correct 7 ms 11096 KB Output is correct
55 Correct 7 ms 11096 KB Output is correct
56 Correct 7 ms 11100 KB Output is correct
57 Correct 7 ms 11100 KB Output is correct
58 Correct 6 ms 11100 KB Output is correct
59 Correct 6 ms 11164 KB Output is correct
60 Correct 6 ms 11100 KB Output is correct
61 Correct 6 ms 11100 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 32376 KB Output is correct
2 Correct 261 ms 30548 KB Output is correct
3 Correct 387 ms 32340 KB Output is correct
4 Correct 514 ms 32640 KB Output is correct
5 Correct 371 ms 32340 KB Output is correct
6 Correct 544 ms 32580 KB Output is correct
7 Correct 281 ms 32292 KB Output is correct
8 Correct 243 ms 32340 KB Output is correct
9 Correct 235 ms 32340 KB Output is correct
10 Correct 245 ms 32668 KB Output is correct
11 Correct 336 ms 32472 KB Output is correct
12 Correct 356 ms 32592 KB Output is correct
13 Correct 377 ms 32360 KB Output is correct
14 Correct 514 ms 32588 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 32344 KB Output is correct
2 Correct 366 ms 32336 KB Output is correct
3 Correct 442 ms 32580 KB Output is correct
4 Correct 489 ms 32500 KB Output is correct
5 Correct 406 ms 32368 KB Output is correct
6 Correct 535 ms 32432 KB Output is correct
7 Correct 255 ms 32340 KB Output is correct
8 Correct 257 ms 32424 KB Output is correct
9 Correct 254 ms 32336 KB Output is correct
10 Correct 325 ms 32536 KB Output is correct
11 Correct 442 ms 32344 KB Output is correct
12 Correct 395 ms 32696 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10840 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10584 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 1 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 1 ms 10588 KB Output is correct
25 Correct 3 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10584 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 2 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 2 ms 10788 KB Output is correct
34 Correct 2 ms 10588 KB Output is correct
35 Correct 2 ms 10712 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 10588 KB Output is correct
39 Correct 2 ms 10588 KB Output is correct
40 Correct 2 ms 10588 KB Output is correct
41 Correct 7 ms 11100 KB Output is correct
42 Correct 8 ms 11096 KB Output is correct
43 Correct 7 ms 11100 KB Output is correct
44 Correct 9 ms 11356 KB Output is correct
45 Correct 7 ms 10980 KB Output is correct
46 Correct 7 ms 11100 KB Output is correct
47 Correct 7 ms 11100 KB Output is correct
48 Correct 9 ms 11100 KB Output is correct
49 Correct 8 ms 11100 KB Output is correct
50 Correct 8 ms 11096 KB Output is correct
51 Correct 7 ms 11100 KB Output is correct
52 Correct 7 ms 11100 KB Output is correct
53 Correct 6 ms 11100 KB Output is correct
54 Correct 7 ms 11096 KB Output is correct
55 Correct 7 ms 11096 KB Output is correct
56 Correct 7 ms 11100 KB Output is correct
57 Correct 7 ms 11100 KB Output is correct
58 Correct 6 ms 11100 KB Output is correct
59 Correct 6 ms 11164 KB Output is correct
60 Correct 6 ms 11100 KB Output is correct
61 Correct 6 ms 11100 KB Output is correct
62 Correct 251 ms 32376 KB Output is correct
63 Correct 261 ms 30548 KB Output is correct
64 Correct 387 ms 32340 KB Output is correct
65 Correct 514 ms 32640 KB Output is correct
66 Correct 371 ms 32340 KB Output is correct
67 Correct 544 ms 32580 KB Output is correct
68 Correct 281 ms 32292 KB Output is correct
69 Correct 243 ms 32340 KB Output is correct
70 Correct 235 ms 32340 KB Output is correct
71 Correct 245 ms 32668 KB Output is correct
72 Correct 336 ms 32472 KB Output is correct
73 Correct 356 ms 32592 KB Output is correct
74 Correct 377 ms 32360 KB Output is correct
75 Correct 514 ms 32588 KB Output is correct
76 Correct 250 ms 32344 KB Output is correct
77 Correct 366 ms 32336 KB Output is correct
78 Correct 442 ms 32580 KB Output is correct
79 Correct 489 ms 32500 KB Output is correct
80 Correct 406 ms 32368 KB Output is correct
81 Correct 535 ms 32432 KB Output is correct
82 Correct 255 ms 32340 KB Output is correct
83 Correct 257 ms 32424 KB Output is correct
84 Correct 254 ms 32336 KB Output is correct
85 Correct 325 ms 32536 KB Output is correct
86 Correct 442 ms 32344 KB Output is correct
87 Correct 395 ms 32696 KB Output is correct
88 Correct 500 ms 35476 KB Output is correct
89 Correct 499 ms 35268 KB Output is correct
90 Correct 546 ms 35336 KB Output is correct
91 Correct 610 ms 35492 KB Output is correct
92 Correct 370 ms 35400 KB Output is correct
93 Correct 516 ms 35372 KB Output is correct
94 Correct 500 ms 35480 KB Output is correct
95 Correct 459 ms 35496 KB Output is correct
96 Correct 562 ms 35488 KB Output is correct
97 Correct 639 ms 35448 KB Output is correct
98 Correct 620 ms 35496 KB Output is correct
99 Correct 487 ms 35292 KB Output is correct
100 Correct 503 ms 35504 KB Output is correct
101 Correct 248 ms 35408 KB Output is correct
102 Correct 291 ms 35664 KB Output is correct
103 Correct 321 ms 35380 KB Output is correct
104 Correct 360 ms 35320 KB Output is correct
105 Correct 403 ms 35320 KB Output is correct
106 Correct 302 ms 35428 KB Output is correct
107 Correct 326 ms 35448 KB Output is correct
108 Correct 419 ms 35452 KB Output is correct
109 Correct 341 ms 35376 KB Output is correct
110 Correct 487 ms 35688 KB Output is correct
111 Correct 478 ms 35488 KB Output is correct
112 Correct 326 ms 35276 KB Output is correct
113 Correct 454 ms 35388 KB Output is correct
114 Correct 510 ms 35488 KB Output is correct
115 Correct 255 ms 35320 KB Output is correct
116 Correct 264 ms 35524 KB Output is correct
117 Correct 306 ms 35492 KB Output is correct
118 Correct 314 ms 35400 KB Output is correct
119 Correct 319 ms 35408 KB Output is correct
120 Correct 331 ms 35412 KB Output is correct