oj.uz

Submission #123669

# Submission time Handle Problem Language Result Execution time Memory
123669 2019-07-02T02:30:17 Z dolphingarlic Lightning Conductor (POI11_pio) C++14
45 / 100
 138 ms 15992 KB 
#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;

ll h[500000], dp[500000];

double calc(ll k, ll i) {
    return h[k] + sqrt(abs(i - k));
}

int main() {
    iostream::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    cin >> n;
    FOR(i, 0, n) {
        cin >> h[i];
        dp[i] = h[i];
    }

    deque<ll> q;
    q.push_back(0);
    FOR(i, 1, n) {
        while (q.size() > 1 && calc(q[0], i) <= calc(q[1], i)) q.pop_front();
        dp[i] = max(dp[i], (ll)ceil(calc(q[0], i)));
        if (h[i] > h[q.back()]) q.push_back(i);
    }

    q.clear();
    q.push_back(n - 1);
    for (ll i = n - 1; i >= 0; i--) {
        while (q.size() > 1 && calc(q[0], i) <= calc(q[1], i)) q.pop_front();
        dp[i] = max(dp[i], (ll)ceil(calc(q[0], i)));
        if (h[i] > h[q.back()]) q.push_back(i);
    }

    FOR(i, 0, n) cout << dp[i] - h[i] << '\n';
    return 0;
}

Compilation message

pio.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1144 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1656 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1784 KB Output is correct
2 Correct 13 ms 1660 KB Output is correct
3 Incorrect 19 ms 2040 KB Output isn't correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2300 KB Output is correct
2 Correct 27 ms 2296 KB Output is correct
3 Incorrect 26 ms 2808 KB Output isn't correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 4952 KB Output is correct
2 Correct 55 ms 4856 KB Output is correct
3 Incorrect 55 ms 5496 KB Output isn't correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 9760 KB Output is correct
2 Correct 89 ms 10728 KB Output is correct
3 Incorrect 89 ms 11384 KB Output isn't correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 14840 KB Output is correct
2 Correct 124 ms 15096 KB Output is correct
3 Incorrect 124 ms 15992 KB Output isn't correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 12472 KB Output is correct
2 Correct 125 ms 15096 KB Output is correct
3 Incorrect 126 ms 15992 KB Output isn't correct