oj.uz

Submission #960389

# Submission time Handle Problem Language Result Execution time Memory
960389 2024-04-10T11:11:46 Z Yang8on Financial Report (JOI21_financial) C++14
100 / 100
 312 ms 31312 KB 
#include <bits/stdc++.h>
#define Y8o "Financial Report"
#define maxn 300005
#define ll long long
#define pii pair<int, int>
#define gb(i, j) ((i >> j) & 1)

using namespace std;

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);
}
void iof()
{
    if(fopen(Y8o".inp", "r"))
    {
        freopen(Y8o".inp", "r", stdin);
//        freopen(Y8o".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
}
void ctime()
{
    cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}


int n, D;
int a[maxn], lef[maxn], dp[maxn];
pii b[maxn];
set<int> s;

/// dsu
int root[maxn], sz[maxn], mx[maxn];
int get(int x)
{
    return x == root[x] ? x : root[x] = get(root[x]);
}
void uni(int u, int v)
{
    int p = get(u), q = get(v);
    if(p != q)
    {
        if(sz[p] < sz[q]) swap(p, q);
        root[q] = p, sz[p] += sz[q], mx[p] = max(mx[p], mx[q]);
    }
}

void prepare()
{
    sort(b + 1, b + n + 1, [](pii x, pii y) { return x.first == y.first ? x.second < y.second : x.first > y.first; });

    for(int i = 1; i <= n; i ++)
    {
        int val = b[i].first, pos = b[i].second;

        if(!s.size()) lef[pos] = 1;
        else
        {
            auto it = s.lower_bound(pos);
            if(it == s.begin()) lef[pos] = 1;
            else
            {
                it --;
                lef[pos] = *it + 1;
            }
        }

        if(pos >= 2 && a[pos - 1] >= a[pos]) uni(pos, pos - 1);
        if(pos < n && a[pos] < a[pos + 1]) uni(pos, pos + 1);

        int p = get(pos);
        if(sz[p] >= D) s.insert(mx[p]);
    }
}

int st[4 * maxn];
void update(int i, int val, int id = 1, int l = 1, int r = n)
{
    if(i < l || r < i) return ;
    if(l == r) { st[id] = val; return; }

    int mid = (l + r) >> 1;
    update(i, val, id * 2, l, mid), update(i, val, id * 2 + 1, mid + 1, r);

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

void solve()
{
    cin >> n >> D;
    for(int i = 1; i <= n; i ++) cin >> a[i], b[i] = { a[i], i };
    for(int i = 1; i <= n; i ++) root[i] = i, sz[i] = 1, mx[i] = i;

    prepare();

    sort(b + 1, b + n + 1);
    vector<int> store;

    for(int i = 1; i <= n; i ++)
    {
        int val = b[i].first, pos = b[i].second;
        if(store.size() && val != a[ store.back() ])
        {
            for(int x : store) update(x, dp[x]);
            store.clear();
        }

        dp[pos] = lef[pos] <= pos - 1 ? get2(lef[pos], pos - 1) + 1 : 1;
        store.push_back(pos);
    }

    int ans = 0;
    for(int i = 1; i <= n; i ++) ans = max(ans, dp[i]);

    cout << ans;
}


int main()
{
    iof();

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

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

    ctime();
    return 0;
}

Compilation message

Main.cpp: In function 'void prepare()':
Main.cpp:58:13: warning: unused variable 'val' [-Wunused-variable]
   58 |         int val = b[i].first, pos = b[i].second;
      |             ^~~
Main.cpp: In function 'void iof()':
Main.cpp:19:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         freopen(Y8o".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6620 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6516 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6496 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6500 KB Output is correct
39 Correct 1 ms 6620 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 5 ms 6948 KB Output is correct
42 Correct 4 ms 6748 KB Output is correct
43 Correct 4 ms 6888 KB Output is correct
44 Correct 5 ms 6748 KB Output is correct
45 Correct 4 ms 6748 KB Output is correct
46 Correct 4 ms 7000 KB Output is correct
47 Correct 4 ms 6748 KB Output is correct
48 Correct 4 ms 6744 KB Output is correct
49 Correct 4 ms 6748 KB Output is correct
50 Correct 4 ms 6748 KB Output is correct
51 Correct 4 ms 6744 KB Output is correct
52 Correct 4 ms 6748 KB Output is correct
53 Correct 4 ms 6748 KB Output is correct
54 Correct 3 ms 6744 KB Output is correct
55 Correct 4 ms 6748 KB Output is correct
56 Correct 4 ms 6748 KB Output is correct
57 Correct 4 ms 6748 KB Output is correct
58 Correct 3 ms 6748 KB Output is correct
59 Correct 3 ms 6628 KB Output is correct
60 Correct 4 ms 6748 KB Output is correct
61 Correct 3 ms 6748 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 29440 KB Output is correct
2 Correct 189 ms 25360 KB Output is correct
3 Correct 227 ms 24400 KB Output is correct
4 Correct 259 ms 24404 KB Output is correct
5 Correct 220 ms 22476 KB Output is correct
6 Correct 312 ms 24248 KB Output is correct
7 Correct 104 ms 17300 KB Output is correct
8 Correct 157 ms 31312 KB Output is correct
9 Correct 126 ms 21328 KB Output is correct
10 Correct 140 ms 26196 KB Output is correct
11 Correct 214 ms 24404 KB Output is correct
12 Correct 241 ms 24424 KB Output is correct
13 Correct 190 ms 17268 KB Output is correct
14 Correct 264 ms 31284 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 15620 KB Output is correct
2 Correct 169 ms 17252 KB Output is correct
3 Correct 177 ms 17232 KB Output is correct
4 Correct 158 ms 17264 KB Output is correct
5 Correct 157 ms 17236 KB Output is correct
6 Correct 161 ms 17232 KB Output is correct
7 Correct 106 ms 17252 KB Output is correct
8 Correct 107 ms 17096 KB Output is correct
9 Correct 121 ms 17540 KB Output is correct
10 Correct 143 ms 17212 KB Output is correct
11 Correct 157 ms 17428 KB Output is correct
12 Correct 160 ms 17256 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6488 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6620 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 1 ms 6516 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6496 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 1 ms 6488 KB Output is correct
36 Correct 1 ms 6488 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6500 KB Output is correct
39 Correct 1 ms 6620 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 5 ms 6948 KB Output is correct
42 Correct 4 ms 6748 KB Output is correct
43 Correct 4 ms 6888 KB Output is correct
44 Correct 5 ms 6748 KB Output is correct
45 Correct 4 ms 6748 KB Output is correct
46 Correct 4 ms 7000 KB Output is correct
47 Correct 4 ms 6748 KB Output is correct
48 Correct 4 ms 6744 KB Output is correct
49 Correct 4 ms 6748 KB Output is correct
50 Correct 4 ms 6748 KB Output is correct
51 Correct 4 ms 6744 KB Output is correct
52 Correct 4 ms 6748 KB Output is correct
53 Correct 4 ms 6748 KB Output is correct
54 Correct 3 ms 6744 KB Output is correct
55 Correct 4 ms 6748 KB Output is correct
56 Correct 4 ms 6748 KB Output is correct
57 Correct 4 ms 6748 KB Output is correct
58 Correct 3 ms 6748 KB Output is correct
59 Correct 3 ms 6628 KB Output is correct
60 Correct 4 ms 6748 KB Output is correct
61 Correct 3 ms 6748 KB Output is correct
62 Correct 120 ms 29440 KB Output is correct
63 Correct 189 ms 25360 KB Output is correct
64 Correct 227 ms 24400 KB Output is correct
65 Correct 259 ms 24404 KB Output is correct
66 Correct 220 ms 22476 KB Output is correct
67 Correct 312 ms 24248 KB Output is correct
68 Correct 104 ms 17300 KB Output is correct
69 Correct 157 ms 31312 KB Output is correct
70 Correct 126 ms 21328 KB Output is correct
71 Correct 140 ms 26196 KB Output is correct
72 Correct 214 ms 24404 KB Output is correct
73 Correct 241 ms 24424 KB Output is correct
74 Correct 190 ms 17268 KB Output is correct
75 Correct 264 ms 31284 KB Output is correct
76 Correct 70 ms 15620 KB Output is correct
77 Correct 169 ms 17252 KB Output is correct
78 Correct 177 ms 17232 KB Output is correct
79 Correct 158 ms 17264 KB Output is correct
80 Correct 157 ms 17236 KB Output is correct
81 Correct 161 ms 17232 KB Output is correct
82 Correct 106 ms 17252 KB Output is correct
83 Correct 107 ms 17096 KB Output is correct
84 Correct 121 ms 17540 KB Output is correct
85 Correct 143 ms 17212 KB Output is correct
86 Correct 157 ms 17428 KB Output is correct
87 Correct 160 ms 17256 KB Output is correct
88 Correct 237 ms 22100 KB Output is correct
89 Correct 244 ms 20952 KB Output is correct
90 Correct 203 ms 18612 KB Output is correct
91 Correct 181 ms 17588 KB Output is correct
92 Correct 163 ms 17940 KB Output is correct
93 Correct 167 ms 17416 KB Output is correct
94 Correct 168 ms 17232 KB Output is correct
95 Correct 207 ms 21148 KB Output is correct
96 Correct 204 ms 18768 KB Output is correct
97 Correct 181 ms 17748 KB Output is correct
98 Correct 184 ms 17744 KB Output is correct
99 Correct 171 ms 17452 KB Output is correct
100 Correct 164 ms 17232 KB Output is correct
101 Correct 134 ms 20256 KB Output is correct
102 Correct 128 ms 17312 KB Output is correct
103 Correct 131 ms 17080 KB Output is correct
104 Correct 139 ms 17216 KB Output is correct
105 Correct 152 ms 17228 KB Output is correct
106 Correct 182 ms 17588 KB Output is correct
107 Correct 197 ms 17616 KB Output is correct
108 Correct 167 ms 17420 KB Output is correct
109 Correct 178 ms 17240 KB Output is correct
110 Correct 170 ms 17648 KB Output is correct
111 Correct 165 ms 17700 KB Output is correct
112 Correct 140 ms 17432 KB Output is correct
113 Correct 175 ms 17428 KB Output is correct
114 Correct 165 ms 17488 KB Output is correct
115 Correct 107 ms 17232 KB Output is correct
116 Correct 109 ms 17016 KB Output is correct
117 Correct 126 ms 17080 KB Output is correct
118 Correct 125 ms 17076 KB Output is correct
119 Correct 137 ms 17452 KB Output is correct
120 Correct 142 ms 17252 KB Output is correct