oj.uz

답안 #246268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246268 2020-07-08T13:22:48 Z SamAnd Safety (NOI18_safety) C++17
35 / 100
 240 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]);

    if (h == 0)
    {
        sort(a + 1, a + n + 1);
        ll ans = 0;
        for (int i = 1; i <= n; ++i)
        {
            ans += abs(a[i] - a[n / 2 + 1]);
        }
        printf("%lld\n", ans);
        return;
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 5 ms 640 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6 ms 384 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 30 ms 10104 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 30 ms 9824 KB Output is correct
16 Correct 29 ms 10104 KB Output is correct
17 Correct 33 ms 8960 KB Output is correct
18 Correct 24 ms 7544 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 30 ms 10104 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 30 ms 9824 KB Output is correct
16 Correct 29 ms 10104 KB Output is correct
17 Correct 33 ms 8960 KB Output is correct
18 Correct 24 ms 7544 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct
20 Correct 26 ms 9472 KB Output is correct
21 Correct 26 ms 10112 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 31 ms 7928 KB Output is correct
24 Correct 25 ms 9472 KB Output is correct
25 Correct 35 ms 8056 KB Output is correct
26 Correct 40 ms 10104 KB Output is correct
27 Correct 24 ms 9472 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 30 ms 10104 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 30 ms 9824 KB Output is correct
16 Correct 29 ms 10104 KB Output is correct
17 Correct 33 ms 8960 KB Output is correct
18 Correct 24 ms 7544 KB Output is correct
19 Correct 28 ms 9728 KB Output is correct
20 Correct 26 ms 9472 KB Output is correct
21 Correct 26 ms 10112 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 31 ms 7928 KB Output is correct
24 Correct 25 ms 9472 KB Output is correct
25 Correct 35 ms 8056 KB Output is correct
26 Correct 40 ms 10104 KB Output is correct
27 Correct 24 ms 9472 KB Output is correct
28 Correct 228 ms 98296 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 227 ms 96632 KB Output is correct
31 Correct 206 ms 80248 KB Output is correct
32 Correct 188 ms 80888 KB Output is correct
33 Correct 216 ms 98296 KB Output is correct
34 Correct 240 ms 96344 KB Output is correct

Subtask #8
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 640 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 640 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 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 640 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 -