oj.uz

답안 #1054918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054918 2024-08-12T13:02:35 Z Zicrus 분수 공원 (IOI21_parks) C++17
15 / 100
 743 ms 206144 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);
    }
    unordered_set<ll> used;
    while (used.size() < edges.size()) {
        while (!q.empty()) {
            ll hash = q.front(); q.pop();
            if (poss[hash] != 1 || used.count(hash)) continue;
            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 (used.size() < edges.size() && twos.empty()) {
            throw;
            for (auto &e : poss) {
                if (e.second == 1) q.push(e.first);
                if (e.second >= 2) twos.insert(e.first);
            }
        }
        else if (used.size() < 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;
                    used.insert(edge);
                }
                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:180: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]
  180 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 743 ms 107368 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 6 ms 1856 KB Output is correct
27 Correct 8 ms 2396 KB Output is correct
28 Correct 199 ms 43708 KB Output is correct
29 Correct 395 ms 70304 KB Output is correct
30 Correct 501 ms 87280 KB Output is correct
31 Correct 723 ms 107380 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 348 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 1 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1596 KB Output is correct
45 Correct 197 ms 45160 KB Output is correct
46 Correct 308 ms 67776 KB Output is correct
47 Correct 381 ms 67468 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 743 ms 107368 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 6 ms 1856 KB Output is correct
27 Correct 8 ms 2396 KB Output is correct
28 Correct 199 ms 43708 KB Output is correct
29 Correct 395 ms 70304 KB Output is correct
30 Correct 501 ms 87280 KB Output is correct
31 Correct 723 ms 107380 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 348 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 1 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1596 KB Output is correct
45 Correct 197 ms 45160 KB Output is correct
46 Correct 308 ms 67776 KB Output is correct
47 Correct 381 ms 67468 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 360 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Runtime error 1 ms 348 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 475 ms 84992 KB Output is correct
21 Correct 615 ms 85764 KB Output is correct
22 Correct 487 ms 85112 KB Output is correct
23 Correct 405 ms 83488 KB Output is correct
24 Correct 78 ms 20676 KB Output is correct
25 Correct 411 ms 104708 KB Output is correct
26 Correct 411 ms 104264 KB Output is correct
27 Correct 534 ms 109884 KB Output is correct
28 Correct 470 ms 109124 KB Output is correct
29 Correct 524 ms 109248 KB Output is correct
30 Correct 450 ms 109120 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Runtime error 17 ms 11736 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct
17 Correct 619 ms 109388 KB Output is correct
18 Runtime error 452 ms 206144 KB Execution killed with signal 6
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 344 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 217 ms 54836 KB Output is correct
10 Correct 12 ms 5336 KB Output is correct
11 Correct 102 ms 29068 KB Output is correct
12 Correct 33 ms 8168 KB Output is correct
13 Correct 76 ms 23740 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 221 ms 54676 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 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 743 ms 107368 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 6 ms 1856 KB Output is correct
27 Correct 8 ms 2396 KB Output is correct
28 Correct 199 ms 43708 KB Output is correct
29 Correct 395 ms 70304 KB Output is correct
30 Correct 501 ms 87280 KB Output is correct
31 Correct 723 ms 107380 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 348 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 1 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1596 KB Output is correct
45 Correct 197 ms 45160 KB Output is correct
46 Correct 308 ms 67776 KB Output is correct
47 Correct 381 ms 67468 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 360 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Runtime error 1 ms 348 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -