oj.uz

답안 #516731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516731 2022-01-22T04:36:46 Z nickyrio Exam (eJOI20_exam) C++17
65 / 100
 110 ms 99548 KB 
#include <bits/stdc++.h>

using namespace std;
#define all(s) s.begin(), s.end() 
const int N = 5050;
int a[N], b[N], n, dp[N][N], L[N], R[N];
vector<int> e[N];

void sub2() {
    for (int i = 2; i <= n; ++i) if (b[i] != b[1]) return;
    int cnt = 0;
    // cerr << "Sub 2" << '\n';
    for (int i = 1; i <= n; ++i) if (a[i] == b[1]) {
        // cerr << i << ' ' << L[i] << ' ' << R[i] << '\n';
        for (int j = L[i] + 1; j < R[i]; ++j) a[j] = b[1];
    }
    for (int i = 1; i <= n; ++i) if (a[i] == b[1]) ++cnt;
    cout << cnt << '\n';
    exit(0);
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> b[i];
    a[0] = a[n + 1] = 2e9;
    for (int i = 1; i <= n; ++i) {
        L[i] = R[i] = i;
        while (a[L[i]] <= a[i]) --L[i];
        while (a[R[i]] <= a[i]) ++R[i];
    }
    sub2();
    vector<int> Ranking(a + 1, a + n + 1);
    sort(all(Ranking));
    Ranking.resize(unique(all(Ranking)) - Ranking.begin());
    for (int i = 1; i <= n; ++i) {
        a[i] = lower_bound(all(Ranking), a[i]) - Ranking.begin();
        int temp_b = lower_bound(all(Ranking), b[i]) - Ranking.begin();
        if (temp_b != Ranking.size() && Ranking[temp_b] != b[i]) temp_b = Ranking.size();
        b[i] = temp_b;
        e[b[i]].push_back(i);
    }

    for (int i = 1; i <= n; ++i) {
        int temp = 1;
        int p = 0, cnt = 0;
        for (int j : e[a[i]]) if (L[i] < j && j < R[i]) {
            ++cnt;
            if (dp[i - 1][j - 1] + 1 > dp[i - 1][p] + cnt) { p = j - 1; cnt = 1; }
            dp[i][j] = max(dp[i][j], dp[i - 1][p] + cnt);
        }
        for (int j = 1; j <= n; ++j) dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
    }
    cout << dp[n][n] << '\n';
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         if (temp_b != Ranking.size() && Ranking[temp_b] != b[i]) temp_b = Ranking.size();
      |             ~~~~~~~^~~~~~~~~~~~~~~~~
exam.cpp:44:13: warning: unused variable 'temp' [-Wunused-variable]
   44 |         int temp = 1;
      |             ^~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 460 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 21 ms 24204 KB Output is correct
4 Correct 87 ms 95336 KB Output is correct
5 Correct 95 ms 99548 KB Output is correct
6 Correct 91 ms 99424 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 844 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 1 ms 1356 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 21 ms 24204 KB Output is correct
10 Correct 87 ms 95336 KB Output is correct
11 Correct 95 ms 99548 KB Output is correct
12 Correct 91 ms 99424 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 588 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1356 KB Output is correct
18 Correct 1 ms 1356 KB Output is correct
19 Correct 1 ms 1356 KB Output is correct
20 Correct 1 ms 1356 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 7 ms 8396 KB Output is correct
23 Correct 30 ms 460 KB Output is correct
24 Correct 110 ms 99268 KB Output is correct
25 Correct 91 ms 99364 KB Output is correct
26 Correct 87 ms 99236 KB Output is correct
27 Correct 97 ms 99284 KB Output is correct
28 Correct 90 ms 99380 KB Output is correct
29 Correct 92 ms 99268 KB Output is correct
30 Correct 95 ms 99468 KB Output is correct
31 Correct 96 ms 99340 KB Output is correct
32 Correct 91 ms 99308 KB Output is correct