oj.uz

Submission #516106

# Submission time Handle Problem Language Result Execution time Memory
516106 2022-01-20T11:37:56 Z goodluck2020 Financial Report (JOI21_financial) C++14
100 / 100
 427 ms 29676 KB 
#include <bits/stdc++.h>
#define task "JOI21_FINANCIAL"

using namespace std;
const int N = 3e5 + 5;
int n, A[N], D;
set < int > Set;
int CP[N], cnt;
void compress()
{
    for(int i = 1; i <= n; i++) Set.insert(A[i]);
    for(int j : Set) CP[++cnt] = j;
    for(int i = 1; i <= n; i++)
        A[i] = lower_bound(CP + 1, CP + cnt + 1, A[i]) - CP;
}
namespace sub2
{
    int dp[405][405], ans;
    void solve()
    {
        for(int i = 0; i <= n; i++)
        for(int j = 0; j <= n; j++) dp[i][j] = -1e9;
        dp[0][0] = 0;
        for(int i = 0; i < n; i++)
        {
            if(i)
            dp[i][A[i]] = max(dp[i][A[i]], 1);
            for(int j = 0; j <= n; j++)
                for(int t = i + 1; t <= i + D; t++)
                    if(t <= n)
                    dp[t][max(A[t], j)] = max(dp[t][max(A[t], j)], dp[i][j] + (A[t] > j));
        }
        for(int j = 0; j <= n; j++) ans = max(ans, dp[n][j]);
        cout << ans;
    }
}
namespace sub3
{
    int dp[7005], ans;
    void solve()
    {
        for(int i = 1; i <= n; i++)
        {
            dp[i] = 1;
            bool ok = true;
            int cnt = 0;
            for(int j = i - 1; j >= 1; j--)
            {
                if(ok && A[j] < A[i]) dp[i] = max(dp[i], dp[j] + 1);
                if(A[j] >= A[i]) cnt++;
                else cnt = 0;
                if(cnt >= D) ok = false;
            }
            ans = max(ans, dp[i]);
        }
        cout << ans;
    }
}
namespace sub4
{
    int L[N], St[N], top, ans;
    priority_queue < int > pq;
    void solve()
    {
        for(int i = 1; i <= n; i++)
        {
            while(top && A[i] > A[St[top]]) top--;
            L[i] = St[top] + 1;
            St[++top] = i;
        }
        for(int i = n; i >= 1; i--)
        {
            pq.push(L[i]);
            while(pq.top() > i) pq.pop();
            ans = max(ans, (int)pq.size());
        }
        cout << ans;
    }
}
namespace sub5
{
    int ans;
    struct FenwickTree
    {
        int BIT[N];
        int get(int p)
        {
            int res = 0;
            for( ; p ; p -= p & -p)
                res = max(res, BIT[p]);
            return res;
        }
        void update(int p, int val)
        {
            for( ; p <= 3e5; p += p & -p)
                BIT[p] = max(BIT[p], val);
        }
    } FT;
    void solve()
    {
        for(int i = 1; i <= n; i++)
        {
            int tmp = FT.get(A[i] - 1) + 1;
            FT.update(A[i], tmp);
            ans = max(ans, tmp);
        }
        cout << ans;
    }
}
namespace sub6
{
    int Min[N], R[N];
    void BuildMin()
    {
        stack < int > st;
        st.push(n+1);
        for(int i = n; i >= 1; i--)
        {
            while(st.size()>1 && A[st.top()]>A[i]) st.pop();
            R[i] = st.top() - 1;
            st.push(i);
        }
        int p = 1;
        for(int i = 1; i <= n - D + 1; i++)
        {
            int j = i + D - 1;
            while(!(i <= p && p <= j && R[p] >= j) && p<=n) p++;
            Min[i] = A[p];
        }
        ///Min[i] la GTNN trong doan [i; i + D - 1]
    }
    struct FenwickTree
    {
        int BIT[N];
        int get(int p)
        {
            int res = 0;
            for( ; p <= 3e5; p += p & -p)
                res = max(res, BIT[p]);
            return res;
        }
        void update(int p, int val)
        {
             for( ; p ; p -= p & -p)
                BIT[p] = max(BIT[p], val);
        }
    } FT;
    struct SegmentTree
    {
        int ST[4*N];
        int get(int id, int l, int r, int u, int v)
        {
            if(l > v || r < u) return 0;
            if(u <= l && r <= v) return ST[id];
            int mid = (l + r)/2;
            return max(get(id*2, l, mid, u, v), get(id*2+1, mid + 1, r, u, v));
        }
        void update(int id, int l, int r, int x, int val)
        {
            if(l > x || r < x) return;
            if(l == r)
            {
                ST[id] = max(ST[id], val);
                return;
            }
            int mid = (l + r)/2;
            update(id*2, l, mid, x, val);
            update(id*2 + 1, mid + 1, r, x, val);
            ST[id] = max(ST[id*2], ST[id*2 + 1]);
        }
    } IT;
    int leftmost[N], ans = 0, ord[N];
    void solve()
    {
        BuildMin();
        for(int i = 1; i <= n; i++)
        {
            leftmost[i] = FT.get(A[i]) + 1;
            ///True in [pos, i - 1]
            if(i >= D) FT.update(Min[i - D + 1], i - D + 1);
        }
        for(int i = 1; i <= n; i++) ord[i] = i;
        sort(ord + 1, ord + n + 1, [&] (int x, int y){
             if(A[x] == A[y]) return x > y; else return A[x] < A[y];
             });
        for(int j = 1; j <= n; j++)
        {
            int i = ord[j];
            int tmp = IT.get(1, 1, n, leftmost[i], i - 1) + 1;
            ans = max(ans, tmp);
            IT.update(1, 1, n, i, tmp);
        }
        cout << ans;
    }
}
int main()
{
    if(fopen(task ".inp","r"))
    {
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> D;
    for(int i = 1; i <= n; i++) cin >> A[i];
    compress();
    if(n <= 400) sub2::solve();
    else if(n <= 7000) sub3::solve();
    else if(D == 1) sub4::solve();
    else if(D == n) sub5::solve();
    else sub6::solve();
}

Compilation message

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

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 3 ms 972 KB Output is correct
29 Correct 5 ms 844 KB Output is correct
30 Correct 10 ms 972 KB Output is correct
31 Correct 46 ms 972 KB Output is correct
32 Correct 177 ms 988 KB Output is correct
33 Correct 2 ms 1004 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 25 ms 1008 KB Output is correct
37 Correct 4 ms 980 KB Output is correct
38 Correct 7 ms 992 KB Output is correct
39 Correct 13 ms 1008 KB Output is correct
40 Correct 19 ms 1008 KB Output is correct
41 Correct 76 ms 524 KB Output is correct
42 Correct 58 ms 784 KB Output is correct
43 Correct 38 ms 428 KB Output is correct
44 Correct 62 ms 592 KB Output is correct
45 Correct 81 ms 588 KB Output is correct
46 Correct 103 ms 784 KB Output is correct
47 Correct 49 ms 716 KB Output is correct
48 Correct 52 ms 784 KB Output is correct
49 Correct 53 ms 732 KB Output is correct
50 Correct 69 ms 804 KB Output is correct
51 Correct 32 ms 788 KB Output is correct
52 Correct 39 ms 800 KB Output is correct
53 Correct 43 ms 844 KB Output is correct
54 Correct 45 ms 792 KB Output is correct
55 Correct 77 ms 772 KB Output is correct
56 Correct 51 ms 780 KB Output is correct
57 Correct 58 ms 844 KB Output is correct
58 Correct 32 ms 804 KB Output is correct
59 Correct 33 ms 724 KB Output is correct
60 Correct 37 ms 796 KB Output is correct
61 Correct 37 ms 716 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6684 KB Output is correct
2 Correct 43 ms 5308 KB Output is correct
3 Correct 60 ms 5472 KB Output is correct
4 Correct 233 ms 18560 KB Output is correct
5 Correct 182 ms 20940 KB Output is correct
6 Correct 235 ms 20748 KB Output is correct
7 Correct 130 ms 22844 KB Output is correct
8 Correct 122 ms 21940 KB Output is correct
9 Correct 101 ms 21948 KB Output is correct
10 Correct 105 ms 21292 KB Output is correct
11 Correct 156 ms 20932 KB Output is correct
12 Correct 167 ms 20748 KB Output is correct
13 Correct 172 ms 20844 KB Output is correct
14 Correct 204 ms 20960 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 4752 KB Output is correct
2 Correct 61 ms 4376 KB Output is correct
3 Correct 77 ms 4616 KB Output is correct
4 Correct 281 ms 20780 KB Output is correct
5 Correct 196 ms 20700 KB Output is correct
6 Correct 239 ms 20868 KB Output is correct
7 Correct 138 ms 20804 KB Output is correct
8 Correct 123 ms 20792 KB Output is correct
9 Correct 115 ms 20652 KB Output is correct
10 Correct 150 ms 20704 KB Output is correct
11 Correct 245 ms 20796 KB Output is correct
12 Correct 183 ms 20812 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 2 ms 972 KB Output is correct
28 Correct 3 ms 972 KB Output is correct
29 Correct 5 ms 844 KB Output is correct
30 Correct 10 ms 972 KB Output is correct
31 Correct 46 ms 972 KB Output is correct
32 Correct 177 ms 988 KB Output is correct
33 Correct 2 ms 1004 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 25 ms 1008 KB Output is correct
37 Correct 4 ms 980 KB Output is correct
38 Correct 7 ms 992 KB Output is correct
39 Correct 13 ms 1008 KB Output is correct
40 Correct 19 ms 1008 KB Output is correct
41 Correct 76 ms 524 KB Output is correct
42 Correct 58 ms 784 KB Output is correct
43 Correct 38 ms 428 KB Output is correct
44 Correct 62 ms 592 KB Output is correct
45 Correct 81 ms 588 KB Output is correct
46 Correct 103 ms 784 KB Output is correct
47 Correct 49 ms 716 KB Output is correct
48 Correct 52 ms 784 KB Output is correct
49 Correct 53 ms 732 KB Output is correct
50 Correct 69 ms 804 KB Output is correct
51 Correct 32 ms 788 KB Output is correct
52 Correct 39 ms 800 KB Output is correct
53 Correct 43 ms 844 KB Output is correct
54 Correct 45 ms 792 KB Output is correct
55 Correct 77 ms 772 KB Output is correct
56 Correct 51 ms 780 KB Output is correct
57 Correct 58 ms 844 KB Output is correct
58 Correct 32 ms 804 KB Output is correct
59 Correct 33 ms 724 KB Output is correct
60 Correct 37 ms 796 KB Output is correct
61 Correct 37 ms 716 KB Output is correct
62 Correct 37 ms 6684 KB Output is correct
63 Correct 43 ms 5308 KB Output is correct
64 Correct 60 ms 5472 KB Output is correct
65 Correct 233 ms 18560 KB Output is correct
66 Correct 182 ms 20940 KB Output is correct
67 Correct 235 ms 20748 KB Output is correct
68 Correct 130 ms 22844 KB Output is correct
69 Correct 122 ms 21940 KB Output is correct
70 Correct 101 ms 21948 KB Output is correct
71 Correct 105 ms 21292 KB Output is correct
72 Correct 156 ms 20932 KB Output is correct
73 Correct 167 ms 20748 KB Output is correct
74 Correct 172 ms 20844 KB Output is correct
75 Correct 204 ms 20960 KB Output is correct
76 Correct 57 ms 4752 KB Output is correct
77 Correct 61 ms 4376 KB Output is correct
78 Correct 77 ms 4616 KB Output is correct
79 Correct 281 ms 20780 KB Output is correct
80 Correct 196 ms 20700 KB Output is correct
81 Correct 239 ms 20868 KB Output is correct
82 Correct 138 ms 20804 KB Output is correct
83 Correct 123 ms 20792 KB Output is correct
84 Correct 115 ms 20652 KB Output is correct
85 Correct 150 ms 20704 KB Output is correct
86 Correct 245 ms 20796 KB Output is correct
87 Correct 183 ms 20812 KB Output is correct
88 Correct 232 ms 13284 KB Output is correct
89 Correct 393 ms 29064 KB Output is correct
90 Correct 309 ms 15712 KB Output is correct
91 Correct 377 ms 28620 KB Output is correct
92 Correct 165 ms 13236 KB Output is correct
93 Correct 209 ms 13380 KB Output is correct
94 Correct 363 ms 23064 KB Output is correct
95 Correct 319 ms 29552 KB Output is correct
96 Correct 368 ms 29516 KB Output is correct
97 Correct 427 ms 29324 KB Output is correct
98 Correct 365 ms 28756 KB Output is correct
99 Correct 374 ms 28352 KB Output is correct
100 Correct 361 ms 28356 KB Output is correct
101 Correct 185 ms 29616 KB Output is correct
102 Correct 197 ms 29636 KB Output is correct
103 Correct 217 ms 29520 KB Output is correct
104 Correct 238 ms 29664 KB Output is correct
105 Correct 296 ms 28936 KB Output is correct
106 Correct 259 ms 29620 KB Output is correct
107 Correct 294 ms 29516 KB Output is correct
108 Correct 355 ms 28648 KB Output is correct
109 Correct 261 ms 29676 KB Output is correct
110 Correct 342 ms 28920 KB Output is correct
111 Correct 349 ms 28632 KB Output is correct
112 Correct 239 ms 28568 KB Output is correct
113 Correct 324 ms 28340 KB Output is correct
114 Correct 326 ms 28348 KB Output is correct
115 Correct 196 ms 28552 KB Output is correct
116 Correct 193 ms 28468 KB Output is correct
117 Correct 206 ms 28444 KB Output is correct
118 Correct 213 ms 28444 KB Output is correct
119 Correct 231 ms 28508 KB Output is correct
120 Correct 252 ms 28436 KB Output is correct