oj.uz

Submission #960391

# Submission time Handle Problem Language Result Execution time Memory
960391 2024-04-10T11:17:07 Z vjudge1 Financial Report (JOI21_financial) C++17
100 / 100
 301 ms 31384 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;
}

/// Ý tưởng: giả sử dãy ta tìm đc là k1, k2, k3, ... kx
/// --> đưa về bài toán tìm dãy con tăng dài nhất thỏa mãn giữa k(i) đến được k(i - 1) với i >= 2
/// tức giống kiểu xét tổng quát là với i, j,  để j đến đc i <=> tồn tại cách j nhảy độ dài <= K vào các
/// số < a[j] và đến được i.
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 6488 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 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 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 6492 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 6488 KB Output is correct
18 Correct 2 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 6492 KB Output is correct
23 Correct 1 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 6492 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 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 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 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 6492 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 6488 KB Output is correct
18 Correct 2 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 6492 KB Output is correct
23 Correct 1 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 6492 KB Output is correct
27 Correct 1 ms 6612 KB Output is correct
28 Correct 1 ms 6488 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6612 KB Output is correct
33 Correct 2 ms 6500 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6500 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 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 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 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 6492 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 6488 KB Output is correct
18 Correct 2 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 6492 KB Output is correct
23 Correct 1 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 6492 KB Output is correct
27 Correct 1 ms 6612 KB Output is correct
28 Correct 1 ms 6488 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6612 KB Output is correct
33 Correct 2 ms 6500 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6500 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 5 ms 6880 KB Output is correct
42 Correct 5 ms 6748 KB Output is correct
43 Correct 4 ms 6896 KB Output is correct
44 Correct 4 ms 6712 KB Output is correct
45 Correct 4 ms 6688 KB Output is correct
46 Correct 4 ms 6748 KB Output is correct
47 Correct 6 ms 6624 KB Output is correct
48 Correct 4 ms 6628 KB Output is correct
49 Correct 4 ms 6744 KB Output is correct
50 Correct 4 ms 6748 KB Output is correct
51 Correct 5 ms 6748 KB Output is correct
52 Correct 5 ms 6748 KB Output is correct
53 Correct 3 ms 6748 KB Output is correct
54 Correct 3 ms 6748 KB Output is correct
55 Correct 4 ms 6744 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 6748 KB Output is correct
60 Correct 3 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 113 ms 29324 KB Output is correct
2 Correct 181 ms 25300 KB Output is correct
3 Correct 259 ms 24404 KB Output is correct
4 Correct 279 ms 24492 KB Output is correct
5 Correct 221 ms 22352 KB Output is correct
6 Correct 301 ms 24404 KB Output is correct
7 Correct 110 ms 17364 KB Output is correct
8 Correct 154 ms 31384 KB Output is correct
9 Correct 127 ms 21212 KB Output is correct
10 Correct 139 ms 26192 KB Output is correct
11 Correct 223 ms 24284 KB Output is correct
12 Correct 224 ms 24320 KB Output is correct
13 Correct 207 ms 17492 KB Output is correct
14 Correct 275 ms 31284 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 15532 KB Output is correct
2 Correct 176 ms 17036 KB Output is correct
3 Correct 165 ms 17260 KB Output is correct
4 Correct 182 ms 17256 KB Output is correct
5 Correct 150 ms 17232 KB Output is correct
6 Correct 159 ms 17236 KB Output is correct
7 Correct 103 ms 17376 KB Output is correct
8 Correct 116 ms 17272 KB Output is correct
9 Correct 118 ms 17196 KB Output is correct
10 Correct 153 ms 17236 KB Output is correct
11 Correct 154 ms 17320 KB Output is correct
12 Correct 145 ms 17068 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 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 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6492 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 6492 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 6488 KB Output is correct
18 Correct 2 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 6492 KB Output is correct
23 Correct 1 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 6492 KB Output is correct
27 Correct 1 ms 6612 KB Output is correct
28 Correct 1 ms 6488 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 1 ms 6612 KB Output is correct
33 Correct 2 ms 6500 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 1 ms 6500 KB Output is correct
39 Correct 2 ms 6488 KB Output is correct
40 Correct 1 ms 6488 KB Output is correct
41 Correct 5 ms 6880 KB Output is correct
42 Correct 5 ms 6748 KB Output is correct
43 Correct 4 ms 6896 KB Output is correct
44 Correct 4 ms 6712 KB Output is correct
45 Correct 4 ms 6688 KB Output is correct
46 Correct 4 ms 6748 KB Output is correct
47 Correct 6 ms 6624 KB Output is correct
48 Correct 4 ms 6628 KB Output is correct
49 Correct 4 ms 6744 KB Output is correct
50 Correct 4 ms 6748 KB Output is correct
51 Correct 5 ms 6748 KB Output is correct
52 Correct 5 ms 6748 KB Output is correct
53 Correct 3 ms 6748 KB Output is correct
54 Correct 3 ms 6748 KB Output is correct
55 Correct 4 ms 6744 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 6748 KB Output is correct
60 Correct 3 ms 6748 KB Output is correct
61 Correct 3 ms 6748 KB Output is correct
62 Correct 113 ms 29324 KB Output is correct
63 Correct 181 ms 25300 KB Output is correct
64 Correct 259 ms 24404 KB Output is correct
65 Correct 279 ms 24492 KB Output is correct
66 Correct 221 ms 22352 KB Output is correct
67 Correct 301 ms 24404 KB Output is correct
68 Correct 110 ms 17364 KB Output is correct
69 Correct 154 ms 31384 KB Output is correct
70 Correct 127 ms 21212 KB Output is correct
71 Correct 139 ms 26192 KB Output is correct
72 Correct 223 ms 24284 KB Output is correct
73 Correct 224 ms 24320 KB Output is correct
74 Correct 207 ms 17492 KB Output is correct
75 Correct 275 ms 31284 KB Output is correct
76 Correct 68 ms 15532 KB Output is correct
77 Correct 176 ms 17036 KB Output is correct
78 Correct 165 ms 17260 KB Output is correct
79 Correct 182 ms 17256 KB Output is correct
80 Correct 150 ms 17232 KB Output is correct
81 Correct 159 ms 17236 KB Output is correct
82 Correct 103 ms 17376 KB Output is correct
83 Correct 116 ms 17272 KB Output is correct
84 Correct 118 ms 17196 KB Output is correct
85 Correct 153 ms 17236 KB Output is correct
86 Correct 154 ms 17320 KB Output is correct
87 Correct 145 ms 17068 KB Output is correct
88 Correct 246 ms 22132 KB Output is correct
89 Correct 223 ms 20996 KB Output is correct
90 Correct 249 ms 18836 KB Output is correct
91 Correct 176 ms 17512 KB Output is correct
92 Correct 182 ms 17936 KB Output is correct
93 Correct 166 ms 17208 KB Output is correct
94 Correct 164 ms 17432 KB Output is correct
95 Correct 214 ms 21156 KB Output is correct
96 Correct 220 ms 19204 KB Output is correct
97 Correct 183 ms 17776 KB Output is correct
98 Correct 189 ms 17488 KB Output is correct
99 Correct 162 ms 17236 KB Output is correct
100 Correct 177 ms 17452 KB Output is correct
101 Correct 142 ms 20084 KB Output is correct
102 Correct 141 ms 17552 KB Output is correct
103 Correct 133 ms 17164 KB Output is correct
104 Correct 140 ms 17228 KB Output is correct
105 Correct 153 ms 17360 KB Output is correct
106 Correct 175 ms 17864 KB Output is correct
107 Correct 177 ms 17412 KB Output is correct
108 Correct 172 ms 17232 KB Output is correct
109 Correct 178 ms 17432 KB Output is correct
110 Correct 176 ms 17584 KB Output is correct
111 Correct 162 ms 17704 KB Output is correct
112 Correct 144 ms 17488 KB Output is correct
113 Correct 160 ms 17428 KB Output is correct
114 Correct 160 ms 17232 KB Output is correct
115 Correct 106 ms 17236 KB Output is correct
116 Correct 126 ms 17088 KB Output is correct
117 Correct 142 ms 17248 KB Output is correct
118 Correct 125 ms 17012 KB Output is correct
119 Correct 141 ms 17324 KB Output is correct
120 Correct 139 ms 17124 KB Output is correct