oj.uz

Submission #246267

# Submission time Handle Problem Language Result Execution time Memory
246267 2020-07-08T13:20:52 Z SamAnd Safety (NOI18_safety) C++17
35 / 100
 238 ms 98296 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 = 5003, m = 5000, INF = 1000000009;

int n, h;
int a[N];

int dp[N][N];

void solv()
{
    scanf("%d%d", &n, &h);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int j = 0; j <= m; ++j)
    {
        dp[1][j] = abs(a[1] - j);
    }
    for (int i = 2; i <= n; ++i)
    {
        int k = -1;
        deque<pair<int, int> > q;
        for (int j = 0; j <= m; ++j)
        {
            while (k < min(m, j + h))
            {
                ++k;
                while (!q.empty() && dp[i - 1][k] <= q.back().fi)
                    q.pop_back();
                q.push_back(m_p(dp[i - 1][k], k));
            }
            while (q.front().se < max(0, j - h))
                q.pop_front();
            dp[i][j] = abs(a[i] - j) + q.front().fi;
        }
    }
    int ans = INF;
    for (int j = 0; j <= m; ++j)
        ans = min(ans, dp[n][j]);
    printf("%d\n", ans);
}

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);
    solv();
    return 0;
}

//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

Compilation message

safety.cpp: In function 'void solv()':
safety.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &h);
     ~~~~~^~~~~~~~~~~~~~~~
safety.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 544 KB Output is correct
2 Correct 7 ms 640 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6 ms 308 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 544 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 29 ms 10112 KB Output is correct
14 Correct 28 ms 9856 KB Output is correct
15 Correct 30 ms 9856 KB Output is correct
16 Correct 32 ms 10104 KB Output is correct
17 Correct 26 ms 8960 KB Output is correct
18 Correct 23 ms 7552 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 544 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 29 ms 10112 KB Output is correct
14 Correct 28 ms 9856 KB Output is correct
15 Correct 30 ms 9856 KB Output is correct
16 Correct 32 ms 10104 KB Output is correct
17 Correct 26 ms 8960 KB Output is correct
18 Correct 23 ms 7552 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct
20 Correct 27 ms 9472 KB Output is correct
21 Correct 26 ms 10112 KB Output is correct
22 Correct 22 ms 8576 KB Output is correct
23 Correct 23 ms 7808 KB Output is correct
24 Correct 25 ms 9520 KB Output is correct
25 Correct 23 ms 8064 KB Output is correct
26 Correct 24 ms 10112 KB Output is correct
27 Correct 24 ms 9472 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 544 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 29 ms 10112 KB Output is correct
14 Correct 28 ms 9856 KB Output is correct
15 Correct 30 ms 9856 KB Output is correct
16 Correct 32 ms 10104 KB Output is correct
17 Correct 26 ms 8960 KB Output is correct
18 Correct 23 ms 7552 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct
20 Correct 27 ms 9472 KB Output is correct
21 Correct 26 ms 10112 KB Output is correct
22 Correct 22 ms 8576 KB Output is correct
23 Correct 23 ms 7808 KB Output is correct
24 Correct 25 ms 9520 KB Output is correct
25 Correct 23 ms 8064 KB Output is correct
26 Correct 24 ms 10112 KB Output is correct
27 Correct 24 ms 9472 KB Output is correct
28 Correct 225 ms 98296 KB Output is correct
29 Correct 185 ms 83064 KB Output is correct
30 Correct 225 ms 96760 KB Output is correct
31 Correct 196 ms 80120 KB Output is correct
32 Correct 185 ms 81016 KB Output is correct
33 Correct 205 ms 98296 KB Output is correct
34 Correct 238 ms 96248 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 544 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Incorrect 5 ms 512 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 544 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Incorrect 5 ms 512 KB Output isn't correct
14 Halted 0 ms 0 KB -