oj.uz

Submission #713381

# Submission time Handle Problem Language Result Execution time Memory
713381 2023-03-21T20:09:31 Z mtxas Rabbit Carrot (LMIO19_triusis) C++14
14 / 100
 289 ms 185940 KB 
#include <bits/stdc++.h>
using namespace std;
void solve()
{
    const int inf = 0x3f3f3f3f;
    int n, m;
    cin >> n >> m;
    if(n > 5000)
    {
        assert(false);
    }
    vector<int> a(n + 1);
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    /// calculate c
    set<int> s;
    for(int i = 1; i <= n; ++i)
    {
        s.insert(a[i]);
        s.insert(a[i] + 1);
        s.insert(max(0, a[i] - 1));
        s.insert(a[i] + m);
        s.insert(a[i] + m + 1);
        s.insert(max(0, a[i] + m - 1 ));
        s.insert(max(0, a[i] - m));
        s.insert(max(0, a[i] - m + 1));
        s.insert(max(0, a[i] - m - 1));
    }
    s.insert(0);
    s.insert(inf);
    vector<int> c {-1};
    for(auto x : s)
    {
        c.push_back(x);
    }
    int k = c.size() - 1;
    /// calc L
    vector<int> L(k + 1);
    for(int i = 1; i <= k; ++i)
    {
        for(L[i] = i; L[i] >= 1; --L[i])
        {
            if(c[i] - c[L[i]] > m) break;
        }
        L[i]++;
    }
    /// calc dp
    vector<vector<int>> dp(n + 1, vector<int> (k + 1, inf));
    assert(c[1] == 0 && (c[2] != 0));
    dp[0][1] = 0;
    vector<int> curSuff(k + 2, inf), prvSuff(k + 2, inf);
    prvSuff[1] = 0;
    for(int i = 1; i <= n; ++i)
    {
        curSuff.assign(k + 2, inf);
        for(int j = k; j >= 1; --j)
        {
            dp[i][j] = (a[i] != c[j]) + prvSuff[L[j]];
            curSuff[j] = min(curSuff[j + 1], dp[i][j]);
        }
        prvSuff = curSuff;
    }
    /// print ans
    int ans = inf;
    for(int j = 1; j <= k ; ++j)
    {
        ans = min(ans, dp[n][j]);
    }
    cout << ans << '\n';
}
signed main()
{
    solve();
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 131 ms 93744 KB Output is correct
23 Correct 224 ms 145284 KB Output is correct
24 Correct 289 ms 185940 KB Output is correct
25 Correct 55 ms 37336 KB Output is correct
26 Correct 151 ms 105912 KB Output is correct
27 Correct 142 ms 98740 KB Output is correct
28 Correct 147 ms 98708 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 29 ms 19108 KB Output is correct
31 Incorrect 82 ms 49692 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 131 ms 93744 KB Output is correct
7 Correct 224 ms 145284 KB Output is correct
8 Correct 289 ms 185940 KB Output is correct
9 Correct 55 ms 37336 KB Output is correct
10 Correct 151 ms 105912 KB Output is correct
11 Correct 142 ms 98740 KB Output is correct
12 Correct 147 ms 98708 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 29 ms 19108 KB Output is correct
15 Incorrect 82 ms 49692 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 131 ms 93744 KB Output is correct
7 Correct 224 ms 145284 KB Output is correct
8 Correct 289 ms 185940 KB Output is correct
9 Correct 55 ms 37336 KB Output is correct
10 Correct 151 ms 105912 KB Output is correct
11 Correct 142 ms 98740 KB Output is correct
12 Correct 147 ms 98708 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 29 ms 19108 KB Output is correct
15 Incorrect 82 ms 49692 KB Output isn't correct
16 Halted 0 ms 0 KB -