oj.uz

Submission #225023

# Submission time Handle Problem Language Result Execution time Memory
225023 2020-04-19T08:12:16 Z ne4eHbKa Simfonija (COCI19_simfonija) C++17
44 / 110
 381 ms 1656 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, a[N], b[N], p[N];

ll get(int x) {
    fo(n) p[i] = abs(a[i] - b[i] + x);
    sort(p, p + n);
    ll ans = 0;
    fo(n - k) ans += p[i];
    re ans;
}

void solve() {
    cin >> n >> k;
    fo(n) cin >> a[i];
    fo(n) cin >> b[i];
    int l = -1e6, r = +1e6;
    while(l < r) {
        int m0 = (l + r) >> 1;
        int m1 = m0 + 1;
        ll s0 = get(m0), s1 = get(m1);
        s0 < s1 ? r = m0 :
        s0 > s1 ? l = m1 :
            l = r = m0;
    }
    cout << get(l) << 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

# Verdict Execution time Memory Grader output
1 Correct 4 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

# Verdict Execution time Memory Grader output
1 Correct 346 ms 1656 KB Output is correct
2 Correct 256 ms 1564 KB Output is correct
3 Correct 157 ms 1528 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 351 ms 1528 KB Output is correct
2 Correct 258 ms 1656 KB Output is correct
3 Correct 155 ms 1528 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 1656 KB Output is correct
2 Correct 247 ms 1528 KB Output is correct
3 Correct 163 ms 1528 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 107 ms 1536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 378 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 1616 KB Output is correct
2 Incorrect 193 ms 1528 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 1632 KB Output is correct
2 Incorrect 198 ms 1528 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 327 ms 1656 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 201 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -