이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
int h[300000], dp[300000];
double calc(int k, int i) {
return h[k] + sqrt(abs(i - k));
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
FOR(i, 0, n) {
cin >> h[i];
dp[i] = h[i];
}
deque<int> 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], (int)ceil(calc(q[0], i)));
if (h[i] > h[q.back()]) q.push_back(i);
}
q.clear();
q.push_back(n - 1);
for (int 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], (int)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;
}
컴파일 시 표준 에러 (stderr) 메시지
pio.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
#pragma GCC Optimize("O3")
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |