| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 259226 |
2020-08-07T12:33:37 Z |
leaked |
Krov (COCI17_krov) |
C++14 |
|
1500 ms |
10972 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 = 1e18,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>kek1,kek2;
int f[N],s[N];
/// j<i , j>i
vector<vector<ll>>l(2,vector<ll>(N));
vector<vector<ll>>r(2,vector<ll>(N));
void add(vector<ll> &who,int pos,int val){
++pos;
while(pos<N){
who[pos]+=val;
pos+=pos&-pos;
}
}
ll get(const vector<ll> &who,int pos){
++pos;
ll ans=0;
while(pos>0){
ans+=who[pos];
pos-=pos&-pos;
}
return ans;
}
int gtl(ll val){
return upper_bound(all(kek1),val)-kek1.begin()-1;
}
int gtr(ll val){
return upper_bound(all(kek2),val)-kek2.begin()-1;
}
ll ff(ll val,int i){
int pl=gtl(val-i);int pr=gtr(val+i);
///меньшие слева
ll a1=get(l[0],pl-1)*1ll*(val-i)-get(l[1],pl-1);
// debug()<<imie(get(l[0],pl-1)*1ll*(val-i))<<imie(get(l[1],pl-1));
///большие слева
int psd=gtl(N);
a1+=(get(l[1],psd)-get(l[1],pl))-(get(l[0],psd)-get(l[0],pl))*1ll*(val-i);
// debug()<<imie((get(l[1],psd)-get(l[1],pl)))<<imie((get(l[0],psd)-get(l[0],pl))*1ll*(val-i));
ll a2=get(r[0],pr-1)*1ll*(val+i)-get(r[1],pr-1);
// debug()<<imie(get(r[0],pr-1)*1ll*(val+i))<<imie(get(r[1],pr-1));
psd=gtr(N);
a2+=(get(r[1],psd)-get(r[1],pr))-(get(r[0],psd)-get(r[0],pr))*1ll*(val+i);
if(pl<0 || pr<0){return inf;}
// debug()<<imie((get(r[1],psd)-get(r[1],pr)))<<imie((get(r[0],psd)-get(r[0],pr)));
return a1+a2;
}
signed main()
{
// freopen("in.txt","r",stdin);
fast_io;
int n;
cin>>n;
vector<int>a(n);
for(auto &z : a){
cin>>z;
}
for(int i=0;i<n;i++){
kek1.p_b(a[i]-i);
kek2.p_b(a[i]+i);
}
sort(all(kek1));sort(all(kek2));kek1.erase(unique(all(kek1)),kek1.end());kek2.erase(unique(all(kek2)),kek2.end());
// debug()<<imie(kek1)<<imie(kek2);
for(int i=0;i<n;i++){
int pr=gtr(a[i]+i);
add(r[0],pr,1);
add(r[1],pr,a[i]+i);
}
ll ans=inf;
for(int i=0;i<n;i++){
int pl=gtl(a[i]-i),pr=gtr(a[i]+i);
///delright
add(r[0],pr,-1);add(r[1],pr,-a[i]-i);
///addleft
add(l[0],pl,1);add(l[1],pl,a[i]-i);
int l=max(i+1,n-i),r=1e9+2;
while(r-l>=10){
int tr=r-(r-l)/3;
int tl=l+(r-l)/3;
if(ff(tr,i)>ff(tl,i))r=tr;
else l=tl;
}
for(int j=l;j<=r;j++){
umin(ans,ff(j,i));
}
}
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
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
8164 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
8164 KB |
Output is correct |
| 2 |
Incorrect |
26 ms |
8164 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
35 ms |
8164 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
8164 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
53 ms |
8164 KB |
Output is correct |
| 2 |
Correct |
45 ms |
8164 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
51 ms |
8164 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
549 ms |
8280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
880 ms |
8420 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
688 ms |
10084 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1570 ms |
10972 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
