oj.uz

Submission #833163

# Submission time Handle Problem Language Result Execution time Memory
833163 2023-08-22T02:38:41 Z maomao90 Financial Report (JOI21_financial) C++17
100 / 100
 1123 ms 27540 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 300005;

int n, d;
int a[MAXN];
vii dct;
int ans;

#define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
int ptr;
ii mn[MAXN * 4];
int lz[MAXN * 4], onc[MAXN * 4];
void propo(int u, int lo, int hi) {
    if (lz[u] == -1) {
        return;
    }
    MLR;
    mn[lc] = {onc[lc] == 0 ? INF : lz[u], lo};
    mn[rc] = {onc[rc] == 0 ? INF : lz[u], mid + 1};
    lz[lc] = lz[u];
    lz[rc] = lz[u];
    lz[u] = -1;
}
void init(int u = 1, int lo = 0, int hi = ptr) {
    lz[u] = -1;
    mn[u] = {INF, lo};
    if (lo != hi) {
        MLR;
        init(lc, lo, mid);
        init(rc, mid + 1, hi);
    }
}
void updt(int s, int e, int x, int u = 1, int lo = 0, int hi = ptr) {
    if (lo >= s && hi <= e) {
        mn[u] = {onc[u] == 0 ? INF : x, lo};
        lz[u] = x;
        return;
    }
    propo(u, lo, hi);
    MLR;
    if (s <= mid) {
        updt(s, e, x, lc, lo, mid);
    }
    if (e > mid) {
        updt(s, e, x, rc, mid + 1, hi);
    }
    mn[u] = min(mn[lc], mn[rc]);
}
void togglet(int p, int x, int u = 1, int lo = 0, int hi = ptr) {
    if (lo == hi) {
        mn[u] = {x, lo};
        onc[u] = x != INF;
        return;
    }
    propo(u, lo, hi);
    MLR;
    if (p <= mid) {
        togglet(p, x, lc, lo, mid);
    } else {
        togglet(p, x, rc, mid + 1, hi);
    }
    mn[u] = min(mn[lc], mn[rc]);
    onc[u] = onc[lc] + onc[rc];
}
int mx[MAXN * 4];
void updv(int p, int x, int u = 1, int lo = 0, int hi = ptr) {
    if (lo == hi) {
        mx[u] = x;
        return;
    }
    MLR;
    if (p <= mid) {
        updv(p, x, lc, lo, mid);
    } else {
        updv(p, x, rc, mid + 1, hi);
    }
    mx[u] = max(mx[lc], mx[rc]);
}
int qmx(int s, int e, int u = 1, int lo = 0, int hi = ptr) {
    if (lo >= s && hi <= e) {
        return mx[u];
    }
    int res = 0;
    MLR;
    if (s <= mid) {
        mxto(res, qmx(s, e, lc, lo, mid));
    }
    if (e > mid) {
        mxto(res, qmx(s, e, rc, mid + 1, hi));
    }
    return res;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> d;
    REP (i, 1, n + 1) {
        cin >> a[i];
        dct.pb({a[i], i});
    }
    sort(ALL(dct));
    int prv = -1; ptr = 0;
    for (auto [x, i] : dct) {
        if (x != prv) {
            ptr++;
            prv = x;
        }
        a[i] = ptr;
    }
    init();
    REP (i, 1, n + 1) {
        cerr << i << ' ' << a[i] << '\n';
        while (i - mn[1].FI > d) {
            int id = mn[1].SE;
            updv(id, 0);
            togglet(id, INF);
        }
        updt(a[i], ptr, i);
        int v = qmx(0, a[i] - 1) + 1;
        int pv = qmx(a[i], a[i]);
        cerr << ' ' << pv << ' ' << v << '\n';
        updv(a[i], max(pv, v));
        togglet(a[i], i);
        mxto(ans, mx[1]);
    }
    cout << ans << '\n';
    return 0;
}

Compilation message

Main.cpp: In function 'void propo(int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:53:5: note: in expansion of macro 'MLR'
   53 |     MLR;
      |     ^~~
Main.cpp: In function 'void init(int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:64:9: note: in expansion of macro 'MLR'
   64 |         MLR;
      |         ^~~
Main.cpp: In function 'void updt(int, int, int, int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:76:5: note: in expansion of macro 'MLR'
   76 |     MLR;
      |     ^~~
Main.cpp: In function 'void togglet(int, int, int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:92:5: note: in expansion of macro 'MLR'
   92 |     MLR;
      |     ^~~
Main.cpp: In function 'void updv(int, int, int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:107:5: note: in expansion of macro 'MLR'
  107 |     MLR;
      |     ^~~
Main.cpp: In function 'int qmx(int, int, int, int, int)':
Main.cpp:45:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 | #define MLR int mid = lo + hi >> 1, lc = u << 1, rc = u << 1 ^ 1
      |                       ~~~^~~~
Main.cpp:120:5: note: in expansion of macro 'MLR'
  120 |     MLR;
      |     ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 596 KB Output is correct
42 Correct 10 ms 872 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 5 ms 596 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 6 ms 852 KB Output is correct
47 Correct 8 ms 852 KB Output is correct
48 Correct 8 ms 852 KB Output is correct
49 Correct 7 ms 852 KB Output is correct
50 Correct 7 ms 852 KB Output is correct
51 Correct 8 ms 852 KB Output is correct
52 Correct 10 ms 852 KB Output is correct
53 Correct 6 ms 756 KB Output is correct
54 Correct 6 ms 856 KB Output is correct
55 Correct 6 ms 852 KB Output is correct
56 Correct 6 ms 852 KB Output is correct
57 Correct 6 ms 976 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 5 ms 852 KB Output is correct
61 Correct 6 ms 812 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5580 KB Output is correct
2 Correct 81 ms 5580 KB Output is correct
3 Correct 186 ms 5580 KB Output is correct
4 Correct 764 ms 17104 KB Output is correct
5 Correct 572 ms 27320 KB Output is correct
6 Correct 842 ms 27320 KB Output is correct
7 Correct 266 ms 27364 KB Output is correct
8 Correct 201 ms 27436 KB Output is correct
9 Correct 287 ms 27320 KB Output is correct
10 Correct 253 ms 27448 KB Output is correct
11 Correct 631 ms 27328 KB Output is correct
12 Correct 658 ms 27352 KB Output is correct
13 Correct 412 ms 27320 KB Output is correct
14 Correct 1123 ms 27320 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 5572 KB Output is correct
2 Correct 114 ms 5572 KB Output is correct
3 Correct 217 ms 5568 KB Output is correct
4 Correct 379 ms 24392 KB Output is correct
5 Correct 346 ms 24432 KB Output is correct
6 Correct 397 ms 24516 KB Output is correct
7 Correct 214 ms 24456 KB Output is correct
8 Correct 225 ms 24440 KB Output is correct
9 Correct 249 ms 24456 KB Output is correct
10 Correct 317 ms 24460 KB Output is correct
11 Correct 397 ms 24576 KB Output is correct
12 Correct 326 ms 24536 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 360 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 596 KB Output is correct
42 Correct 10 ms 872 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 5 ms 596 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 6 ms 852 KB Output is correct
47 Correct 8 ms 852 KB Output is correct
48 Correct 8 ms 852 KB Output is correct
49 Correct 7 ms 852 KB Output is correct
50 Correct 7 ms 852 KB Output is correct
51 Correct 8 ms 852 KB Output is correct
52 Correct 10 ms 852 KB Output is correct
53 Correct 6 ms 756 KB Output is correct
54 Correct 6 ms 856 KB Output is correct
55 Correct 6 ms 852 KB Output is correct
56 Correct 6 ms 852 KB Output is correct
57 Correct 6 ms 976 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 5 ms 852 KB Output is correct
61 Correct 6 ms 812 KB Output is correct
62 Correct 40 ms 5580 KB Output is correct
63 Correct 81 ms 5580 KB Output is correct
64 Correct 186 ms 5580 KB Output is correct
65 Correct 764 ms 17104 KB Output is correct
66 Correct 572 ms 27320 KB Output is correct
67 Correct 842 ms 27320 KB Output is correct
68 Correct 266 ms 27364 KB Output is correct
69 Correct 201 ms 27436 KB Output is correct
70 Correct 287 ms 27320 KB Output is correct
71 Correct 253 ms 27448 KB Output is correct
72 Correct 631 ms 27328 KB Output is correct
73 Correct 658 ms 27352 KB Output is correct
74 Correct 412 ms 27320 KB Output is correct
75 Correct 1123 ms 27320 KB Output is correct
76 Correct 44 ms 5572 KB Output is correct
77 Correct 114 ms 5572 KB Output is correct
78 Correct 217 ms 5568 KB Output is correct
79 Correct 379 ms 24392 KB Output is correct
80 Correct 346 ms 24432 KB Output is correct
81 Correct 397 ms 24516 KB Output is correct
82 Correct 214 ms 24456 KB Output is correct
83 Correct 225 ms 24440 KB Output is correct
84 Correct 249 ms 24456 KB Output is correct
85 Correct 317 ms 24460 KB Output is correct
86 Correct 397 ms 24576 KB Output is correct
87 Correct 326 ms 24536 KB Output is correct
88 Correct 330 ms 8172 KB Output is correct
89 Correct 904 ms 27352 KB Output is correct
90 Correct 459 ms 9448 KB Output is correct
91 Correct 389 ms 27316 KB Output is correct
92 Correct 102 ms 8264 KB Output is correct
93 Correct 217 ms 8184 KB Output is correct
94 Correct 398 ms 17136 KB Output is correct
95 Correct 751 ms 27416 KB Output is correct
96 Correct 645 ms 27368 KB Output is correct
97 Correct 615 ms 27320 KB Output is correct
98 Correct 434 ms 27376 KB Output is correct
99 Correct 396 ms 27364 KB Output is correct
100 Correct 386 ms 27416 KB Output is correct
101 Correct 311 ms 27336 KB Output is correct
102 Correct 361 ms 27376 KB Output is correct
103 Correct 401 ms 27352 KB Output is correct
104 Correct 365 ms 27368 KB Output is correct
105 Correct 389 ms 27396 KB Output is correct
106 Correct 303 ms 27352 KB Output is correct
107 Correct 330 ms 27400 KB Output is correct
108 Correct 362 ms 27500 KB Output is correct
109 Correct 407 ms 27428 KB Output is correct
110 Correct 437 ms 27380 KB Output is correct
111 Correct 384 ms 27392 KB Output is correct
112 Correct 303 ms 27540 KB Output is correct
113 Correct 358 ms 27404 KB Output is correct
114 Correct 433 ms 27376 KB Output is correct
115 Correct 211 ms 27408 KB Output is correct
116 Correct 204 ms 27332 KB Output is correct
117 Correct 235 ms 27428 KB Output is correct
118 Correct 231 ms 27320 KB Output is correct
119 Correct 293 ms 27440 KB Output is correct
120 Correct 291 ms 27364 KB Output is correct