oj.uz

Submission #466693

# Submission time Handle Problem Language Result Execution time Memory
466693 2021-08-20T08:24:41 Z Valaki2 Exam (eJOI20_exam) C++14
25 / 100
 66 ms 1612 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> a;
vector<int> b;

void solve_bf() {

}

void solve_bequal() {
    int x = b[1];
    int last = 0;
    bool ok = false;
    int ans = 0;
    a.push_back(x + 1);
    for(int i = 1; i <= (n + 1); ++i) {
        if(a[i] > x) {
            if(ok) {
                ans += i - last - 1;
                ok = false;
            }
            last = i;
        } else if(a[i] == x) {
            ok = true;
        }
    }
    cout << ans << "\n";
}

void solve_astrictlyincreasing() {
    vector<int> dp(1 + n, 0);
    for(int i = 1; i <= n; ++i) {
        vector<int> cnt_left(1 + i + 1, 0);
        // vector<int> cnt_right(1 + i + 1, 0);
        for(int j = 1; j <= i; ++j) {
            cnt_left[j] = cnt_left[j - 1];
            if(b[j] == a[i]) ++cnt_left[j];
        }
        /*for(int j = i; j >= 1; --j) {
            cnt_right[j] = cnt_right[j + 1];
            if(b[j] == a[i]) ++cnt_right[j];
        }*/
        int maxi = 0;
        for(int j = 1; j <= i; ++j) {
            maxi = max(maxi, dp[j] - cnt_left[j]);
            dp[j] = max(dp[j], maxi + cnt_left[j]);
        }
    }
    cout << dp[n] << "\n";
}

void solve() {
    cin >> n;
    a.assign(1 + n, 0);
    b.assign(1 + n, 0);
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) cin >> b[i];
    set<int> b_set;
    for(int i = 1; i <= n; ++i) {
        b_set.insert(b[i]);
    }
    /*if(n <= 10) {
        solve_bf();
    } else */if(b_set.size() == 1) {
        solve_bequal();
    } else {
        solve_astrictlyincreasing();
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 19 ms 1400 KB Output is correct
4 Correct 17 ms 1560 KB Output is correct
5 Correct 29 ms 1604 KB Output is correct
6 Correct 16 ms 1548 KB Output is correct
7 Correct 17 ms 1604 KB Output is correct
8 Correct 27 ms 1612 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 10 ms 480 KB Output is correct
4 Correct 54 ms 568 KB Output is correct
5 Correct 64 ms 604 KB Output is correct
6 Correct 66 ms 576 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 564 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 0 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -