oj.uz

Submission #308098

# Submission time Handle Problem Language Result Execution time Memory
308098 2020-09-30T03:33:58 Z caoash Lightning Conductor (POI11_pio) C++14
100 / 100
 112 ms 14208 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
using vl = vector<ll>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

const int MX = 500005;
const int MOD = (int) (1e9 + 7);
const ll INF = (ll) 1e18;

int main(){
    cin.tie(0);
	ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vi a(n);
    vi pre(n), suf(n);
	for(int i = 0 ; i < n; ++i) {
        cin >> a[i];
    }
    int m = -1;
    for (int i = n - 1; i >= 0; --i) {
        if (a[i] <= m) {
            continue;
        }
        m = a[i];
        int j, k, c;
        for (j = i - 1, k = 1, c = 1; j >= 0; j -= k, k += 2, ++c) {
            suf[j] = max(suf[j], a[i] + c);
        }
    }
    m = -1;
    for (int i = 0; i < n; ++i) {
        if (a[i] <= m) {
            continue;
        }
        m = a[i];
        int j, k, c;
        for (j = i + 1, k = 1, c = 1; j < n; j += k, k += 2, ++c) {
            pre[j] = max(pre[j], a[i] + c);
        }
    }
    for (int i = 1; i < n; ++i) {
        pre[i] = max(pre[i - 1], pre[i]);
    }
    for (int i = n - 2; i >= 0; --i) {
        suf[i] = max(suf[i + 1], suf[i]);
    }
    for (int i = 0; i < n; ++i) {
        cout << max(0, max(suf[i], pre[i]) - a[i]) << '\n';     
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1024 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1408 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1408 KB Output is correct
2 Correct 11 ms 1408 KB Output is correct
3 Correct 15 ms 1664 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1920 KB Output is correct
2 Correct 20 ms 1920 KB Output is correct
3 Correct 21 ms 2432 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 4088 KB Output is correct
2 Correct 45 ms 3960 KB Output is correct
3 Correct 48 ms 4600 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 7928 KB Output is correct
2 Correct 75 ms 6008 KB Output is correct
3 Correct 72 ms 8056 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 11128 KB Output is correct
2 Correct 106 ms 8184 KB Output is correct
3 Correct 112 ms 14208 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 8696 KB Output is correct
2 Correct 111 ms 13176 KB Output is correct
3 Correct 105 ms 14188 KB Output is correct