#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100001
ll t[N << 2];
ll lazy[N << 2];
void build(ll v, ll tl, ll tr, ll arr[]){
if(tl == tr){
t[v] = arr[tl];
return;
}
ll tm = (tl+tr)>>1;
build(v<<1,tl,tm,arr);
build(v<<1|1,tm+1,tr,arr);
t[v] = t[v<<1] + t[v<<1|1];
}
void push(ll v, ll tl, ll tr){
if(lazy[v]){
ll tm = (tl+tr)>>1;
t[v<<1] += (tm-tl+1)*lazy[v];
t[v<<1|1] += (tr-tm)*lazy[v];
lazy[v<<1] += lazy[v];
lazy[v<<1|1] += lazy[v];
lazy[v] = 0;
}
}
void modify(ll v, ll tl, ll tr, ll l, ll r, ll val){
if(l > r) return;
if(tl == l && tr == r){
lazy[v] += val;
t[v] += val*(tr-tl+1);
return;
}
push(v,tl,tr);
ll tm = (tl+tr)>>1;
modify(v << 1,tl,tm,l,min(tm,r),val);
modify(v << 1 | 1,tm+1,tr,max(l,tm+1),r,val);
t[v] = t[v<<1] + t[v<<1|1];
}
ll query(ll v, ll tl, ll tr, ll l, ll r){
/* whatis(mp(tl,tr)) */
/* whatis(t[v]) */
if(l > r) return 0;
if(tl == l && tr == r){
return t[v];
}
push(v,tl,tr);
ll tm = (tl+tr)>>1;
return query(v<<1,tl,tm,l,min(tm,r)) + query(v<<1|1,tm+1,tr,max(l,tm+1),r);
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n,k;
sc(n,k);
ll a[n];
ll tmp[n];
GET(tmp);
ll cr;
FOR(i,0,n){
sc(cr);
a[i] = tmp[i]-cr;
}
sort(a,a+n);
int dec = max((ll)0,a[n-1]+2);
FORR(i,a) i -= dec;
/* whatis(a[0]) */
build(1,0,n-1,a);
ll bord = 0; //first element with positive delta, n if none
while(bord < n && a[bord] < 0) ++bord;
assert(bord == n);
ll ans = LONG_LONG_MAX;
int xdd = 0;
int prew = k-1, sufw = n;
//wywalam do prew włącznie id 0, do sufw włącznie od n-1
int ile = 0;
while(bord || ++xdd < 5){
modify(1,0,n-1,0,n-1,1);
++ile;
/* while(bord && query(1,0,n-1,bord-1,bord-1) >= 0) --bord; */
while(bord && a[bord-1]+ile >= 0) --bord;
ll wh = 0;
if(bord)
wh += -query(1,0,n-1,0,bord-1);
if(bord < n)
wh += query(1,0,n-1,bord,n-1);
while(~prew && -(a[prew]+ile) < a[sufw-1]+ile) --prew, --sufw;
if(~prew)
wh += query(1,0,n-1,0,prew);
if(sufw < n)
wh -= query(1,0,n-1,sufw,n-1);
ans = min(ans,wh);
}
cout << ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
291 ms |
6028 KB |
Output is correct |
| 2 |
Correct |
268 ms |
5624 KB |
Output is correct |
| 3 |
Correct |
251 ms |
4196 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
324 ms |
6040 KB |
Output is correct |
| 2 |
Correct |
291 ms |
5556 KB |
Output is correct |
| 3 |
Correct |
253 ms |
4384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
281 ms |
6120 KB |
Output is correct |
| 2 |
Correct |
288 ms |
5624 KB |
Output is correct |
| 3 |
Correct |
224 ms |
4216 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
4096 KB |
Output is correct |
| 2 |
Correct |
306 ms |
4132 KB |
Output is correct |
| 3 |
Correct |
467 ms |
4864 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
461 ms |
6120 KB |
Output is correct |
| 2 |
Correct |
536 ms |
6192 KB |
Output is correct |
| 3 |
Correct |
536 ms |
6164 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
439 ms |
4216 KB |
Output is correct |
| 2 |
Correct |
444 ms |
4728 KB |
Output is correct |
| 3 |
Correct |
512 ms |
6244 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
489 ms |
6004 KB |
Output is correct |
| 2 |
Correct |
523 ms |
4856 KB |
Output is correct |
| 3 |
Correct |
485 ms |
6080 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
443 ms |
6008 KB |
Output is correct |
| 2 |
Correct |
776 ms |
6016 KB |
Output is correct |
| 3 |
Correct |
468 ms |
6136 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
383 ms |
4728 KB |
Output is correct |
| 2 |
Correct |
458 ms |
4592 KB |
Output is correct |
| 3 |
Correct |
559 ms |
6200 KB |
Output is correct |
