oj.uz

Submission #151954

# Submission time Handle Problem Language Result Execution time Memory
151954 2019-09-05T16:03:18 Z dolphingarlic Lightning Conductor (POI11_pio) C++14
36 / 100
 151 ms 14804 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)));
    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();
    if (h[i] > h[q.back()]) q.push_back(i);
  }
 
  q.clear();
  q.push_back(n - 1);
  for (ll i = n - 2; 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)));
    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();
    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
0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2144 KB Output is correct

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3320 KB Output is correct
2 Correct 30 ms 3452 KB Output is correct
3 Incorrect 29 ms 3480 KB Output isn't correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 6532 KB Output is correct
2 Correct 58 ms 6860 KB Output is correct
3 Incorrect 62 ms 6776 KB Output isn't correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 10872 KB Output is correct
2 Correct 89 ms 8824 KB Output is correct
3 Incorrect 98 ms 10884 KB Output isn't correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 13484 KB Output is correct
2 Correct 128 ms 10616 KB Output is correct
3 Incorrect 139 ms 14804 KB Output isn't correct

Subtask #11
0 / 10.0

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