oj.uz

Submission #864267

# Submission time Handle Problem Language Result Execution time Memory
864267 2023-10-22T09:43:19 Z vjudge1 Financial Report (JOI21_financial) C++17
45 / 100
 110 ms 7080 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, d, i;
    cin >> n >> d;
    vector<int> v(n);
    for (i = 0; i < n; i++)
        cin >> v[i];
    if (n < 401)
    {
        int j, k, m = 0;
        vector<vector<int> > dp(n);
        for (i = 0; i < n; i++)
        {
            dp[i].resize(i + 1);
            for (j = 0; j <= i; j++)
            {
                dp[i][j] = 0;
                if (j)
                {
                    dp[i][j] = 1000000001;
                    for (k = i - 1; k >= 0 && k >= i - d; k--)
                    {
                        if (j - 1 <= k && dp[k][j - 1] < v[i])
                            dp[i][j] = min(dp[i][j], dp[k][j - 1]);
                        else if (j <= k)
                            dp[i][j] = min(dp[i][j], dp[k][j]);
                    }
                }
                dp[i][j] = max(dp[i][j], v[i]);
                if (i == n - 1 && dp[i][j] < 1000000001)
                    m = j;
            }
        }
        cout << m + 1;
    }
    else if (d == n)
    {
        vector<int> li = {v[0]};
        for (i = 1; i < n; i++)
        {
            int hi = li.size(), lo = -1, md;
            while (hi - lo > 1)
            {
                md = (hi + lo) / 2;
                if (li[md] < v[i])
                    lo = md;
                else
                    hi = md;
            }
            if (hi < li.size())
                li[hi] = v[i];
            else
                li.push_back(v[i]);
        }
        cout << li.size();
    }
    else if (d == 1)
    {
        v.push_back(1000000001);
        vector<int> ne(n + 1, n), st = {n}, ml(n + 1, 0);
        int m = 0;
        for (i = n - 1; i >= 0; i--)
        {
            while (v[i] >= v[st.back()])
                st.pop_back();
            ne[i] = st.back();
            ml[i] = ml[ne[i]] + 1;
            m = max(m, ml[i]);
            st.push_back(i);
        }
        cout << m;
    }
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |             if (hi < li.size())
      |                 ~~~^~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 16 ms 604 KB Output is correct
32 Correct 48 ms 876 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 9 ms 600 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 692 KB Output is correct
40 Correct 7 ms 604 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 16 ms 604 KB Output is correct
32 Correct 48 ms 876 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 9 ms 600 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 692 KB Output is correct
40 Correct 7 ms 604 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Incorrect 2 ms 348 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 3752 KB Output is correct
2 Correct 92 ms 3760 KB Output is correct
3 Correct 86 ms 3748 KB Output is correct
4 Correct 99 ms 3772 KB Output is correct
5 Correct 85 ms 4800 KB Output is correct
6 Correct 85 ms 3772 KB Output is correct
7 Correct 88 ms 7080 KB Output is correct
8 Correct 89 ms 3780 KB Output is correct
9 Correct 106 ms 5564 KB Output is correct
10 Correct 88 ms 3772 KB Output is correct
11 Correct 84 ms 3764 KB Output is correct
12 Correct 86 ms 3780 KB Output is correct
13 Correct 103 ms 4768 KB Output is correct
14 Correct 83 ms 3776 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 1372 KB Output is correct
2 Correct 87 ms 1368 KB Output is correct
3 Correct 103 ms 1592 KB Output is correct
4 Correct 92 ms 1372 KB Output is correct
5 Correct 105 ms 2000 KB Output is correct
6 Correct 92 ms 1596 KB Output is correct
7 Correct 100 ms 3784 KB Output is correct
8 Correct 91 ms 1372 KB Output is correct
9 Correct 100 ms 1980 KB Output is correct
10 Correct 110 ms 1624 KB Output is correct
11 Correct 107 ms 1596 KB Output is correct
12 Correct 91 ms 1372 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 16 ms 604 KB Output is correct
32 Correct 48 ms 876 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 9 ms 600 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 692 KB Output is correct
40 Correct 7 ms 604 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Incorrect 2 ms 348 KB Output isn't correct
43 Halted 0 ms 0 KB -