Submission #151965

#	Time	Username	Problem	Language	Result	Execution time	Memory
151965		dolphingarlic	Lightning Conductor (POI11_pio)	C++14	36 / 100	187 ms	16504 KiB

pio

#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 (stderr)

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

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10