oj.uz

Submission #552333

# Submission time Handle Problem Language Result Execution time Memory
552333 2022-04-23T03:13:32 Z pokmui9909 Krov (COCI17_krov) C++17
112 / 140
 1500 ms 14456 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
  
ll N;
ll A[100005];
ll B[100005];
ll C[100005];
struct BIT{
    ll T[300015] = {};
    void update(ll k, ll v){while(k <= 300010) T[k] += v, k += k & -k;}
    ll sum(ll k){ll r = 0;while(k >= 1) r += T[k], k -= k & -k; return r;}
    ll query(ll l, ll r) {return sum(r) - sum(l - 1);}
};
BIT pfs, pfc, sfs, sfc;
vector<ll> V;
const ll INF = 1e10;
ll Idx1(ll k){
    return lower_bound(V.begin(), V.end(), k) - V.begin();
}
ll Idx2(ll k){
    return upper_bound(V.begin(), V.end(), k) - V.begin() - 1;
}
  
ll f(ll X, ll K){
    ll r = 0;
    K -= X;
    r += K * pfc.query(Idx1(-INF), Idx2(K)) - pfs.query(Idx1(-INF), Idx2(K));
    r += pfs.query(Idx1(K + 1), Idx2(INF)) - K * pfc.query(Idx1(K + 1), Idx2(INF));
  
    K += 2 * X;
    r += K * sfc.query(Idx1(-INF), Idx2(K)) - sfs.query(Idx1(-INF), Idx2(K));
    r += sfs.query(Idx1(K + 1), Idx2(INF)) - K * sfc.query(Idx1(K + 1), Idx2(INF));
    return r;
}
  
int main(){
    cin.tie(0) -> sync_with_stdio(false);
  
    V.push_back(-INF - 1);
    V.push_back(-INF);
    V.push_back(INF);
    cin >> N;
    for(ll i = 1; i <= N; i++){
        cin >> A[i];
        B[i] = A[i] + i;
        C[i] = A[i] - i;
        V.push_back(A[i]); V.push_back(B[i]); V.push_back(C[i]);
    }
    sort(V.begin(), V.end());
    V.erase(unique(V.begin(), V.end()), V.end());
    ll ans = 1e18;
    for(ll i = 1; i <= N; i++){
        sfs.update(Idx1(B[i]), B[i]);
        sfc.update(Idx1(B[i]), 1);
    }
    for(ll i = 1; i <= N; i++){
        pfs.update(Idx1(C[i]), C[i]);
        pfc.update(Idx1(C[i]), 1);
        sfs.update(Idx1(B[i]), -B[i]);
        sfc.update(Idx1(B[i]), -1);
        ll L = 0, R = 2e9;
        while(R - L > 10){
            ll p = (L * 2 + R) / 3, q = (L + R * 2) / 3;
            if(f(i, p) <= f(i, q)) R = q;
            else L = p;
        }
        L = max(L, i);
        L = max(L, N + 1 - i);
        for(ll j = L; j <= R; j++){
            ans = min(ans, f(i, j));
        }
    }
    cout << ans;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 596 KB Output is correct
2 Correct 22 ms 660 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 632 KB Output is correct
2 Correct 30 ms 584 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 724 KB Output is correct
2 Correct 37 ms 724 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 852 KB Output is correct
2 Correct 56 ms 756 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 852 KB Output is correct
2 Correct 55 ms 852 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 1280 KB Output is correct
2 Correct 125 ms 1032 KB Output is correct
3 Correct 63 ms 880 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 843 ms 3480 KB Output is correct
2 Correct 713 ms 2632 KB Output is correct
3 Correct 773 ms 3492 KB Output is correct
4 Correct 1052 ms 4048 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1330 ms 4940 KB Output is correct
2 Correct 1392 ms 6100 KB Output is correct
3 Correct 1105 ms 6344 KB Output is correct
4 Correct 1077 ms 5860 KB Output is correct

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1576 ms 5824 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1583 ms 14456 KB Time limit exceeded
2 Halted 0 ms 0 KB -