oj.uz

Submission #225057

# Submission time Handle Problem Language Result Execution time Memory
225057 2020-04-19T08:41:24 Z NONAME Simfonija (COCI19_simfonija) C++17
44 / 110
 1000 ms 4088 KB 
#include <bits/stdc++.h>
#include <time.h>
//#include <random>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define pii pair <int, int>
#define pll pair <ll, ll>
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
#define re return
#define nins 4294967295
using namespace std;
typedef long long ll;
typedef long double ld;

//mt19937 rnd(0);

ll n, k, a[N], b[N], ans;
vector <pair <ll, int> > vec;

void solve() {
    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++)
        vec.pb({a[i] - b[i], i});

    sort(vec.begin(), vec.end());

    ans = oo;

    int i = -1;
    int j = n - k;

    while (i + 1 <= k) {
        int l = 0, r = n - 1;
        if (i != -1)
            l = i + 1;
        if (j != n)
            r = j - 1;

        ll cur = 0;

        for (int z = l; z <= r; z++)
            cur += abs(a[vec[z].sd] - vec[(l + r) / 2].ft - b[vec[z].sd]);

        ans = min(ans, cur);
        i++; j++;
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef _LOCAL
        in("input.txt");

        int t = 1;
//        cin >> t;
        for (int i = 1; i <= t; i++) {
            cout << "Test #" << i << elf;

            clock_t start_time = clock();

            solve();

            cerr.precision(4); cerr << fixed;
            cerr << elf;
            cerr << "Time :: " << ld(clock() - start_time) / CLOCKS_PER_SEC << elf;

            cout << elf;
        }
    #else
        int t = 1;
//        cin >> t;

        while (t--) {
            solve();
            cout << el;
        }
    #endif
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 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 44 ms 4088 KB Output is correct
2 Correct 43 ms 4080 KB Output is correct
3 Correct 42 ms 4084 KB Output is correct

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 4088 KB Output is correct
2 Correct 44 ms 4080 KB Output is correct
3 Correct 43 ms 4080 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 4080 KB Output is correct
2 Correct 42 ms 4084 KB Output is correct
3 Correct 43 ms 4088 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 4080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 4080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 4080 KB Output is correct
2 Execution timed out 1096 ms 4088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 4080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 4080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 4080 KB Time limit exceeded
2 Halted 0 ms 0 KB -