oj.uz

Submission #151965

# Submission time Handle Problem Language Result Execution time Memory
151965 2019-09-05T17:04:58 Z dolphingarlic Lightning Conductor (POI11_pio) C++14
36 / 100
 187 ms 16504 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.back(), i + 1) - calc(q[q.size() - 2], i + 1) <=
                   calc(i, i + 1) - calc(q.back(), i + 1))
            q.pop_back();
        q.push_back(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)));
    }

    q.clear();
    q.push_back(n - 1);
    for (ll i = n - 2; i >= 0; i--) {
        while (q.size() > 1 &&
               calc(q.back(), i - 1) - calc(q[q.size() - 2], i - 1) <=
                   calc(i, i - 1) - calc(q.back(), i - 1))
            q.pop_back();
        q.push_back(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)));
    }

    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 3 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1556 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2040 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2296 KB Output is correct
2 Correct 17 ms 2336 KB Output is correct
3 Incorrect 22 ms 2296 KB Output isn't correct

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 12668 KB Output is correct
2 Correct 115 ms 10744 KB Output is correct
3 Incorrect 119 ms 11344 KB Output isn't correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 16504 KB Output is correct
2 Correct 166 ms 13552 KB Output is correct
3 Incorrect 159 ms 16156 KB Output isn't correct

Subtask #11
0 / 10.0

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