oj.uz

Submission #259254

# Submission time Handle Problem Language Result Execution time Memory
259254 2020-08-07T13:15:18 Z leaked Krov (COCI17_krov) C++14
140 / 140
 1203 ms 6116 KB 
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 2e9,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
void umin(ll &a,ll b){a=min(a,b);}
void umax(ll &a,ll b){a=max(a,b);}
bool is_prime(ll val){for(ll i=2;i<=sqrt(val);i++)if(val%i==0)return 0; return 1;}
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int M=999999937;
const int N=2e5+1;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<"NE";
    exit(0);
}
#define int long long

vector<int>l,r;
ll f[2][N],s[2][N];
int lkl=0,rkl=0;
ll sl=0,sr=0;
void addlkl(int pos,int val){lkl+=val;while(pos<N){f[0][pos]+=val;pos+=pos&-pos;}}
void addlval(int pos,int val){sl+=val;while(pos<N){f[1][pos]+=val;pos+=pos&-pos;}}
void addrkl(int pos,int val){rkl+=val;while(pos<N){s[0][pos]+=val;pos+=pos&-pos;}}
void addrval(int pos,int val){sr+=val;while(pos<N){s[1][pos]+=val;pos+=pos&-pos;}}
ll getlkl(int pos){ll a=0;while(pos>0){a+=f[0][pos];pos-=pos&-pos;} return a;}
ll getlval(int pos){ll a=0;while(pos>0){a+=f[1][pos];pos-=pos&-pos;} return a;}
ll getrkl(int pos){ll a=0;while(pos>0){a+=s[0][pos];pos-=pos&-pos;} return a;}
ll getrval(int pos){ll a=0;while(pos>0){a+=s[1][pos];pos-=pos&-pos;} return a;}
int psl(ll val){return upper_bound(all(l),val)-l.begin();}
int psr(ll val){return upper_bound(all(r),val)-r.begin();}
ll fl(ll val){
    int pos=psl(val);
    ll col=getlkl(pos);
    ll vl=getlval(pos);
    ll a=0;
    a+=col*val-vl;
    a+=(sl-vl)-(lkl-col)*1ll*val;
    return a;
}
ll fr(ll val){
    int pos=psr(val);
    ll col=getrkl(pos);
    ll vl=getrval(pos);
    ll a=0;
    a+=col*val-vl;
    a+=(sr-vl)-(rkl-col)*1ll*val;
    return a;
}
signed main()
{
    fast_io;
//    freopen("in.txt")
    int n;
    cin>>n;
    vector<int>a(n);
    for(auto &z : a){
        cin>>z;
    }
    for(int i=0;i<n;i++){
        l.p_b(a[i]-i);
        r.p_b(a[i]+i);
    }
    sort(all(l));l.erase(unique(all(l)),l.end());
    sort(all(r));r.erase(unique(all(r)),r.end());
    for(int i=0;i<n;i++){
        int pr=psr(a[i]+i);
        addrkl(pr,1);addrval(pr,a[i]+i);
    }
    ll ans=2e18;
    for(int i=0;i<n;i++){
        int pl=psl(a[i]-i),pr=psr(a[i]+i);
        ///delright
        addrkl(pr,-1);addrval(pr,-(a[i]+i));
        ///addleft
        addlkl(pl,1);addlval(pl,(a[i]-i));
        int l=max(i+1,n-i),r=2e9+2;
        while(r-l>=3){
            ll m1 = r-(r-l)/3, m2 = l+(r-l)/3;
            ll f1 = fl(m1 - i) + fr(m1 + i);
            ll f2 = fl(m2 - i) + fr(m2 + i);
            if (f1 >= f2) r = m1;
            else l = m2;
        }
        for(int j=l;j<=r;j++){
            umin(ans,fl(j-i)+fr(j+i));
//            debug()<<imie(j)<<imie()
        }
    }
    cout<<ans;
    return 0;
}
/*
hj = hi- |i - j|.
i>j
hj=hi-i+j
hj-j=hi-i
i<j
hj=hi-(j-i)
hj=hi-j+i
hj+j=hi+i
*/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 640 KB Output is correct
2 Correct 13 ms 640 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 640 KB Output is correct
2 Correct 18 ms 768 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 692 KB Output is correct
2 Correct 19 ms 640 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 804 KB Output is correct
2 Correct 48 ms 768 KB Output is correct
3 Correct 22 ms 896 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 2052 KB Output is correct
2 Correct 244 ms 1660 KB Output is correct
3 Correct 276 ms 2036 KB Output is correct
4 Correct 356 ms 2292 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 453 ms 2684 KB Output is correct
2 Correct 535 ms 2932 KB Output is correct
3 Correct 329 ms 2796 KB Output is correct
4 Correct 366 ms 2792 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 873 ms 3312 KB Output is correct
2 Correct 686 ms 4776 KB Output is correct
3 Correct 416 ms 2540 KB Output is correct
4 Correct 916 ms 4452 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1016 ms 6116 KB Output is correct
2 Correct 1034 ms 5992 KB Output is correct
3 Correct 914 ms 4600 KB Output is correct
4 Correct 1203 ms 5636 KB Output is correct
5 Correct 242 ms 2120 KB Output is correct