oj.uz

Submission #1054887

# Submission time Handle Problem Language Result Execution time Memory
1054887 2024-08-12T12:53:30 Z Zicrus Fountain Parks (IOI21_parks) C++17
15 / 100
 3500 ms 110284 KB 
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
 
typedef long long ll;
 
ll n;
 
vector<ll> lnk;
vector<ll> sz;
 
ll find(ll a) {
    if (a != lnk[a]) lnk[a] = find(lnk[a]);
    return lnk[a];
}
 
bool unite(ll a, ll b) {
    a = find(a); b = find(b);
    if (a == b) return false;
    if (sz[a] > sz[b]) swap(a, b);
    lnk[a] = b;
    sz[b] += sz[a];
    return true;
}
 
int construct_roads(vector<int> x, vector<int> y) {
    n = x.size();
    mt19937 mt(743);
    vector<pair<pair<ll, ll>, ll>> coords(n);
    for (int i = 0; i < n; i++) coords[i] = {{x[i], y[i]}, i};
    shuffle(coords.begin(), coords.end(), mt);
    for (int i = 0; i < n; i++) {
        x[i] = coords[i].first.first;
        y[i] = coords[i].first.second;
    }
    lnk = vector<ll>(n);
    sz = vector<ll>(n, 1);
    for (int i = 0; i < n; i++) lnk[i] = i;
    unordered_map<ll, ll> pts;
    vector<pair<ll, ll>> edges;
    unordered_set<ll> hasEdge;
    for (int i = 0; i < n; i++) {
        ll hash = ((ll)x[i] << 31) | (ll)y[i];
        pts[hash] = i;
    }
    for (ll i = 0; i < n; i++) {
        ll hashL = (((ll)x[i]-2) << 31) | ((ll)y[i]);
        if (pts.count(hashL)) {
            ll hash = (min(i, pts[hashL]) << 31) | max(i, pts[hashL]);
            if (!hasEdge.count(hash)) {
                edges.push_back({i, pts[hashL]});
                hasEdge.insert(hash);
            }
        }
        ll hashR = (((ll)x[i]+2) << 31) | ((ll)y[i]);
        if (pts.count(hashR)) {
            ll hash = (min(i, pts[hashR]) << 31) | max(i, pts[hashR]);
            if (!hasEdge.count(hash)) {
                edges.push_back({i, pts[hashR]});
                hasEdge.insert(hash);
            }
        }
        ll hashD = (((ll)x[i]) << 31) | ((ll)y[i]-2);
        if (pts.count(hashD)) {
            ll hash = (min(i, pts[hashD]) << 31) | max(i, pts[hashD]);
            if (!hasEdge.count(hash)) {
                edges.push_back({i, pts[hashD]});
                hasEdge.insert(hash);
            }
        }
        ll hashU = (((ll)x[i]) << 31) | ((ll)y[i]+2);
        if (pts.count(hashU)) {
            ll hash = (min(i, pts[hashU]) << 31) | max(i, pts[hashU]);
            if (!hasEdge.count(hash)) {
                edges.push_back({i, pts[hashU]});
                hasEdge.insert(hash);
            }
        }
    }
 
    unordered_map<ll, ll> poss;
    unordered_set<ll> twos;
    unordered_map<ll, ll> lnk, lnkU;
    vector<pair<ll, ll>> edgeHashes(edges.size());
    for (int i = 0; i < edges.size(); i++) {
        auto e = edges[i];
        ll midX = (x[e.first] + x[e.second]) / 2;
        ll midY = (y[e.first] + y[e.second]) / 2;
        ll leftX = midX - (midY - y[e.second]);
        ll leftY = midY + (midX - x[e.second]);
        ll rightX = midX + (midY - y[e.second]);
        ll rightY = midY - (midX - x[e.second]);
        ll hashL = (leftX << 31) | leftY;
        ll hashR = (rightX << 31) | rightY;
        if (poss[hashL] == 2) twos.erase(hashL);
        poss[hashL]++;
        if (poss[hashL] == 2) twos.insert(hashL);
        if (poss[hashR] == 2) twos.erase(hashR);
        poss[hashR]++;
        if (poss[hashR] == 2) twos.insert(hashR);
        lnk[hashL] ^= i;
        lnk[hashR] ^= i;
        lnkU[hashL] = i;
        lnkU[hashR] = i;
        edgeHashes[i] = {hashL, hashR};
    }
 
    vector<int> a(edges.size()), b(edges.size());
    queue<ll> q;
    for (auto &e : poss) {
        if (e.second != 1) continue;
        q.push(e.first);
    }
    ll cnt = 0;
    unordered_set<ll> used;
    while (cnt < edges.size()) {
        while (!q.empty()) {
            ll hash = q.front(); q.pop();
            if (poss[hash] != 1 || used.count(hash)) continue;
            cnt++;
            ll id = lnk[hash];
            a[id] = hash >> 31;
            b[id] = hash & ~(1 << 31);
            used.insert(id);
            if (--poss[edgeHashes[id].first] == 1) { q.push(edgeHashes[id].first); twos.erase(edgeHashes[id].first); }
            if (poss[edgeHashes[id].first] == 2) twos.insert(edgeHashes[id].first);
            if (--poss[edgeHashes[id].second] == 1) { q.push(edgeHashes[id].second); twos.erase(edgeHashes[id].second); }
            if (poss[edgeHashes[id].second] == 2) twos.insert(edgeHashes[id].second);
            lnk[edgeHashes[id].first] ^= id;
            lnk[edgeHashes[id].second] ^= id;
        }
        if (cnt < edges.size() && !twos.empty()) {
            ll v = *twos.begin();
            twos.erase(twos.begin());
            for (int i = 0; i < 1; i = 10) {
                i = lnkU[v];
                if (used.count(i)) continue;
                auto e = edges[i];
                ll midX = (x[e.first] + x[e.second]) / 2;
                ll midY = (y[e.first] + y[e.second]) / 2;
                if (abs(midX - (v >> 31)) + abs(midY - (v & ~(1 << 31))) > 1) continue;
                a[i] = v >> 31;
                b[i] = v & ~(1 << 31);
                poss[v] = 0;
                ll otherX = a[i] + 2 * (midX - a[i]);
                ll otherY = b[i] + 2 * (midY - b[i]);
                ll otherHash = (otherX << 31) | otherY;
                if (poss[otherHash] == 2) twos.erase(otherHash);
                poss[otherHash]--;
                if (poss[otherHash] == 2) twos.insert(otherHash);
                lnk[otherHash] ^= i;
                while (poss[otherHash == 1]) {
                    ll edge = lnk[otherHash];
                    auto e = edges[edge];
                    ll midX = (x[e.first] + x[e.second]) / 2;
                    ll midY = (y[e.first] + y[e.second]) / 2;
                    a[edge] = otherHash >> 31;
                    b[edge] = otherHash & ~(1 << 31);
                    ll otherX = a[edge] + 2 * (midX - a[edge]);
                    ll otherY = b[edge] + 2 * (midY - b[edge]);
                    otherHash = (otherX << 31) | otherY;
                    if (poss[otherHash] == 2) twos.erase(otherHash);
                    poss[otherHash]--;
                    if (poss[otherHash] == 2) twos.insert(otherHash);
                    lnk[otherHash] ^= edge;
                    cnt++;
                    used.insert(edge);
                }
                cnt++;
                used.insert(i);
                break;
            }
        }
    }
 
    vector<int> u, v;
    for (int i = 0; i < edges.size(); i++) {
        u.push_back(coords[edges[i].first].second);
        v.push_back(coords[edges[i].second].second);
        unite(edges[i].first, edges[i].second);
    }
 
    if (sz[find(0)] < n) return 0;
 
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:116:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     while (cnt < edges.size()) {
      |            ~~~~^~~~~~~~~~~~~~
parks.cpp:132:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |         if (cnt < edges.size() && !twos.empty()) {
      |             ~~~~^~~~~~~~~~~~~~
parks.cpp:177:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  177 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 647 ms 108336 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 1112 KB Output is correct
26 Correct 4 ms 1880 KB Output is correct
27 Correct 5 ms 2348 KB Output is correct
28 Correct 186 ms 43712 KB Output is correct
29 Correct 328 ms 71032 KB Output is correct
30 Correct 579 ms 87152 KB Output is correct
31 Correct 712 ms 108768 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 420 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1628 KB Output is correct
45 Correct 173 ms 45100 KB Output is correct
46 Correct 317 ms 67944 KB Output is correct
47 Correct 344 ms 67832 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 647 ms 108336 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 1112 KB Output is correct
26 Correct 4 ms 1880 KB Output is correct
27 Correct 5 ms 2348 KB Output is correct
28 Correct 186 ms 43712 KB Output is correct
29 Correct 328 ms 71032 KB Output is correct
30 Correct 579 ms 87152 KB Output is correct
31 Correct 712 ms 108768 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 420 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1628 KB Output is correct
45 Correct 173 ms 45100 KB Output is correct
46 Correct 317 ms 67944 KB Output is correct
47 Correct 344 ms 67832 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Execution timed out 3597 ms 348 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 517 ms 85576 KB Output is correct
21 Correct 586 ms 84972 KB Output is correct
22 Correct 518 ms 85588 KB Output is correct
23 Correct 416 ms 84432 KB Output is correct
24 Correct 68 ms 20808 KB Output is correct
25 Correct 391 ms 104268 KB Output is correct
26 Correct 434 ms 103840 KB Output is correct
27 Correct 468 ms 109236 KB Output is correct
28 Correct 467 ms 109128 KB Output is correct
29 Correct 437 ms 109124 KB Output is correct
30 Correct 449 ms 109008 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Execution timed out 3578 ms 5848 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct
17 Correct 581 ms 110284 KB Output is correct
18 Execution timed out 3567 ms 101708 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 244 ms 54884 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 88 ms 29064 KB Output is correct
12 Correct 19 ms 8172 KB Output is correct
13 Correct 70 ms 23656 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 246 ms 54728 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 647 ms 108336 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 1112 KB Output is correct
26 Correct 4 ms 1880 KB Output is correct
27 Correct 5 ms 2348 KB Output is correct
28 Correct 186 ms 43712 KB Output is correct
29 Correct 328 ms 71032 KB Output is correct
30 Correct 579 ms 87152 KB Output is correct
31 Correct 712 ms 108768 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 420 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1628 KB Output is correct
45 Correct 173 ms 45100 KB Output is correct
46 Correct 317 ms 67944 KB Output is correct
47 Correct 344 ms 67832 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Execution timed out 3597 ms 348 KB Time limit exceeded
52 Halted 0 ms 0 KB -