oj.uz

Submission #846950

# Submission time Handle Problem Language Result Execution time Memory
846950 2023-09-08T18:06:34 Z SUNWOOOOOOOO Financial Report (JOI21_financial) C++17
14 / 100
 180 ms 392240 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 7005;
int n, d, A[mxN], dp1[mxN][mxN], dp2[mxN][mxN]; // len, last idx
vector <int> va;

int main()
{
    memset(dp1, -1, sizeof dp1);
    scanf("%d %d", &n, &d);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &A[i]);
        va.push_back(A[i]);
    }
    sort(va.begin(), va.end());
    va.erase(unique(va.begin(), va.end()), va.end());
    for (int i = 1; i <= n; i++) A[i] = lower_bound(va.begin(), va.end(), A[i]) - va.begin() + 1;

    int ans = 0;
    for (int i = 1; i <= n; i++){
        dp1[i][A[i]] = 1, dp2[i][A[i]] = i;
        if (dp1[i - 1][A[i]] != -1 && i - dp2[i - 1][A[i]] <= d) dp1[i][A[i]] = dp1[i - 1][A[i]];
        for (int j = 1; j < A[i]; j++){
            if (dp1[i - 1][j] == -1 || i - dp2[i - 1][j] > d) continue;
            dp1[i][j] = dp1[i - 1][j];
            dp2[i][j] = dp2[i - 1][j];
            dp1[i][A[i]] = max(dp1[i][A[i]], dp1[i - 1][j] + 1);
        }
        for (int j = A[i] + 1; j <= n; j++){
            if (dp1[i - 1][j] == -1) continue;
            dp1[i][j] = dp1[i - 1][j];
            dp2[i][j] = i;
        }
        for (int j = 1; j <= n; j++) ans = max(ans, dp1[i][j]);
    }

    printf("%d\n", ans);

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%d", &A[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 193372 KB Output is correct
2 Correct 22 ms 193420 KB Output is correct
3 Correct 21 ms 193380 KB Output is correct
4 Correct 22 ms 193372 KB Output is correct
5 Correct 21 ms 193368 KB Output is correct
6 Correct 21 ms 193536 KB Output is correct
7 Correct 22 ms 193340 KB Output is correct
8 Correct 22 ms 193540 KB Output is correct
9 Correct 22 ms 193360 KB Output is correct
10 Correct 22 ms 193372 KB Output is correct
11 Correct 21 ms 193512 KB Output is correct
12 Correct 21 ms 193372 KB Output is correct
13 Correct 21 ms 193372 KB Output is correct
14 Correct 22 ms 193372 KB Output is correct
15 Correct 22 ms 195416 KB Output is correct
16 Correct 22 ms 195412 KB Output is correct
17 Correct 22 ms 195420 KB Output is correct
18 Correct 22 ms 195512 KB Output is correct
19 Correct 22 ms 195420 KB Output is correct
20 Correct 22 ms 195624 KB Output is correct
21 Correct 22 ms 195420 KB Output is correct
22 Correct 22 ms 195512 KB Output is correct
23 Correct 25 ms 195412 KB Output is correct
24 Correct 21 ms 195412 KB Output is correct
25 Correct 22 ms 195412 KB Output is correct
26 Correct 23 ms 195412 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 193372 KB Output is correct
2 Correct 22 ms 193420 KB Output is correct
3 Correct 21 ms 193380 KB Output is correct
4 Correct 22 ms 193372 KB Output is correct
5 Correct 21 ms 193368 KB Output is correct
6 Correct 21 ms 193536 KB Output is correct
7 Correct 22 ms 193340 KB Output is correct
8 Correct 22 ms 193540 KB Output is correct
9 Correct 22 ms 193360 KB Output is correct
10 Correct 22 ms 193372 KB Output is correct
11 Correct 21 ms 193512 KB Output is correct
12 Correct 21 ms 193372 KB Output is correct
13 Correct 21 ms 193372 KB Output is correct
14 Correct 22 ms 193372 KB Output is correct
15 Correct 22 ms 195416 KB Output is correct
16 Correct 22 ms 195412 KB Output is correct
17 Correct 22 ms 195420 KB Output is correct
18 Correct 22 ms 195512 KB Output is correct
19 Correct 22 ms 195420 KB Output is correct
20 Correct 22 ms 195624 KB Output is correct
21 Correct 22 ms 195420 KB Output is correct
22 Correct 22 ms 195512 KB Output is correct
23 Correct 25 ms 195412 KB Output is correct
24 Correct 21 ms 195412 KB Output is correct
25 Correct 22 ms 195412 KB Output is correct
26 Correct 23 ms 195412 KB Output is correct
27 Incorrect 24 ms 205660 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 193372 KB Output is correct
2 Correct 22 ms 193420 KB Output is correct
3 Correct 21 ms 193380 KB Output is correct
4 Correct 22 ms 193372 KB Output is correct
5 Correct 21 ms 193368 KB Output is correct
6 Correct 21 ms 193536 KB Output is correct
7 Correct 22 ms 193340 KB Output is correct
8 Correct 22 ms 193540 KB Output is correct
9 Correct 22 ms 193360 KB Output is correct
10 Correct 22 ms 193372 KB Output is correct
11 Correct 21 ms 193512 KB Output is correct
12 Correct 21 ms 193372 KB Output is correct
13 Correct 21 ms 193372 KB Output is correct
14 Correct 22 ms 193372 KB Output is correct
15 Correct 22 ms 195416 KB Output is correct
16 Correct 22 ms 195412 KB Output is correct
17 Correct 22 ms 195420 KB Output is correct
18 Correct 22 ms 195512 KB Output is correct
19 Correct 22 ms 195420 KB Output is correct
20 Correct 22 ms 195624 KB Output is correct
21 Correct 22 ms 195420 KB Output is correct
22 Correct 22 ms 195512 KB Output is correct
23 Correct 25 ms 195412 KB Output is correct
24 Correct 21 ms 195412 KB Output is correct
25 Correct 22 ms 195412 KB Output is correct
26 Correct 23 ms 195412 KB Output is correct
27 Incorrect 24 ms 205660 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 173 ms 392108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 180 ms 392240 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 193372 KB Output is correct
2 Correct 22 ms 193420 KB Output is correct
3 Correct 21 ms 193380 KB Output is correct
4 Correct 22 ms 193372 KB Output is correct
5 Correct 21 ms 193368 KB Output is correct
6 Correct 21 ms 193536 KB Output is correct
7 Correct 22 ms 193340 KB Output is correct
8 Correct 22 ms 193540 KB Output is correct
9 Correct 22 ms 193360 KB Output is correct
10 Correct 22 ms 193372 KB Output is correct
11 Correct 21 ms 193512 KB Output is correct
12 Correct 21 ms 193372 KB Output is correct
13 Correct 21 ms 193372 KB Output is correct
14 Correct 22 ms 193372 KB Output is correct
15 Correct 22 ms 195416 KB Output is correct
16 Correct 22 ms 195412 KB Output is correct
17 Correct 22 ms 195420 KB Output is correct
18 Correct 22 ms 195512 KB Output is correct
19 Correct 22 ms 195420 KB Output is correct
20 Correct 22 ms 195624 KB Output is correct
21 Correct 22 ms 195420 KB Output is correct
22 Correct 22 ms 195512 KB Output is correct
23 Correct 25 ms 195412 KB Output is correct
24 Correct 21 ms 195412 KB Output is correct
25 Correct 22 ms 195412 KB Output is correct
26 Correct 23 ms 195412 KB Output is correct
27 Incorrect 24 ms 205660 KB Output isn't correct
28 Halted 0 ms 0 KB -