oj.uz

Submission #515766

# Submission time Handle Problem Language Result Execution time Memory
515766 2022-01-19T15:43:00 Z goodluck2020 Financial Report (JOI21_financial) C++14
65 / 100
 251 ms 20672 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;
    }
}
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();
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(task ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:115:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  115 |         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 0 ms 332 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 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 0 ms 332 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 11 ms 972 KB Output is correct
31 Correct 46 ms 972 KB Output is correct
32 Correct 179 ms 984 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 6 ms 908 KB Output is correct
35 Correct 6 ms 972 KB Output is correct
36 Correct 26 ms 1004 KB Output is correct
37 Correct 4 ms 972 KB Output is correct
38 Correct 6 ms 904 KB Output is correct
39 Correct 13 ms 1008 KB Output is correct
40 Correct 19 ms 972 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 0 ms 332 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 11 ms 972 KB Output is correct
31 Correct 46 ms 972 KB Output is correct
32 Correct 179 ms 984 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 6 ms 908 KB Output is correct
35 Correct 6 ms 972 KB Output is correct
36 Correct 26 ms 1004 KB Output is correct
37 Correct 4 ms 972 KB Output is correct
38 Correct 6 ms 904 KB Output is correct
39 Correct 13 ms 1008 KB Output is correct
40 Correct 19 ms 972 KB Output is correct
41 Correct 81 ms 460 KB Output is correct
42 Correct 63 ms 800 KB Output is correct
43 Correct 51 ms 440 KB Output is correct
44 Correct 61 ms 588 KB Output is correct
45 Correct 84 ms 588 KB Output is correct
46 Correct 95 ms 864 KB Output is correct
47 Correct 53 ms 788 KB Output is correct
48 Correct 55 ms 788 KB Output is correct
49 Correct 60 ms 800 KB Output is correct
50 Correct 78 ms 928 KB Output is correct
51 Correct 38 ms 812 KB Output is correct
52 Correct 46 ms 716 KB Output is correct
53 Correct 46 ms 800 KB Output is correct
54 Correct 46 ms 796 KB Output is correct
55 Correct 82 ms 804 KB Output is correct
56 Correct 58 ms 928 KB Output is correct
57 Correct 60 ms 808 KB Output is correct
58 Correct 37 ms 716 KB Output is correct
59 Correct 35 ms 788 KB Output is correct
60 Correct 41 ms 792 KB Output is correct
61 Correct 39 ms 784 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4564 KB Output is correct
2 Correct 50 ms 3608 KB Output is correct
3 Correct 59 ms 3396 KB Output is correct
4 Correct 236 ms 16452 KB Output is correct
5 Correct 171 ms 18648 KB Output is correct
6 Correct 251 ms 18612 KB Output is correct
7 Correct 119 ms 20672 KB Output is correct
8 Correct 113 ms 19692 KB Output is correct
9 Correct 101 ms 19856 KB Output is correct
10 Correct 98 ms 19272 KB Output is correct
11 Correct 152 ms 18584 KB Output is correct
12 Correct 161 ms 18696 KB Output is correct
13 Correct 162 ms 18644 KB Output is correct
14 Correct 202 ms 18612 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2256 KB Output is correct
2 Correct 59 ms 1912 KB Output is correct
3 Correct 77 ms 2120 KB Output is correct
4 Correct 235 ms 18408 KB Output is correct
5 Correct 206 ms 18392 KB Output is correct
6 Correct 231 ms 18388 KB Output is correct
7 Correct 127 ms 18408 KB Output is correct
8 Correct 126 ms 18388 KB Output is correct
9 Correct 107 ms 18308 KB Output is correct
10 Correct 150 ms 18256 KB Output is correct
11 Correct 209 ms 18424 KB Output is correct
12 Correct 171 ms 18376 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 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 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 5 ms 972 KB Output is correct
29 Correct 6 ms 844 KB Output is correct
30 Correct 11 ms 972 KB Output is correct
31 Correct 46 ms 972 KB Output is correct
32 Correct 179 ms 984 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 6 ms 908 KB Output is correct
35 Correct 6 ms 972 KB Output is correct
36 Correct 26 ms 1004 KB Output is correct
37 Correct 4 ms 972 KB Output is correct
38 Correct 6 ms 904 KB Output is correct
39 Correct 13 ms 1008 KB Output is correct
40 Correct 19 ms 972 KB Output is correct
41 Correct 81 ms 460 KB Output is correct
42 Correct 63 ms 800 KB Output is correct
43 Correct 51 ms 440 KB Output is correct
44 Correct 61 ms 588 KB Output is correct
45 Correct 84 ms 588 KB Output is correct
46 Correct 95 ms 864 KB Output is correct
47 Correct 53 ms 788 KB Output is correct
48 Correct 55 ms 788 KB Output is correct
49 Correct 60 ms 800 KB Output is correct
50 Correct 78 ms 928 KB Output is correct
51 Correct 38 ms 812 KB Output is correct
52 Correct 46 ms 716 KB Output is correct
53 Correct 46 ms 800 KB Output is correct
54 Correct 46 ms 796 KB Output is correct
55 Correct 82 ms 804 KB Output is correct
56 Correct 58 ms 928 KB Output is correct
57 Correct 60 ms 808 KB Output is correct
58 Correct 37 ms 716 KB Output is correct
59 Correct 35 ms 788 KB Output is correct
60 Correct 41 ms 792 KB Output is correct
61 Correct 39 ms 784 KB Output is correct
62 Correct 31 ms 4564 KB Output is correct
63 Correct 50 ms 3608 KB Output is correct
64 Correct 59 ms 3396 KB Output is correct
65 Correct 236 ms 16452 KB Output is correct
66 Correct 171 ms 18648 KB Output is correct
67 Correct 251 ms 18612 KB Output is correct
68 Correct 119 ms 20672 KB Output is correct
69 Correct 113 ms 19692 KB Output is correct
70 Correct 101 ms 19856 KB Output is correct
71 Correct 98 ms 19272 KB Output is correct
72 Correct 152 ms 18584 KB Output is correct
73 Correct 161 ms 18696 KB Output is correct
74 Correct 162 ms 18644 KB Output is correct
75 Correct 202 ms 18612 KB Output is correct
76 Correct 53 ms 2256 KB Output is correct
77 Correct 59 ms 1912 KB Output is correct
78 Correct 77 ms 2120 KB Output is correct
79 Correct 235 ms 18408 KB Output is correct
80 Correct 206 ms 18392 KB Output is correct
81 Correct 231 ms 18388 KB Output is correct
82 Correct 127 ms 18408 KB Output is correct
83 Correct 126 ms 18388 KB Output is correct
84 Correct 107 ms 18308 KB Output is correct
85 Correct 150 ms 18256 KB Output is correct
86 Correct 209 ms 18424 KB Output is correct
87 Correct 171 ms 18376 KB Output is correct
88 Incorrect 64 ms 4420 KB Output isn't correct
89 Halted 0 ms 0 KB -