oj.uz

Submission #515740

# Submission time Handle Problem Language Result Execution time Memory
515740 2022-01-19T14:54:30 Z goodluck2020 Financial Report (JOI21_financial) C++14
45 / 100
 269 ms 19972 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 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(D == 1) sub4::solve();
    else if(D == n) sub5::solve();

}

Compilation message

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

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 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 320 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 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 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 0 ms 332 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 1 ms 460 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 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 320 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 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 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 0 ms 332 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 1 ms 460 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 4 ms 972 KB Output is correct
29 Correct 6 ms 944 KB Output is correct
30 Correct 11 ms 976 KB Output is correct
31 Correct 44 ms 844 KB Output is correct
32 Correct 163 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 27 ms 1004 KB Output is correct
37 Correct 5 ms 972 KB Output is correct
38 Correct 7 ms 984 KB Output is correct
39 Correct 12 ms 972 KB Output is correct
40 Correct 19 ms 972 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 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 320 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 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 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 0 ms 332 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 1 ms 460 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 4 ms 972 KB Output is correct
29 Correct 6 ms 944 KB Output is correct
30 Correct 11 ms 976 KB Output is correct
31 Correct 44 ms 844 KB Output is correct
32 Correct 163 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 27 ms 1004 KB Output is correct
37 Correct 5 ms 972 KB Output is correct
38 Correct 7 ms 984 KB Output is correct
39 Correct 12 ms 972 KB Output is correct
40 Correct 19 ms 972 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Incorrect 3 ms 716 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 34 ms 3900 KB Output is correct
2 Correct 46 ms 2748 KB Output is correct
3 Correct 62 ms 2652 KB Output is correct
4 Correct 212 ms 15692 KB Output is correct
5 Correct 167 ms 17884 KB Output is correct
6 Correct 247 ms 18068 KB Output is correct
7 Correct 120 ms 19972 KB Output is correct
8 Correct 111 ms 18964 KB Output is correct
9 Correct 103 ms 18980 KB Output is correct
10 Correct 97 ms 18500 KB Output is correct
11 Correct 157 ms 17860 KB Output is correct
12 Correct 159 ms 17924 KB Output is correct
13 Correct 157 ms 17944 KB Output is correct
14 Correct 209 ms 17844 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 1524 KB Output is correct
2 Correct 62 ms 1468 KB Output is correct
3 Correct 82 ms 1808 KB Output is correct
4 Correct 262 ms 17944 KB Output is correct
5 Correct 214 ms 18068 KB Output is correct
6 Correct 269 ms 18004 KB Output is correct
7 Correct 132 ms 18036 KB Output is correct
8 Correct 136 ms 18040 KB Output is correct
9 Correct 122 ms 17860 KB Output is correct
10 Correct 157 ms 18000 KB Output is correct
11 Correct 251 ms 18024 KB Output is correct
12 Correct 189 ms 18024 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 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 320 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 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 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 0 ms 332 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 1 ms 460 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 4 ms 972 KB Output is correct
29 Correct 6 ms 944 KB Output is correct
30 Correct 11 ms 976 KB Output is correct
31 Correct 44 ms 844 KB Output is correct
32 Correct 163 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 5 ms 972 KB Output is correct
35 Correct 7 ms 972 KB Output is correct
36 Correct 27 ms 1004 KB Output is correct
37 Correct 5 ms 972 KB Output is correct
38 Correct 7 ms 984 KB Output is correct
39 Correct 12 ms 972 KB Output is correct
40 Correct 19 ms 972 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Incorrect 3 ms 716 KB Output isn't correct
43 Halted 0 ms 0 KB -