oj.uz

답안 #713385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713385 2023-03-21T20:23:02 Z mtxas Rabbit Carrot (LMIO19_triusis) C++14
35 / 100
 284 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 > 5000) 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 <= 5 * 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 10 ms 476 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 10 ms 476 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 440 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 121 ms 79884 KB Output is correct
21 Correct 135 ms 98536 KB Output is correct
22 Correct 133 ms 98528 KB Output is correct
23 Correct 205 ms 145204 KB Output is correct
24 Correct 284 ms 191232 KB Output is correct
25 Correct 139 ms 98532 KB Output is correct
26 Correct 146 ms 105636 KB Output is correct
27 Correct 135 ms 98536 KB Output is correct
28 Correct 137 ms 98516 KB Output is correct
29 Correct 138 ms 98508 KB Output is correct
30 Correct 141 ms 98508 KB Output is correct
31 Correct 143 ms 98528 KB Output is correct
32 Correct 187 ms 131020 KB Output is correct
33 Correct 187 ms 130768 KB Output is correct

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 121 ms 79884 KB Output is correct
5 Correct 135 ms 98536 KB Output is correct
6 Correct 133 ms 98528 KB Output is correct
7 Correct 205 ms 145204 KB Output is correct
8 Correct 284 ms 191232 KB Output is correct
9 Correct 139 ms 98532 KB Output is correct
10 Correct 146 ms 105636 KB Output is correct
11 Correct 135 ms 98536 KB Output is correct
12 Correct 137 ms 98516 KB Output is correct
13 Correct 138 ms 98508 KB Output is correct
14 Correct 141 ms 98508 KB Output is correct
15 Correct 143 ms 98528 KB Output is correct
16 Correct 187 ms 131020 KB Output is correct
17 Correct 187 ms 130768 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 10 ms 476 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Runtime error 108 ms 262144 KB Execution killed with signal 9
35 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 108 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -