제출 #463378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
463378		tengiz05	Exam (eJOI20_exam)	C++17	0 / 100	2 ms	332 KiB

exam

#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 5005;

int par[N][N];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }
    
    if (n <= 0) {
        auto c = a;
        c.insert(c.end(), b.begin(), b.end());
        std::sort(c.begin(), c.end());
        c.erase(std::unique(c.begin(), c.end()), c.end());
        
        for (int i = 0; i < n; i++) {
            a[i] = std::lower_bound(c.begin(), c.end(), a[i]) - c.begin();
            b[i] = std::lower_bound(c.begin(), c.end(), b[i]) - c.begin();
            for (int j = 0; j < n; j++) {
                par[i + 1][j] = par[i][j] + (b[i] == j);
            }
        }
        
        std::vector<int> pref(n + 1), suf(n + 1);
        for (int i = 0; i < n; i++) {
            pref[i + 1] = pref[i] + (a[i] == b[i]);
        }
        for (int i = n - 1; i >= 0; i--) {
            suf[i] = suf[i + 1] + (a[i] == b[i]);
        }
        
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = i, mx = 0; j <= n; j++) {
                mx = std::max(mx, a[j - 1]);
                ans = std::max(ans, pref[i - 1] + suf[j] + par[j][mx] - par[i - 1][mx]);
            }
        }
        std::cout << ans << "\n";
    } else {
        if (std::count(b.begin(), b.end(), b[0]) == n) {
            std::vector<int> t(n, 0);
            for (int i = 0; i < n; i++) {
                if (a[i] == b[0]) {
                    while (i > 0 && a[i] <= b[0] && !t[i]) {
                        t[i] = 1;
                        i--;
                    }
                    while (i < n && a[i] <= b[0] && !t[i]) {
                        t[i] = 1;
                        i++;
                    }
                }
            }
            std::cout << std::accumulate(t.begin(), t.end(), 0) << "\n";
        }
    }
    
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22