oj.uz

답안 #225055

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225055 2020-04-19T08:39:13 Z ne4eHbKa Simfonija (COCI19_simfonija) C++17
110 / 110
 42 ms 3448 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define ip2(x) (1 << (x))
#define lp2(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 1e9 + 7;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = lp2(63 - __builtin_clzll(b)); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e5 + 5;

int n, k;
ll p[N], a[N];

ll sum(ll l, ll r) {
    if(l > r) re 0;
    re p[r + 1] - p[l];
}

void solve() {
    cin >> n >> k;
    if(k == n) re void(cout << "0\n");
    fo(n) cin >> a[i];
    fo(n) {
        ll b; cin >> b;
        a[i] -= b;
    }
    ll v = *min_element(a, a + n);
    fo(n) a[i] -= v - 1;
    sort(a, a + n);
    k = n - k;
    partial_sum(a, a + n, p + 1);
    ll ans = +OO;
    for(int l = 0; l + k <= n; ++l) {
        int r = l + k - 1;
        int m = (l + r) >> 1;
        umin(ans, a[m] * (m - l + 1) - sum(l, m) +
                  (m < r ? sum(m + 1, r) - a[m] * (r - m) : 0));
    }
    cout << ans << endl;
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
        cerr << test << " {\n";
        solve();
        cerr << "}\n\n";
    }
#else
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

simfonija.cpp:5:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
11.0 / 11.0

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

Subtask #1
11.0 / 11.0

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 1912 KB Output is correct
2 Correct 37 ms 1912 KB Output is correct
3 Correct 33 ms 1912 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 1912 KB Output is correct
2 Correct 39 ms 1912 KB Output is correct
3 Correct 34 ms 1912 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 1912 KB Output is correct
2 Correct 33 ms 1912 KB Output is correct
3 Correct 35 ms 1912 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 1912 KB Output is correct
2 Correct 40 ms 3320 KB Output is correct
3 Correct 40 ms 3320 KB Output is correct

Subtask #7
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1912 KB Output is correct
2 Correct 37 ms 1912 KB Output is correct
3 Correct 39 ms 3448 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 1912 KB Output is correct
2 Correct 42 ms 1912 KB Output is correct
3 Correct 39 ms 1948 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 1912 KB Output is correct
2 Correct 40 ms 1912 KB Output is correct
3 Correct 41 ms 3320 KB Output is correct

Subtask #10
11.0 / 11.0

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