oj.uz

답안 #893576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893576 2023-12-27T07:10:11 Z vjudge1 Road Construction (JOI21_road_construction) C++17
5 / 100
 10000 ms 66904 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
    return a > b && (a = b) == b;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
    return a < b && (a = b) == b;
}
const int inf = 1e9 + 7;
const int INF = 1e18 + 7;
const int mod = 998244353;

int n, k;
vector<int> x, y;

int dist(int i, int j) {
    return abs(x[i] - x[j]) + abs(y[i] - y[j]);
}

auto get(int l, int r) {
    multiset<int> ret;
    if (l >= r) return ret;
    int mid = (l + r) / 2;
    multiset<int> L = get(l, mid - 1);
    multiset<int> R = get(mid + 1, r);
    for (int i = l; i <= r; ++i) {
        if (i == mid) continue;
        ret.insert(dist(i, mid));
        if (size(ret) > k) ret.erase(--ret.end());
    }
    for (int i = l; i < mid; ++i) {
        for (int j = mid + 1; j <= r; ++j) {
            ret.insert(dist(i, j));
            if (size(ret) > k) ret.erase(--ret.end());
        }
    }
    for (int i : L) {
        ret.insert(i);
        if (size(ret) > k) ret.erase(--ret.end());
    }
    for (int i : R) {
        ret.insert(i);
        if (size(ret) > k) ret.erase(--ret.end());
    }
    return ret;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    x.resize(n), y.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i];
    }
    vector<pair<int, int>> v;
    for (int i = 0; i < n; ++i) {
        v.emplace_back(x[i], y[i]);
    }
    sort(all(v));
    for (int i = 0; i < n; ++i) {
        x[i] = v[i].first, y[i] = v[i].second;
    }
    multiset<int> res = get(0, n - 1);
    for (int i : res) {
        cout << i << '\n';
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 26624 KB Output is correct
2 Correct 256 ms 26464 KB Output is correct
3 Correct 106 ms 20564 KB Output is correct
4 Correct 108 ms 20560 KB Output is correct
5 Correct 230 ms 25240 KB Output is correct
6 Correct 39 ms 1080 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10105 ms 66904 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10016 ms 9164 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10016 ms 9164 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 26624 KB Output is correct
2 Correct 256 ms 26464 KB Output is correct
3 Correct 106 ms 20564 KB Output is correct
4 Correct 108 ms 20560 KB Output is correct
5 Correct 230 ms 25240 KB Output is correct
6 Correct 39 ms 1080 KB Output is correct
7 Execution timed out 10084 ms 62168 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 26624 KB Output is correct
2 Correct 256 ms 26464 KB Output is correct
3 Correct 106 ms 20564 KB Output is correct
4 Correct 108 ms 20560 KB Output is correct
5 Correct 230 ms 25240 KB Output is correct
6 Correct 39 ms 1080 KB Output is correct
7 Execution timed out 10105 ms 66904 KB Time limit exceeded
8 Halted 0 ms 0 KB -