oj.uz

Submission #959855

# Submission time Handle Problem Language Result Execution time Memory
959855 2024-04-09T08:35:43 Z vjudge1 Financial Report (JOI21_financial) C++17
100 / 100
 472 ms 33360 KB 
#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end()
#define Neco "Financial Report"
#define resp(x) sort(all(x)), x.resize(unique(all(x)) - x.begin())
#define getbit(x,i) ((x >> i)&1)
#define _left id * 2, l, mid
#define _right id * 2 + 1, mid + 1, r
#define cntbit(x) __builtin_popcountll(x)
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define maxn (int) 3e5 + 7

using namespace std;

const ll mod = 1e9 + 7; //972663749
const ll base = 911382323;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll GetRandom(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

int n, D;
vector<int> Del[maxn];
int a[maxn], vt[maxn], dp[maxn];
pair<int, int> P[maxn];

struct DSU {
    int lab[maxn];
    int get_rt(int u) { return lab[u] <= 0 ? u : lab[u] = get_rt(lab[u]); }
    int siz(int u) { return -lab[get_rt(u)]; }
    void uni(int u, int v) {
        int p = get_rt(u), q = get_rt(v); if(p == q || !lab[p] || !lab[q]) return;
        if(lab[p] > lab[q]) swap(p, q);
        lab[p] += lab[q], lab[q] = p;
    }

    void Turn(int x) {
        lab[x] = -1;
        uni(x, x - 1), uni(x, x + 1);
    }
} Dsu;

struct IT {
    int st[4 * maxn], store[4 * maxn];

    void build(int id = 1, int l = 0, int r = n) {
        store[id] = st[id] = 0;
        if(l == r) return;
        int mid = (l + r) >> 1; build(_left), build(_right);
    }

    void down(int id) {
        int val = store[id];
        fi(i, 0, 1) st[id * 2 + i] += val, store[id * 2 + i] += val;
        store[id] = 0;
    }

    void update(int u, int v, int val, int id = 1, int l = 0, int r = n)
    {
        if(l > v || r < u) return;
        if(u <= l && r <= v) {
            st[id] += val, store[id] += val;
            return;
        }
        down(id);
        int mid = (l + r) >> 1;
        update(u, v, val, _left), update(u, v, val, _right);
        st[id] = max(st[id * 2], st[id * 2 + 1]);
    }

    int get(int u, int v, int id = 1, int l = 0, int r = n)
    {
        if(l > v || r < u) return 0;
        if(u <= l && r <= v) return st[id];
        down(id);
        int mid = (l + r) >> 1;
        return max(get(u, v, _left), get(u, v, _right));
    }

    int Find(int x, int val, int id = 1, int l = 0, int r = n)
    {
        if(r < x || st[id] < val) return -1;
        if(l == r) return l;

        down(id);
        int mid = (l + r) >> 1;
        int w = Find(x, val, _left);
        if(w == -1) w = Find(x, val, _right);
        return w;
    }
} St;

void Init() {
    St.build();
    vector<int> pen;

    auto update = [&](int x) {
        int pre_len = Dsu.siz(x - 1), nex_len = Dsu.siz(x + 1);
        St.update(x, x + nex_len, pre_len + 1);
        Dsu.Turn(x);
    };

    fid(i, n, 1) {
        if(pen.empty() || P[i].first != a[pen.back()]) {
            for(int x : pen) update(x);
            pen = {P[i].second};
        } else pen.push_back(P[i].second);

        int nex = St.Find(P[i].second, D);
        if(nex != -1) Del[nex + 1].push_back(P[i].second);
    }
}

void solve()
{

    cin >> n >> D;
    fi(i, 1, n) cin >> a[i], P[i] = {a[i], i};

    sort(P + 1, P + 1 + n);
    fi(i, 1, n) vt[P[i].second] = i;
    Init(), St.build();

    fi(i, 1, n) {
        for(int x : Del[i]) St.update(vt[x], vt[x], -dp[x]);

        pair<int, int> val = {a[i], -1e9};
        int p = lower_bound(P + 1, P + 1 + n, val) - P - 1;

        dp[i] = St.get(0, p) + 1;
        St.update(vt[i], vt[i], dp[i]);
    }

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


int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if(fopen(Neco".inp", "r")) {
        freopen(Neco".inp", "r", stdin);
        freopen(Neco".out", "w", stdout);
    }


    int nTest = 1;
//    cin >> nTest;


    while(nTest--)
    {
        solve();
    }


    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:152:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  152 |         freopen(Neco".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:153:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |         freopen(Neco".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15448 KB Output is correct
2 Correct 3 ms 15452 KB Output is correct
3 Correct 3 ms 15448 KB Output is correct
4 Correct 3 ms 15452 KB Output is correct
5 Correct 3 ms 15452 KB Output is correct
6 Correct 3 ms 15568 KB Output is correct
7 Correct 3 ms 15452 KB Output is correct
8 Correct 3 ms 15452 KB Output is correct
9 Correct 3 ms 15452 KB Output is correct
10 Correct 3 ms 15452 KB Output is correct
11 Correct 3 ms 15452 KB Output is correct
12 Correct 3 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 3 ms 15452 KB Output is correct
15 Correct 3 ms 15452 KB Output is correct
16 Correct 3 ms 15452 KB Output is correct
17 Correct 4 ms 15452 KB Output is correct
18 Correct 3 ms 15452 KB Output is correct
19 Correct 3 ms 15448 KB Output is correct
20 Correct 3 ms 15452 KB Output is correct
21 Correct 3 ms 15452 KB Output is correct
22 Correct 3 ms 15704 KB Output is correct
23 Correct 3 ms 15448 KB Output is correct
24 Correct 3 ms 15452 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 3 ms 15452 KB Output is correct
27 Correct 3 ms 15452 KB Output is correct
28 Correct 3 ms 15452 KB Output is correct
29 Correct 3 ms 15452 KB Output is correct
30 Correct 4 ms 15452 KB Output is correct
31 Correct 3 ms 15452 KB Output is correct
32 Correct 3 ms 15452 KB Output is correct
33 Correct 3 ms 15452 KB Output is correct
34 Correct 3 ms 15448 KB Output is correct
35 Correct 3 ms 15604 KB Output is correct
36 Correct 3 ms 15452 KB Output is correct
37 Correct 3 ms 15452 KB Output is correct
38 Correct 3 ms 15452 KB Output is correct
39 Correct 3 ms 15452 KB Output is correct
40 Correct 3 ms 15452 KB Output is correct
41 Correct 9 ms 15708 KB Output is correct
42 Correct 8 ms 15708 KB Output is correct
43 Correct 6 ms 15708 KB Output is correct
44 Correct 7 ms 15692 KB Output is correct
45 Correct 6 ms 15704 KB Output is correct
46 Correct 7 ms 15448 KB Output is correct
47 Correct 8 ms 15704 KB Output is correct
48 Correct 9 ms 15708 KB Output is correct
49 Correct 8 ms 15704 KB Output is correct
50 Correct 8 ms 15708 KB Output is correct
51 Correct 8 ms 15708 KB Output is correct
52 Correct 9 ms 15704 KB Output is correct
53 Correct 7 ms 15708 KB Output is correct
54 Correct 8 ms 15724 KB Output is correct
55 Correct 7 ms 15448 KB Output is correct
56 Correct 7 ms 15452 KB Output is correct
57 Correct 8 ms 15452 KB Output is correct
58 Correct 6 ms 15688 KB Output is correct
59 Correct 6 ms 15448 KB Output is correct
60 Correct 6 ms 15448 KB Output is correct
61 Correct 6 ms 15452 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 26064 KB Output is correct
2 Correct 243 ms 28116 KB Output is correct
3 Correct 341 ms 28616 KB Output is correct
4 Correct 472 ms 28608 KB Output is correct
5 Correct 349 ms 29812 KB Output is correct
6 Correct 454 ms 28788 KB Output is correct
7 Correct 226 ms 33104 KB Output is correct
8 Correct 185 ms 23916 KB Output is correct
9 Correct 236 ms 30680 KB Output is correct
10 Correct 207 ms 27344 KB Output is correct
11 Correct 341 ms 28780 KB Output is correct
12 Correct 354 ms 28752 KB Output is correct
13 Correct 390 ms 33360 KB Output is correct
14 Correct 356 ms 25556 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 26072 KB Output is correct
2 Correct 189 ms 23948 KB Output is correct
3 Correct 270 ms 24020 KB Output is correct
4 Correct 257 ms 23888 KB Output is correct
5 Correct 229 ms 23892 KB Output is correct
6 Correct 267 ms 23888 KB Output is correct
7 Correct 150 ms 23900 KB Output is correct
8 Correct 144 ms 23920 KB Output is correct
9 Correct 172 ms 23888 KB Output is correct
10 Correct 206 ms 23892 KB Output is correct
11 Correct 277 ms 23920 KB Output is correct
12 Correct 207 ms 23924 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15448 KB Output is correct
2 Correct 3 ms 15452 KB Output is correct
3 Correct 3 ms 15448 KB Output is correct
4 Correct 3 ms 15452 KB Output is correct
5 Correct 3 ms 15452 KB Output is correct
6 Correct 3 ms 15568 KB Output is correct
7 Correct 3 ms 15452 KB Output is correct
8 Correct 3 ms 15452 KB Output is correct
9 Correct 3 ms 15452 KB Output is correct
10 Correct 3 ms 15452 KB Output is correct
11 Correct 3 ms 15452 KB Output is correct
12 Correct 3 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 3 ms 15452 KB Output is correct
15 Correct 3 ms 15452 KB Output is correct
16 Correct 3 ms 15452 KB Output is correct
17 Correct 4 ms 15452 KB Output is correct
18 Correct 3 ms 15452 KB Output is correct
19 Correct 3 ms 15448 KB Output is correct
20 Correct 3 ms 15452 KB Output is correct
21 Correct 3 ms 15452 KB Output is correct
22 Correct 3 ms 15704 KB Output is correct
23 Correct 3 ms 15448 KB Output is correct
24 Correct 3 ms 15452 KB Output is correct
25 Correct 3 ms 15452 KB Output is correct
26 Correct 3 ms 15452 KB Output is correct
27 Correct 3 ms 15452 KB Output is correct
28 Correct 3 ms 15452 KB Output is correct
29 Correct 3 ms 15452 KB Output is correct
30 Correct 4 ms 15452 KB Output is correct
31 Correct 3 ms 15452 KB Output is correct
32 Correct 3 ms 15452 KB Output is correct
33 Correct 3 ms 15452 KB Output is correct
34 Correct 3 ms 15448 KB Output is correct
35 Correct 3 ms 15604 KB Output is correct
36 Correct 3 ms 15452 KB Output is correct
37 Correct 3 ms 15452 KB Output is correct
38 Correct 3 ms 15452 KB Output is correct
39 Correct 3 ms 15452 KB Output is correct
40 Correct 3 ms 15452 KB Output is correct
41 Correct 9 ms 15708 KB Output is correct
42 Correct 8 ms 15708 KB Output is correct
43 Correct 6 ms 15708 KB Output is correct
44 Correct 7 ms 15692 KB Output is correct
45 Correct 6 ms 15704 KB Output is correct
46 Correct 7 ms 15448 KB Output is correct
47 Correct 8 ms 15704 KB Output is correct
48 Correct 9 ms 15708 KB Output is correct
49 Correct 8 ms 15704 KB Output is correct
50 Correct 8 ms 15708 KB Output is correct
51 Correct 8 ms 15708 KB Output is correct
52 Correct 9 ms 15704 KB Output is correct
53 Correct 7 ms 15708 KB Output is correct
54 Correct 8 ms 15724 KB Output is correct
55 Correct 7 ms 15448 KB Output is correct
56 Correct 7 ms 15452 KB Output is correct
57 Correct 8 ms 15452 KB Output is correct
58 Correct 6 ms 15688 KB Output is correct
59 Correct 6 ms 15448 KB Output is correct
60 Correct 6 ms 15448 KB Output is correct
61 Correct 6 ms 15452 KB Output is correct
62 Correct 99 ms 26064 KB Output is correct
63 Correct 243 ms 28116 KB Output is correct
64 Correct 341 ms 28616 KB Output is correct
65 Correct 472 ms 28608 KB Output is correct
66 Correct 349 ms 29812 KB Output is correct
67 Correct 454 ms 28788 KB Output is correct
68 Correct 226 ms 33104 KB Output is correct
69 Correct 185 ms 23916 KB Output is correct
70 Correct 236 ms 30680 KB Output is correct
71 Correct 207 ms 27344 KB Output is correct
72 Correct 341 ms 28780 KB Output is correct
73 Correct 354 ms 28752 KB Output is correct
74 Correct 390 ms 33360 KB Output is correct
75 Correct 356 ms 25556 KB Output is correct
76 Correct 103 ms 26072 KB Output is correct
77 Correct 189 ms 23948 KB Output is correct
78 Correct 270 ms 24020 KB Output is correct
79 Correct 257 ms 23888 KB Output is correct
80 Correct 229 ms 23892 KB Output is correct
81 Correct 267 ms 23888 KB Output is correct
82 Correct 150 ms 23900 KB Output is correct
83 Correct 144 ms 23920 KB Output is correct
84 Correct 172 ms 23888 KB Output is correct
85 Correct 206 ms 23892 KB Output is correct
86 Correct 277 ms 23920 KB Output is correct
87 Correct 207 ms 23924 KB Output is correct
88 Correct 401 ms 27472 KB Output is correct
89 Correct 414 ms 26964 KB Output is correct
90 Correct 363 ms 25680 KB Output is correct
91 Correct 277 ms 24144 KB Output is correct
92 Correct 178 ms 24004 KB Output is correct
93 Correct 309 ms 24144 KB Output is correct
94 Correct 267 ms 23916 KB Output is correct
95 Correct 393 ms 28244 KB Output is correct
96 Correct 349 ms 26192 KB Output is correct
97 Correct 342 ms 25412 KB Output is correct
98 Correct 278 ms 24016 KB Output is correct
99 Correct 275 ms 23888 KB Output is correct
100 Correct 268 ms 23948 KB Output is correct
101 Correct 239 ms 28496 KB Output is correct
102 Correct 245 ms 26196 KB Output is correct
103 Correct 240 ms 25848 KB Output is correct
104 Correct 253 ms 25428 KB Output is correct
105 Correct 280 ms 25224 KB Output is correct
106 Correct 217 ms 23936 KB Output is correct
107 Correct 221 ms 23932 KB Output is correct
108 Correct 253 ms 24004 KB Output is correct
109 Correct 336 ms 33228 KB Output is correct
110 Correct 309 ms 25936 KB Output is correct
111 Correct 255 ms 24144 KB Output is correct
112 Correct 236 ms 25452 KB Output is correct
113 Correct 252 ms 23888 KB Output is correct
114 Correct 239 ms 23892 KB Output is correct
115 Correct 142 ms 23900 KB Output is correct
116 Correct 143 ms 23888 KB Output is correct
117 Correct 164 ms 23768 KB Output is correct
118 Correct 165 ms 23748 KB Output is correct
119 Correct 221 ms 24164 KB Output is correct
120 Correct 220 ms 23892 KB Output is correct