oj.uz

답안 #261526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261526 2020-08-11T20:24:52 Z leaked Simfonija (COCI19_simfonija) C++14
110 / 110
 75 ms 4412 KB 
//C.cpp
#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; }
template<typename T> bool umax(T& a, T b) {return a<b?a=b,1:0;}
template<typename T> bool umin(T& a, T b) {return b<a?a=b,1:0;}
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+2;
const int ppp=73;
//const int Y=1;
//const int X=0;
typedef pair<long long,int> pli;
//typedef tree<pli,null_type,less<pli>,rb_tree_tag,tree_order_statistics_node_update> o_st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
void bad(){
    cout<<"-1";
    exit(0);
}
int a[N],b[N];
int n,k;
ll pr[N];
int l,r;
ll ans=inf;
vector<ll>c;
ll get(int tl,int tr){
    return pr[tr] -(tl? pr[tl-1] : 0);
}
ll f(ll val){
    ll s=get(l,r);
    int pos=lower_bound(all(c),0)-c.begin();umax(pos,l);umin(pos,r+1);
    int pf=pos-l,ps=max(r-pos+1,0);
    if(val>0){
        s-=pf*1ll*abs(val);
        int o=lower_bound(all(c),-val)-c.begin();
        umax(o,l);umin(o,r);
        int col=pos-o;
        s+=2*1ll*(col*1ll*abs(val)-get(o,pos-1));
        s+=ps*1ll*abs(val);
//        debug()<<imie(col*1ll*abs(val))<<imie(get(o,pos-1));

    }else{
        s+=pf*1ll*abs(val);
        s-=ps*1ll*abs(val);
        int o=lower_bound(all(c),-val)-c.begin();
        umax(o,l);umin(o,r);
        int col=o-pos+1;
        s+=2*1ll*(col*1ll*abs(val)-get(pos,o));
    }
    return s;
}
ll rf(ll val){
    ll s=0;
    for(int i=l;i<=r;i++){
        s+=abs(val+c[i]);
        debug()<<imie(abs(val+c[i]))<<' ';
    }
    return s;
}
signed main()
{
    fast_io;
//    freopen("in.txt","r",stdin);
    cin>>n>>k;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=0;i<n;i++) cin>>b[i];
    for(int i=0;i<n;i++) c.p_b(a[i]-b[i]);
    c.p_b(inf);
    sort(all(c));pr[0]=abs(c[0]);
    for(int i=1;i<n;i++) {
        pr[i]=abs(c[i])+pr[i-1];
    }
//    debug()<<imie(c);
    l=0,r=n-1-k;
    while(r<n){
        int tm=(l+r+1)>>1;
        if(tm<n){
//                  debug()<<imie(rf(-c[tm]));
            umin(ans,f(-c[tm]));
            umin(ans,f(c[tm]));

//            debug()<<imie(ans);
        }
        --tm;
        if(~tm && tm<n) {
            umin(ans,f(c[tm]));
            umin(ans,f(-c[tm]));
//            debug()<<imie(ans);
        }
        r++;
        l++;
    }
    cout<<ans;
    return 0;
}
/*
212064

*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 4228 KB Output is correct
2 Correct 36 ms 4412 KB Output is correct
3 Correct 34 ms 4208 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 4208 KB Output is correct
2 Correct 37 ms 4336 KB Output is correct
3 Correct 35 ms 4212 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 4208 KB Output is correct
2 Correct 36 ms 4224 KB Output is correct
3 Correct 34 ms 4208 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 3576 KB Output is correct
2 Correct 49 ms 4280 KB Output is correct
3 Correct 48 ms 4208 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 4208 KB Output is correct
2 Correct 60 ms 4240 KB Output is correct
3 Correct 54 ms 4208 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 4292 KB Output is correct
2 Correct 48 ms 4212 KB Output is correct
3 Correct 53 ms 4336 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 4208 KB Output is correct
2 Correct 47 ms 4208 KB Output is correct
3 Correct 52 ms 4336 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 4208 KB Output is correct
2 Correct 75 ms 4208 KB Output is correct
3 Correct 42 ms 4336 KB Output is correct

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 4212 KB Output is correct
2 Correct 35 ms 4208 KB Output is correct
3 Correct 50 ms 4336 KB Output is correct