oj.uz

Submission #464549

# Submission time Handle Problem Language Result Execution time Memory
464549 2021-08-13T12:05:54 Z SamAnd Exam (eJOI20_exam) C++17
42 / 100
 31 ms 24984 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 100005, N0 = 203;

int n;
int a[N], b[N];

int maxi[N0][N0];

int dp[N0][N0][N0];

bool c[N0][N0][N0];
int rec(int l, int r, int ul, int ur, int p)
{
    if (l > r)
        return 0;
    ul = max(ul, l - 1);
    ur = min(ur, r + 1);
    if (ul + 1 >= ur)
        return 0;

    int m = maxi[l][r];

    if (c[m][ul][ur])
        return dp[m][ul][ur];
    c[m][ul][ur] = true;

    if (ul < m && m < ur && a[m] == b[m])
        dp[m][ul][ur] = rec(l, m - 1, ul, ur, m) + rec(m + 1, r, ul, ur, m) + 1;
    else
        dp[m][ul][ur] = rec(l, m - 1, ul, ur, m) + rec(m + 1, r, ul, ur, m);

    if (p == 0)
    {
        return dp[m][ul][ur];
    }

    if (p == l - 1)
    {
        int q = 0;
        for (int i = ul + 1; i <= ur - 1; ++i)
        {
            if (b[i] == a[p])
                ++q;
            if (i < m && m < ur && a[m] == b[m])
                ++q;
            dp[m][ul][ur] = max(dp[m][ul][ur], q + rec(l, m - 1, i, ur, m) + rec(m + 1, r, i, ur, m));
            if (i < m && m < ur && a[m] == b[m])
                --q;
        }
    }
    else if (p == r + 1)
    {
        int q = 0;
        for (int i = ur - 1; i >= ul + 1; --i)
        {
            if (b[i] == a[p])
                ++q;
            if (ul < m && m < i && a[m] == b[m])
                ++q;
            dp[m][ul][ur] = max(dp[m][ul][ur], q + rec(l, m - 1, ul, i, m) + rec(m + 1, r, ul, i, m));
            if (ul < m && m < i && a[m] == b[m])
                --q;
        }
    }
    else
        assert(false);

    return dp[m][ul][ur];
}

int solv0()
{
    memset(c, false, sizeof c);
    for (int l = 1; l <= n; ++l)
    {
        maxi[l][l] = l;
        for (int r = l + 1; r <= n; ++r)
        {
            maxi[l][r] = maxi[l][r - 1];
            if (a[r] > a[maxi[l][r]])
                maxi[l][r] = r;
        }
    }
    return rec(1, n, 0, n + 1, 0);
}

int p[N];
int ul[N], ur[N];
int solv2()
{
    for (int i = 1; i <= n; ++i)
    {
        p[i] = p[i - 1];
        if (a[i] == b[i])
            ++p[i];
    }

    ul[0] = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] > b[i])
        {
            ul[i] = i;
        }
        else
        {
            ul[i] = ul[i - 1];
        }
    }
    ur[n + 1] = n + 1;
    for (int i = n; i >= 1; --i)
    {
        if (a[i] > b[i])
        {
            ur[i] = i;
        }
        else
        {
            ur[i] = ur[i + 1];
        }
    }

    int ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] <= b[i])
        {
            if (p[ur[i] - 1] - p[ul[i]] > 0)
                ++ans;
        }
    }

    return ans;
}

void solv()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    for (int i = 1; i <= n; ++i)
        cin >> b[i];

    if (n <= 200)
    {
        cout << solv0() << "\n";
        return;
    }

    bool z2 = true;
    for (int i = 1; i <= n; ++i)
    {
        if (b[i] != b[1])
        {
            z2 = false;
            break;
        }
    }

    if (z2)
    {
        cout << solv2() << "\n";
        return;
    }
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    ios_base::sync_with_stdio(false), cin.tie(0);

    /*int st = 100;
    while (st--)
    {
        n = rnf() % 100 + 1;
        for (int i = 1; i <= n; ++i)
        {
            a[i] = rnf() % 100 + 1;
        }
        b[1] = a[rnf() % n + 1];
        for (int i = 2; i <= n; ++i)
            b[i] = b[1];

        if (solv0() != solv2())
        {
            cout << "WA\n";
            return 0;
        }
    }
    cout << "OK\n";
    return 0;*/

    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solv();
    }
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8524 KB Output is correct
2 Correct 4 ms 8524 KB Output is correct
3 Correct 4 ms 8524 KB Output is correct
4 Correct 4 ms 8524 KB Output is correct
5 Correct 4 ms 8524 KB Output is correct
6 Correct 4 ms 8524 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 7 ms 688 KB Output is correct
3 Correct 21 ms 2076 KB Output is correct
4 Correct 16 ms 2268 KB Output is correct
5 Correct 31 ms 2152 KB Output is correct
6 Correct 17 ms 2188 KB Output is correct
7 Correct 18 ms 2228 KB Output is correct
8 Correct 28 ms 2244 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8524 KB Output is correct
2 Correct 4 ms 8524 KB Output is correct
3 Correct 4 ms 8524 KB Output is correct
4 Correct 4 ms 8524 KB Output is correct
5 Correct 4 ms 8524 KB Output is correct
6 Correct 4 ms 8524 KB Output is correct
7 Correct 4 ms 8496 KB Output is correct
8 Correct 5 ms 8908 KB Output is correct
9 Correct 5 ms 9932 KB Output is correct
10 Correct 9 ms 11100 KB Output is correct
11 Correct 6 ms 10444 KB Output is correct
12 Correct 15 ms 10520 KB Output is correct
13 Correct 10 ms 10188 KB Output is correct
14 Correct 26 ms 24984 KB Output is correct

Subtask #6
0 / 22.0

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