oj.uz

답안 #895824

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895824 2023-12-30T22:00:25 Z tvladm2009 Exam (eJOI20_exam) C++17
65 / 100
 78 ms 123172 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 5e3 + 7;
int a[N], b[N];
bool ok[N][N];
int dp[N][N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    for (int i = 0; i < n; i++) {
        ok[i][i] = true;
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] > a[i]) break;
            ok[j][i] = true;
        }
        for (int j = i + 1; j < n; j++) {
            if (a[j] > a[i]) break;
            ok[j][i] = true;
        }
    }
    for (int i = 0; i < n; i++) {
        if (ok[0][i] && b[0] == a[i]) {
            dp[0][i] = 1;
        }
    }
    for (int i = 1; i < n; i++) {
        int mx = 0;
        for (int j = 0; j < n; j++) {
            mx = max(mx, dp[i - 1][j]);
            if (ok[i][j]) {
                dp[i][j] = mx;
                if (b[i] == a[j]) ++dp[i][j];
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) ans = max(ans, dp[n - 1][i]);
    cout << ans << endl;
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 29272 KB Output is correct
2 Runtime error 32 ms 53076 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 14804 KB Output is correct
3 Correct 13 ms 53964 KB Output is correct
4 Correct 55 ms 119896 KB Output is correct
5 Correct 51 ms 122832 KB Output is correct
6 Correct 52 ms 122864 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 122976 KB Output is correct
2 Runtime error 3 ms 860 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8652 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 2 ms 14804 KB Output is correct
9 Correct 13 ms 53964 KB Output is correct
10 Correct 55 ms 119896 KB Output is correct
11 Correct 51 ms 122832 KB Output is correct
12 Correct 52 ms 122864 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8652 KB Output is correct
21 Correct 1 ms 8812 KB Output is correct
22 Correct 6 ms 29260 KB Output is correct
23 Correct 78 ms 123132 KB Output is correct
24 Correct 72 ms 123052 KB Output is correct
25 Correct 52 ms 123172 KB Output is correct
26 Correct 38 ms 122964 KB Output is correct
27 Correct 49 ms 122960 KB Output is correct
28 Correct 48 ms 123092 KB Output is correct
29 Correct 51 ms 122708 KB Output is correct
30 Correct 53 ms 122984 KB Output is correct
31 Correct 52 ms 122708 KB Output is correct
32 Correct 45 ms 123132 KB Output is correct