| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 646724 |
2022-09-30T13:06:18 Z |
inksamurai |
Krov (COCI17_krov) |
C++17 |
|
1500 ms |
22116 KB |
#include <bits/stdc++.h>
// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
segtree() : segtree(0) {}
segtree(int n) : segtree(std::vector<S>(n, e())) {}
segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
return d[p + size];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
template <bool (*f)(S)> int max_right(int l) {
return max_right(l, [](S x) { return f(x); });
}
template <class F> int max_right(int l, F f) {
assert(0 <= l && l <= _n);
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, d[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*f)(S)> int min_left(int r) {
return min_left(r, [](S x) { return f(x); });
}
template <class F> int min_left(int r, F f) {
assert(0 <= r && r <= _n);
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(d[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
} // namespace atcoder
// cut here
using namespace std;
#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3SJjfN1 ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
struct coordinates{
vi xs;
void clear(){
xs.clear();
}
void add(int x){
xs.pb(x);
}
void affine(){
sort(xs.begin(),xs.end());
xs.erase(unique(xs.begin(),xs.end()),xs.end());
}
};
int op(int l,int r){return l+r;}
int e(){return 0;}
signed main(){
_3SJjfN1;
int n;
cin>>n;
vi a(n);
rep(i,n){
cin>>a[i];
}
// to the left i need
// x - pvt = y - i
// to the right i need
// x - y = i - pvt
// x + pvt = i + y
coordinates tmp;
rep(i,n){
tmp.add(a[i]-i);
tmp.add(a[i]+i);
}
tmp.affine();
const int m=sz(tmp.xs);
vi idsl(n),idsr(n);
rep(i,n){
{
int v=a[i]-i;
int j=lower_bound(tmp.xs.begin(),tmp.xs.end(),v)-tmp.xs.begin();
idsl[i]=j;
}
{
int v=a[i]+i;
int j=lower_bound(tmp.xs.begin(),tmp.xs.end(),v)-tmp.xs.begin();
idsr[i]=j;
}
}
atcoder::segtree<int,op,e> segl(m),cntl(m),segr(m),cntr(m);
auto af=[&](int pvt,int x)->int{
int res=0;
// to the left
int v=x-pvt;
// >=
int j=lower_bound(tmp.xs.begin(),tmp.xs.end(),v)-tmp.xs.begin();
if(j>=0 and j<sz(tmp.xs)){
res+=segl.prod(j,m)-cntl.prod(j,m)*v;
}
// <=
if(j>=0 and j<=sz(tmp.xs)){
res+=cntl.prod(0,j)*v-segl.prod(0,j);
}
// to the right
v=x+pvt;
j=lower_bound(tmp.xs.begin(),tmp.xs.end(),v)-tmp.xs.begin();
if(j>=0 and j<sz(tmp.xs)){
res+=segr.prod(j,m)-cntr.prod(j,m)*v;
}
// <=
if(j>=0 and j<=sz(tmp.xs)){
res+=cntr.prod(0,j)*v-segr.prod(0,j);
}
return res;
};
rep(i,n){
int v=a[i]+i;
int j=idsr[i];
segr.set(j,segr.get(j)+v);
cntr.set(j,cntr.get(j)+1);
}
const int inf=1e18;
int ans=inf;
rep(i,n){
int l=max(i+1,n-i),r=2e9;
while(r-l>3){
int ml=(2*l+r)/3;
int mr=(l+2*r)/3;
int fl=af(i,ml);
int fr=af(i,mr);
if(fl<fr){
r=mr;
}else{
l=ml;
}
}
int now=inf;
rng(j,l,r+1){
now=min(now,af(i,j));
}
if(now>ans){
break;
}
ans=now;
int v=a[i]+i;
int j=idsr[i];
segr.set(j,segr.get(j)-v);
cntr.set(j,cntr.get(j)-1);
v=a[i]-i;
j=idsl[i];
segl.set(j,segl.get(j)+v);
cntl.set(j,cntl.get(j)+1);
}
print(ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
340 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
724 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
980 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
724 KB |
Output is correct |
| 2 |
Correct |
1 ms |
724 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
77 ms |
1628 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
489 ms |
5736 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
20 ms |
6352 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1151 ms |
7672 KB |
Output is correct |
| 2 |
Correct |
42 ms |
21416 KB |
Output is correct |
| 3 |
Correct |
20 ms |
6484 KB |
Output is correct |
| 4 |
Execution timed out |
1529 ms |
12924 KB |
Time limit exceeded |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
80 ms |
22116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
