oj.uz

Submission #396369

# Submission time Handle Problem Language Result Execution time Memory
396369 2021-04-29T20:50:58 Z 4fecta Road Construction (JOI21_road_construction) C++17
38 / 100
 2829 ms 470012 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse4")

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

struct piii {
    int f, s, boom;
};

const int MN = 250005;

int n, k, perm[MN], rev[MN];
pii a[MN];

int cost(pii p, pii q) {
    return abs(p.f - q.f) + abs(p.s - q.s);
}

bool cmp(piii p, piii q) {
    return cost(a[p.f], a[p.s]) > cost(a[q.f], a[q.s]);
}

bool cmp1(int p, int q) {
    if (a[p].s != a[q].s) return a[p].s < a[q].s;
    return a[p].f < a[q].f;
}

int32_t main() {
    boost();

    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i].f >> a[i].s, perm[i] = i;
    sort(perm + 1, perm + n + 1, cmp1);
    for (int i = 1; i <= n; i++) rev[perm[i]] = i;
    //for (int i = 1; i <= n; i++) printf("%d\n", perm[i]);
    if (n <= 1000) {
        vector<int> v;
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                v.push_back(cost(a[i], a[j]));
            }
        }
        sort(v.begin(), v.end());
        for (int i = 1; i <= k; i++) printf("%lld\n", v[i - 1]);
        return 0;
    }
    sort(a + 1, a + n + 1);
    priority_queue<piii, vector<piii>, decltype(&cmp)> q(cmp);
    set<pii> vis;
    for (int gap = 1; gap <= 20; gap++) {
        for (int i = gap + 1; i <= n; i++) q.push({i - gap, i, 0}), vis.insert({i - gap, i});
    }
    for (int gap = 1; gap <= 20; gap++) {
        //for (int i = gap + 1; i <= n; i++) if (!vis.count({min(perm[i - gap], perm[i]), max(perm[i - gap], perm[i])})) q.push({perm[i - gap], perm[i], 1}), vis.insert({min(perm[i - gap], perm[i]), max(perm[i - gap], perm[i])});
    }
    while (q.size() && k--) {
        piii i = q.top(); q.pop();
        printf("%lld\n", cost(a[i.f], a[i.s]));
        if (i.boom) continue;
        if (i.s < n && !vis.count({i.f, i.s + 1})) q.push({i.f, i.s + 1, 0}), vis.insert({i.f, i.s + 1});
        if (i.f > 1 && !vis.count({i.f - 1, i.s})) q.push({i.f - 1, i.s, 0}), vis.insert({i.f - 1, i.s});
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 6964 KB Output is correct
2 Correct 84 ms 6996 KB Output is correct
3 Correct 57 ms 5012 KB Output is correct
4 Correct 57 ms 5016 KB Output is correct
5 Correct 81 ms 5808 KB Output is correct
6 Correct 24 ms 4616 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2795 ms 467792 KB Output is correct
2 Correct 2829 ms 469796 KB Output is correct
3 Correct 57 ms 4896 KB Output is correct
4 Correct 2146 ms 469884 KB Output is correct
5 Correct 2008 ms 469788 KB Output is correct
6 Correct 2025 ms 469832 KB Output is correct
7 Correct 2037 ms 469756 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1947 ms 467860 KB Output is correct
2 Correct 1975 ms 469836 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1713 ms 470012 KB Output is correct
5 Correct 1758 ms 469884 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1947 ms 467860 KB Output is correct
2 Correct 1975 ms 469836 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1713 ms 470012 KB Output is correct
5 Correct 1758 ms 469884 KB Output is correct
6 Correct 1970 ms 469816 KB Output is correct
7 Correct 1966 ms 467704 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1968 ms 467772 KB Output is correct
11 Correct 1696 ms 467732 KB Output is correct
12 Correct 1730 ms 467796 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 6964 KB Output is correct
2 Correct 84 ms 6996 KB Output is correct
3 Correct 57 ms 5012 KB Output is correct
4 Correct 57 ms 5016 KB Output is correct
5 Correct 81 ms 5808 KB Output is correct
6 Correct 24 ms 4616 KB Output is correct
7 Incorrect 1661 ms 179932 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 6964 KB Output is correct
2 Correct 84 ms 6996 KB Output is correct
3 Correct 57 ms 5012 KB Output is correct
4 Correct 57 ms 5016 KB Output is correct
5 Correct 81 ms 5808 KB Output is correct
6 Correct 24 ms 4616 KB Output is correct
7 Correct 2795 ms 467792 KB Output is correct
8 Correct 2829 ms 469796 KB Output is correct
9 Correct 57 ms 4896 KB Output is correct
10 Correct 2146 ms 469884 KB Output is correct
11 Correct 2008 ms 469788 KB Output is correct
12 Correct 2025 ms 469832 KB Output is correct
13 Correct 2037 ms 469756 KB Output is correct
14 Correct 1947 ms 467860 KB Output is correct
15 Correct 1975 ms 469836 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1713 ms 470012 KB Output is correct
18 Correct 1758 ms 469884 KB Output is correct
19 Correct 1970 ms 469816 KB Output is correct
20 Correct 1966 ms 467704 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1968 ms 467772 KB Output is correct
24 Correct 1696 ms 467732 KB Output is correct
25 Correct 1730 ms 467796 KB Output is correct
26 Incorrect 1661 ms 179932 KB Output isn't correct
27 Halted 0 ms 0 KB -