Submission #771047

# Submission time Handle Problem Language Result Execution time Memory
771047 2023-07-02T11:41:10 Z SamAnd Financial Report (JOI21_financial) C++17
100 / 100
428 ms 28580 KB
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 300005;

int n, d;
int a[N];

int p[N];
int l[N], r[N];
int fi(int x)
{
    if (x == p[x])
        return x;
    return p[x] = fi(p[x]);
}

void kpc(int x, int y)
{
    if (abs(x - y) > d)
        return;
    x = fi(x);
    y = fi(y);
    p[x] = y;
    l[y] = min(l[y], l[x]);
    r[y] = max(r[y], r[x]);
}

int maxu[N * 4];
void ubd(int tl, int tr, int x, int y, int pos)
{
    if (tl == tr)
    {
        maxu[pos] = max(maxu[pos], y);
        return;
    }
    int m = (tl + tr) / 2;
    if (x <= m)
        ubd(tl, m, x, y, pos * 2);
    else
        ubd(m + 1, tr, x, y, pos * 2 + 1);
    maxu[pos] = max(maxu[pos * 2], maxu[pos * 2 + 1]);
}

int qry(int tl, int tr, int l, int r, int pos)
{
    if (l > r)
        return 0;
    if (tl == l && tr == r)
        return maxu[pos];
    int m = (tl + tr) / 2;
    return max(qry(tl, m, l, min(m, r), pos * 2),
               qry(m + 1, tr, max(m + 1, l), r, pos * 2 + 1));
}

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

    vector<pair<int, int> > v;
    for (int i = 1; i <= n; ++i)
        v.push_back(m_p(a[i], -i));
    sort(all(v));

    for (int i = 1; i <= n; ++i)
    {
        l[i] = r[i] = i;
        p[i] = i;
    }

    set<int> s;
    for (int i = 0; i < n; ++i)
    {
        v[i].se *= -1;
        s.insert(v[i].se);
        auto it = s.find(v[i].se);
        if (it != s.begin())
        {
            --it;
            kpc(v[i].se, *it);
            ++it;
        }
        if (it != (--s.end()))
        {
            ++it;
            kpc(v[i].se, *it);
            --it;
        }
        int u = l[fi(v[i].se)];

        int dp = qry(1, n, u, v[i].se, 1) + 1;
        ubd(1, n, v[i].se, dp, 1);
    }

    cout << maxu[1] << "\n";
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    ios_base::sync_with_stdio(false), cin.tie(0);

    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solv();
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
13 Correct 0 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 0 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 0 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 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
13 Correct 0 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 0 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 0 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 0 ms 340 KB Output is correct
26 Correct 0 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 0 ms 340 KB Output is correct
30 Correct 0 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 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
13 Correct 0 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 0 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 0 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 0 ms 340 KB Output is correct
26 Correct 0 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 0 ms 340 KB Output is correct
30 Correct 0 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 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 852 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 4 ms 836 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 4 ms 852 KB Output is correct
46 Correct 5 ms 852 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 5 ms 888 KB Output is correct
50 Correct 5 ms 896 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 816 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 5 ms 852 KB Output is correct
56 Correct 4 ms 852 KB Output is correct
57 Correct 4 ms 852 KB Output is correct
58 Correct 4 ms 876 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 4 ms 852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 175 ms 25472 KB Output is correct
2 Correct 194 ms 25508 KB Output is correct
3 Correct 316 ms 25516 KB Output is correct
4 Correct 394 ms 25468 KB Output is correct
5 Correct 271 ms 25484 KB Output is correct
6 Correct 319 ms 25564 KB Output is correct
7 Correct 184 ms 25388 KB Output is correct
8 Correct 166 ms 25508 KB Output is correct
9 Correct 155 ms 25496 KB Output is correct
10 Correct 167 ms 25492 KB Output is correct
11 Correct 273 ms 25448 KB Output is correct
12 Correct 254 ms 25536 KB Output is correct
13 Correct 347 ms 25472 KB Output is correct
14 Correct 354 ms 25544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 176 ms 25564 KB Output is correct
2 Correct 281 ms 25632 KB Output is correct
3 Correct 405 ms 25512 KB Output is correct
4 Correct 341 ms 25476 KB Output is correct
5 Correct 326 ms 25528 KB Output is correct
6 Correct 411 ms 25560 KB Output is correct
7 Correct 170 ms 25480 KB Output is correct
8 Correct 169 ms 25508 KB Output is correct
9 Correct 164 ms 25400 KB Output is correct
10 Correct 261 ms 25448 KB Output is correct
11 Correct 304 ms 25492 KB Output is correct
12 Correct 354 ms 25496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
13 Correct 0 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 0 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 0 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 0 ms 340 KB Output is correct
26 Correct 0 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 0 ms 340 KB Output is correct
30 Correct 0 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 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 852 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 4 ms 836 KB Output is correct
44 Correct 5 ms 852 KB Output is correct
45 Correct 4 ms 852 KB Output is correct
46 Correct 5 ms 852 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 4 ms 852 KB Output is correct
49 Correct 5 ms 888 KB Output is correct
50 Correct 5 ms 896 KB Output is correct
51 Correct 4 ms 852 KB Output is correct
52 Correct 5 ms 816 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 4 ms 852 KB Output is correct
55 Correct 5 ms 852 KB Output is correct
56 Correct 4 ms 852 KB Output is correct
57 Correct 4 ms 852 KB Output is correct
58 Correct 4 ms 876 KB Output is correct
59 Correct 4 ms 852 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 4 ms 852 KB Output is correct
62 Correct 175 ms 25472 KB Output is correct
63 Correct 194 ms 25508 KB Output is correct
64 Correct 316 ms 25516 KB Output is correct
65 Correct 394 ms 25468 KB Output is correct
66 Correct 271 ms 25484 KB Output is correct
67 Correct 319 ms 25564 KB Output is correct
68 Correct 184 ms 25388 KB Output is correct
69 Correct 166 ms 25508 KB Output is correct
70 Correct 155 ms 25496 KB Output is correct
71 Correct 167 ms 25492 KB Output is correct
72 Correct 273 ms 25448 KB Output is correct
73 Correct 254 ms 25536 KB Output is correct
74 Correct 347 ms 25472 KB Output is correct
75 Correct 354 ms 25544 KB Output is correct
76 Correct 176 ms 25564 KB Output is correct
77 Correct 281 ms 25632 KB Output is correct
78 Correct 405 ms 25512 KB Output is correct
79 Correct 341 ms 25476 KB Output is correct
80 Correct 326 ms 25528 KB Output is correct
81 Correct 411 ms 25560 KB Output is correct
82 Correct 170 ms 25480 KB Output is correct
83 Correct 169 ms 25508 KB Output is correct
84 Correct 164 ms 25400 KB Output is correct
85 Correct 261 ms 25448 KB Output is correct
86 Correct 304 ms 25492 KB Output is correct
87 Correct 354 ms 25496 KB Output is correct
88 Correct 349 ms 28424 KB Output is correct
89 Correct 400 ms 28400 KB Output is correct
90 Correct 393 ms 28448 KB Output is correct
91 Correct 413 ms 28520 KB Output is correct
92 Correct 261 ms 28468 KB Output is correct
93 Correct 345 ms 28428 KB Output is correct
94 Correct 351 ms 28444 KB Output is correct
95 Correct 288 ms 28384 KB Output is correct
96 Correct 342 ms 28416 KB Output is correct
97 Correct 325 ms 28392 KB Output is correct
98 Correct 384 ms 28580 KB Output is correct
99 Correct 428 ms 28356 KB Output is correct
100 Correct 346 ms 28472 KB Output is correct
101 Correct 160 ms 28392 KB Output is correct
102 Correct 175 ms 28364 KB Output is correct
103 Correct 189 ms 28356 KB Output is correct
104 Correct 224 ms 28344 KB Output is correct
105 Correct 246 ms 28436 KB Output is correct
106 Correct 234 ms 28428 KB Output is correct
107 Correct 265 ms 28352 KB Output is correct
108 Correct 348 ms 28488 KB Output is correct
109 Correct 246 ms 28412 KB Output is correct
110 Correct 385 ms 28472 KB Output is correct
111 Correct 368 ms 28432 KB Output is correct
112 Correct 224 ms 28380 KB Output is correct
113 Correct 359 ms 28456 KB Output is correct
114 Correct 354 ms 28408 KB Output is correct
115 Correct 178 ms 28464 KB Output is correct
116 Correct 188 ms 28432 KB Output is correct
117 Correct 220 ms 28396 KB Output is correct
118 Correct 268 ms 28448 KB Output is correct
119 Correct 229 ms 28416 KB Output is correct
120 Correct 228 ms 28348 KB Output is correct