oj.uz

답안 #1054813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054813 2024-08-12T12:21:27 Z Zicrus 분수 공원 (IOI21_parks) C++17
15 / 100
 3500 ms 95608 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_map<ll, ll> lnk;
    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;
        poss[hashL]++;
        poss[hashR]++;
        lnk[hashL] ^= i;
        lnk[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);
            if (--poss[edgeHashes[id].second] == 1) q.push(edgeHashes[id].second);
            lnk[edgeHashes[id].first] ^= id;
            lnk[edgeHashes[id].second] ^= id;
        }
        if (cnt < edges.size()) {
            ll v = 0;
            for (auto &e : poss) {
                if (e.second != 2) continue;
                v = e.first;
                break;
            }
            for (int i = 0; i < edges.size(); i++) {
                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);
                cnt++;
                used.insert(i);
                break;
            }
 
            //
            poss.clear();
            lnk.clear();
            for (int i = 0; i < edges.size(); i++) {
                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;
                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;
                poss[hashL]++;
                poss[hashR]++;
                lnk[hashL] ^= i;
                lnk[hashR] ^= i;
            }
            for (int i = 0; i < edges.size(); i++) {
                if (!used.count(i)) continue;
                ll hash = ((ll)a[i] << 31) | (ll)b[i];
                poss[hash] = 0;
            }
            for (auto &e : poss) {
                if (e.second != 1) continue;
                q.push(e.first);
            }
        }
    }
 
    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:84: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]
   84 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:109: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]
  109 |     while (cnt < edges.size()) {
      |            ~~~~^~~~~~~~~~~~~~
parks.cpp:123: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]
  123 |         if (cnt < edges.size()) {
      |             ~~~~^~~~~~~~~~~~~~
parks.cpp:130:31: 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]
  130 |             for (int i = 0; i < edges.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
parks.cpp:146:31: 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]
  146 |             for (int i = 0; i < edges.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
parks.cpp:162:31: 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]
  162 |             for (int i = 0; i < edges.size(); i++) {
      |                             ~~^~~~~~~~~~~~~~
parks.cpp:175: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]
  175 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 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 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 447 ms 95328 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 3 ms 1628 KB Output is correct
27 Correct 4 ms 2392 KB Output is correct
28 Correct 131 ms 38676 KB Output is correct
29 Correct 275 ms 62176 KB Output is correct
30 Correct 330 ms 77064 KB Output is correct
31 Correct 438 ms 95608 KB Output is correct
32 Correct 0 ms 344 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 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 2 ms 1372 KB Output is correct
45 Correct 140 ms 39612 KB Output is correct
46 Correct 227 ms 57280 KB Output is correct
47 Correct 212 ms 58816 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 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 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 447 ms 95328 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 3 ms 1628 KB Output is correct
27 Correct 4 ms 2392 KB Output is correct
28 Correct 131 ms 38676 KB Output is correct
29 Correct 275 ms 62176 KB Output is correct
30 Correct 330 ms 77064 KB Output is correct
31 Correct 438 ms 95608 KB Output is correct
32 Correct 0 ms 344 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 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 2 ms 1372 KB Output is correct
45 Correct 140 ms 39612 KB Output is correct
46 Correct 227 ms 57280 KB Output is correct
47 Correct 212 ms 58816 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 436 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Execution timed out 3571 ms 77772 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 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 281 ms 75596 KB Output is correct
21 Correct 313 ms 75376 KB Output is correct
22 Correct 311 ms 76408 KB Output is correct
23 Correct 292 ms 72636 KB Output is correct
24 Correct 48 ms 22380 KB Output is correct
25 Correct 375 ms 87048 KB Output is correct
26 Correct 331 ms 87004 KB Output is correct
27 Correct 372 ms 93448 KB Output is correct
28 Correct 346 ms 92680 KB Output is correct
29 Correct 326 ms 92608 KB Output is correct
30 Correct 306 ms 92788 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 352 ms 5740 KB Output is correct
33 Correct 28 ms 11880 KB Output is correct
34 Correct 304 ms 75632 KB Output is correct
35 Correct 309 ms 3740 KB Output is correct
36 Execution timed out 3535 ms 17496 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 KB Output is correct
17 Correct 435 ms 93184 KB Output is correct
18 Correct 440 ms 93296 KB Output is correct
19 Correct 356 ms 75376 KB Output is correct
20 Execution timed out 3542 ms 64636 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 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 344 KB Output is correct
9 Correct 237 ms 46640 KB Output is correct
10 Correct 10 ms 4568 KB Output is correct
11 Correct 67 ms 24616 KB Output is correct
12 Correct 15 ms 7052 KB Output is correct
13 Correct 46 ms 20004 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 152 ms 46548 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 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 447 ms 95328 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 3 ms 1628 KB Output is correct
27 Correct 4 ms 2392 KB Output is correct
28 Correct 131 ms 38676 KB Output is correct
29 Correct 275 ms 62176 KB Output is correct
30 Correct 330 ms 77064 KB Output is correct
31 Correct 438 ms 95608 KB Output is correct
32 Correct 0 ms 344 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 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 2 ms 1372 KB Output is correct
45 Correct 140 ms 39612 KB Output is correct
46 Correct 227 ms 57280 KB Output is correct
47 Correct 212 ms 58816 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 436 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Execution timed out 3571 ms 77772 KB Time limit exceeded
56 Halted 0 ms 0 KB -