oj.uz

Submission #713384

# Submission time Handle Problem Language Result Execution time Memory
713384 2023-03-21T20:22:10 Z mtxas Rabbit Carrot (LMIO19_triusis) C++14
35 / 100
 305 ms 262144 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;
    auto maybeInsert = [&] (int x)
    {
        if(x > 10000) s.insert(x);
    };
    for(int i = 1; i <= n; ++i)
    {
        maybeInsert(a[i]);
        maybeInsert(a[i] + 1);
        maybeInsert(max(0, a[i] - 1));
        maybeInsert(a[i] + m);
        maybeInsert(a[i] + m + 1);
        maybeInsert(max(0, a[i] + m - 1 ));
        maybeInsert(max(0, a[i] - m));
        maybeInsert(max(0, a[i] - m + 1));
        maybeInsert(max(0, a[i] - m - 1));
    }
//    for(int i = 1; i <= 10000; ++i)
//    {
//        s.insert(i);
//    }
//    s.insert(0);
    s.insert(inf);
    vector<int> c {-1};
    for(int i = 0; i <= 10 * 1000; ++i)
    {
        c.push_back(i);
    }
    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 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 868 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 27 ms 772 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 4 ms 792 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 884 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 868 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 27 ms 772 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 4 ms 792 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 884 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 210 ms 159276 KB Output is correct
21 Correct 266 ms 196492 KB Output is correct
22 Correct 274 ms 196488 KB Output is correct
23 Correct 286 ms 196548 KB Output is correct
24 Correct 305 ms 196544 KB Output is correct
25 Correct 271 ms 196492 KB Output is correct
26 Correct 272 ms 196380 KB Output is correct
27 Correct 278 ms 196592 KB Output is correct
28 Correct 288 ms 196552 KB Output is correct
29 Correct 279 ms 196412 KB Output is correct
30 Correct 269 ms 196492 KB Output is correct
31 Correct 268 ms 196556 KB Output is correct
32 Correct 274 ms 196488 KB Output is correct
33 Correct 272 ms 196504 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 210 ms 159276 KB Output is correct
5 Correct 266 ms 196492 KB Output is correct
6 Correct 274 ms 196488 KB Output is correct
7 Correct 286 ms 196548 KB Output is correct
8 Correct 305 ms 196544 KB Output is correct
9 Correct 271 ms 196492 KB Output is correct
10 Correct 272 ms 196380 KB Output is correct
11 Correct 278 ms 196592 KB Output is correct
12 Correct 288 ms 196552 KB Output is correct
13 Correct 279 ms 196412 KB Output is correct
14 Correct 269 ms 196492 KB Output is correct
15 Correct 268 ms 196556 KB Output is correct
16 Correct 274 ms 196488 KB Output is correct
17 Correct 272 ms 196504 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 1 ms 868 KB Output is correct
24 Correct 1 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 27 ms 772 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 4 ms 792 KB Output is correct
29 Correct 1 ms 852 KB Output is correct
30 Correct 1 ms 852 KB Output is correct
31 Correct 2 ms 884 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Runtime error 103 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 103 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -