oj.uz

Submission #396368

# Submission time Handle Problem Language Result Execution time Memory
396368 2021-04-29T20:50:18 Z 4fecta Road Construction (JOI21_road_construction) C++17
5 / 100
 10000 ms 927456 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 83 ms 6984 KB Output is correct
2 Correct 82 ms 6968 KB Output is correct
3 Correct 56 ms 5048 KB Output is correct
4 Correct 59 ms 5048 KB Output is correct
5 Correct 77 ms 5824 KB Output is correct
6 Correct 24 ms 4548 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 6984 KB Output is correct
2 Correct 82 ms 6968 KB Output is correct
3 Correct 56 ms 5048 KB Output is correct
4 Correct 59 ms 5048 KB Output is correct
5 Correct 77 ms 5824 KB Output is correct
6 Correct 24 ms 4548 KB Output is correct
7 Incorrect 5141 ms 351808 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 6984 KB Output is correct
2 Correct 82 ms 6968 KB Output is correct
3 Correct 56 ms 5048 KB Output is correct
4 Correct 59 ms 5048 KB Output is correct
5 Correct 77 ms 5824 KB Output is correct
6 Correct 24 ms 4548 KB Output is correct
7 Execution timed out 10124 ms 927368 KB Time limit exceeded
8 Halted 0 ms 0 KB -