oj.uz

답안 #797128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797128 2023-07-29T07:04:25 Z t6twotwo 분수 공원 (IOI21_parks) C++17
50 / 100
 592 ms 95576 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct dsu {
    int n;
    vector<int> p, s;
    dsu(int n) : n(n), p(n), s(n, 1) {
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        return x == p[x] ? x : p[x] = find(p[x]);
    }
    int size(int x) {
        return s[find(x)];
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return 0;
        }
        if (s[x] > s[y]) {
            swap(x, y);
        }
        p[x] = y;
        s[y] += s[x];
        return 1;
    }
};
constexpr int A = 200000;
struct road {
    int a, b, c, p;
    pair<int, int> t[2];
    road() {
    }
    road(int A, int B, int C, int P, pair<int, int> U, pair<int, int> V) {
        a = A, b = B, c = C, p = P, t[0] = U, t[1] = V;
    }
};
int construct_roads(vector<int> X, vector<int> Y) {
    int N = X.size();
    if (*max_element(X.begin(), X.end()) <= 6) {
        vector f(7, vector(A + 3, -1));
        for (int i = 0; i < N; i++) {
            f[X[i]][Y[i]] = i;
        }
        dsu uf(N);
        vector<int> u, v, a, b, m(A + 1, -1), l(A + 1, -1), r(A + 1, -1);
        for (int y = 2; y <= A; y += 2) {
            for (int x = 2; x <= 6; x += 2) {
                if (f[x][y] != -1 && f[x][y + 2] != -1) {
                    if (x == 4) {
                        m[y + 1] = u.size();
                    }
                    u.push_back(f[x][y]);
                    v.push_back(f[x][y + 2]);
                    a.push_back(x == 2 ? 1 : 7);
                    b.push_back(y + 1);
                    uf.unite(f[x][y], f[x][y + 2]);
                }
                if (x != 6 && f[x][y] != -1 && f[x + 2][y] != -1) {
                    if (x == 2 && l[y - 2] == -1) {
                        l[y] = u.size();
                        u.push_back(f[x][y]);
                        v.push_back(f[x + 2][y]);
                        a.push_back(3);
                        b.push_back(-1);
                        uf.unite(f[x][y], f[x + 2][y]);
                    }
                    if (x == 4 && r[y - 2] == -1) {
                        r[y] = u.size();
                        u.push_back(f[x][y]);
                        v.push_back(f[x + 2][y]);
                        a.push_back(5);
                        b.push_back(-1);
                        uf.unite(f[x][y], f[x + 2][y]);
                    }
                }
            }
        }
        if (uf.size(0) != N) {
            return 0;
        }
        vector<int> q(A, -1), s(A, -1), t(A, -1);
        for (int i = 1; i <= A; i++) {
            if (i % 2 == 1 && m[i] != -1) {
                if (s[i - 1] != 1) {
                    a[m[i]] = 3;
                    q[i] = 0;
                } else {
                    assert(t[i - 1] != 1);
                    a[m[i]] = 5;
                    q[i] = 1;
                }
            }
            if (i % 2 == 0) {
                if (l[i] != -1) {
                    if (q[i - 1] == 0) {
                        b[l[i]] = i + 1;
                        s[i] = 1;
                    } else {
                        b[l[i]] = i - 1;
                        s[i] = 0;
                    }
                }
                if (r[i] != -1) {
                    if (q[i - 1] == 1) {
                        b[r[i]] = i + 1;
                        t[i] = 1;
                    } else {
                        b[r[i]] = i - 1;
                        t[i] = 0;
                    }
                }
            }
        }
        build(u, v, a, b);
        return 1;
    }
    map<int, int> mp[A + 1];
    for (int i = 0; i < N; i++) {
        mp[X[i]][Y[i]] = i;
    }
    dsu uf(N);
    vector<road> roads;
    for (int i = 0; i < N; i++) {
        for (int dx = -2; dx <= 2; dx += 4) {
            if (mp[X[i] + dx].count(Y[i])) {
                int j = mp[X[i] + dx][Y[i]];
                if (!uf.same(i, j)) {
                    uf.unite(i, j);
                    roads.push_back(road(i, j, -1, roads.size(), pair{X[i] + dx / 2, Y[i] + 1}, pair{X[i] + dx / 2, Y[i] - 1}));
                }
            }
        }
        for (int dy = -2; dy <= 2; dy += 4) {
            if (mp[X[i]].count(Y[i] + dy)) {
                int j = mp[X[i]][Y[i] + dy];
                if (!uf.same(i, j)) {
                    uf.unite(i, j);
                    roads.push_back(road(i, j, -1, roads.size(), pair{X[i] - 1, Y[i] + dy / 2}, pair{X[i] + 1, Y[i] + dy / 2}));
                }
            }
        }
    }
    if (uf.size(0) != N) {
        return 0;
    }
    map<int, vector<pair<int, int>>> f[A + 1];
    for (int z = 0; z < roads.size(); z++) {
        auto r = roads[z];
        for (int i = 0; i < 2; i++) {
            auto [x, y] = r.t[i];
            f[x][y].emplace_back(z, i);
        }
    }
    for (int z = 0; z < roads.size(); z++) {
        if (roads[z].c != -1) {
            continue;
        }
        for (int d = 0; d < 2; d++) {
            bool ok = 1;
            vector<int> q;
            roads[z].c = d;
            q.push_back(z);
            for (int i = 0; ok && i < q.size(); i++) {
                int u = q[i];
                int color = roads[u].c;
                auto [x, y] = roads[u].t[color];
                for (auto [v, w] : f[x][y]) {
                    if (roads[v].c == -1) {
                        roads[v].c = 1 - w;
                        q.push_back(v);
                    }
                    if (v != u && roads[v].c == w) {
                        ok = 0;
                        break;
                    }
                }
            }
            if (ok) {
                break;
            }
            if (!ok) {
                if (d == 1) {
                    return 0;
                }
                for (int x : q) {
                    roads[x].c = -1;
                }
            }
        }
    }
    vector<int> u, v, a, b;
    for (auto r : roads) {
        u.push_back(r.a);
        v.push_back(r.b);
        auto [x, y] = r.t[r.c];
        a.push_back(x);
        b.push_back(y);
    }
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:154:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<road>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |     for (int z = 0; z < roads.size(); z++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:161:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<road>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |     for (int z = 0; z < roads.size(); z++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:170:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |             for (int i = 0; ok && i < q.size(); i++) {
      |                                   ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct
17 Correct 13 ms 29252 KB Output is correct
18 Correct 13 ms 29204 KB Output is correct
19 Correct 13 ms 29252 KB Output is correct
20 Correct 13 ms 29264 KB Output is correct
21 Correct 12 ms 26820 KB Output is correct
22 Correct 13 ms 29252 KB Output is correct
23 Correct 111 ms 47664 KB Output is correct
24 Correct 13 ms 29252 KB Output is correct
25 Correct 15 ms 29300 KB Output is correct
26 Correct 12 ms 27028 KB Output is correct
27 Correct 13 ms 27184 KB Output is correct
28 Correct 51 ms 36796 KB Output is correct
29 Correct 70 ms 40768 KB Output is correct
30 Correct 92 ms 44228 KB Output is correct
31 Correct 111 ms 47664 KB Output is correct
32 Correct 13 ms 29252 KB Output is correct
33 Correct 15 ms 29196 KB Output is correct
34 Correct 14 ms 29252 KB Output is correct
35 Correct 12 ms 26820 KB Output is correct
36 Correct 12 ms 26904 KB Output is correct
37 Correct 13 ms 29208 KB Output is correct
38 Correct 17 ms 29212 KB Output is correct
39 Correct 13 ms 29212 KB Output is correct
40 Correct 13 ms 29252 KB Output is correct
41 Correct 12 ms 26820 KB Output is correct
42 Correct 15 ms 29228 KB Output is correct
43 Correct 12 ms 26948 KB Output is correct
44 Correct 13 ms 27096 KB Output is correct
45 Correct 58 ms 37528 KB Output is correct
46 Correct 74 ms 41412 KB Output is correct
47 Correct 73 ms 41340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct
17 Correct 13 ms 29252 KB Output is correct
18 Correct 13 ms 29204 KB Output is correct
19 Correct 13 ms 29252 KB Output is correct
20 Correct 13 ms 29264 KB Output is correct
21 Correct 12 ms 26820 KB Output is correct
22 Correct 13 ms 29252 KB Output is correct
23 Correct 111 ms 47664 KB Output is correct
24 Correct 13 ms 29252 KB Output is correct
25 Correct 15 ms 29300 KB Output is correct
26 Correct 12 ms 27028 KB Output is correct
27 Correct 13 ms 27184 KB Output is correct
28 Correct 51 ms 36796 KB Output is correct
29 Correct 70 ms 40768 KB Output is correct
30 Correct 92 ms 44228 KB Output is correct
31 Correct 111 ms 47664 KB Output is correct
32 Correct 13 ms 29252 KB Output is correct
33 Correct 15 ms 29196 KB Output is correct
34 Correct 14 ms 29252 KB Output is correct
35 Correct 12 ms 26820 KB Output is correct
36 Correct 12 ms 26904 KB Output is correct
37 Correct 13 ms 29208 KB Output is correct
38 Correct 17 ms 29212 KB Output is correct
39 Correct 13 ms 29212 KB Output is correct
40 Correct 13 ms 29252 KB Output is correct
41 Correct 12 ms 26820 KB Output is correct
42 Correct 15 ms 29228 KB Output is correct
43 Correct 12 ms 26948 KB Output is correct
44 Correct 13 ms 27096 KB Output is correct
45 Correct 58 ms 37528 KB Output is correct
46 Correct 74 ms 41412 KB Output is correct
47 Correct 73 ms 41340 KB Output is correct
48 Correct 12 ms 29252 KB Output is correct
49 Correct 12 ms 29212 KB Output is correct
50 Correct 12 ms 29252 KB Output is correct
51 Correct 13 ms 29200 KB Output is correct
52 Correct 13 ms 29252 KB Output is correct
53 Correct 13 ms 29252 KB Output is correct
54 Correct 13 ms 29240 KB Output is correct
55 Correct 115 ms 48040 KB Output is correct
56 Correct 13 ms 29252 KB Output is correct
57 Correct 14 ms 29380 KB Output is correct
58 Correct 16 ms 29892 KB Output is correct
59 Correct 14 ms 27568 KB Output is correct
60 Correct 73 ms 39336 KB Output is correct
61 Correct 79 ms 42400 KB Output is correct
62 Correct 96 ms 45344 KB Output is correct
63 Correct 117 ms 48180 KB Output is correct
64 Correct 12 ms 26904 KB Output is correct
65 Correct 13 ms 29188 KB Output is correct
66 Correct 12 ms 26820 KB Output is correct
67 Correct 99 ms 45456 KB Output is correct
68 Correct 97 ms 45500 KB Output is correct
69 Correct 94 ms 45340 KB Output is correct
70 Correct 12 ms 27100 KB Output is correct
71 Correct 13 ms 27332 KB Output is correct
72 Correct 53 ms 37332 KB Output is correct
73 Correct 74 ms 41788 KB Output is correct
74 Correct 96 ms 45500 KB Output is correct
75 Correct 111 ms 47160 KB Output is correct
76 Correct 100 ms 45488 KB Output is correct
77 Correct 11 ms 27172 KB Output is correct
78 Correct 12 ms 27460 KB Output is correct
79 Correct 53 ms 37812 KB Output is correct
80 Correct 77 ms 42440 KB Output is correct
81 Correct 112 ms 46396 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct
17 Runtime error 27 ms 38436 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct
17 Correct 551 ms 95372 KB Output is correct
18 Correct 556 ms 95576 KB Output is correct
19 Correct 375 ms 73752 KB Output is correct
20 Correct 536 ms 76636 KB Output is correct
21 Correct 491 ms 79160 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 61 ms 28400 KB Output is correct
24 Correct 24 ms 21836 KB Output is correct
25 Correct 76 ms 29076 KB Output is correct
26 Correct 115 ms 33180 KB Output is correct
27 Correct 235 ms 49220 KB Output is correct
28 Correct 291 ms 56388 KB Output is correct
29 Correct 385 ms 64980 KB Output is correct
30 Correct 502 ms 71788 KB Output is correct
31 Correct 592 ms 79112 KB Output is correct
32 Correct 105 ms 47116 KB Output is correct
33 Correct 98 ms 45480 KB Output is correct
34 Correct 12 ms 27252 KB Output is correct
35 Correct 12 ms 27460 KB Output is correct
36 Correct 53 ms 37832 KB Output is correct
37 Correct 79 ms 42400 KB Output is correct
38 Correct 101 ms 46428 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 29252 KB Output is correct
2 Correct 12 ms 29232 KB Output is correct
3 Correct 12 ms 26908 KB Output is correct
4 Correct 13 ms 29264 KB Output is correct
5 Correct 13 ms 29220 KB Output is correct
6 Correct 11 ms 26888 KB Output is correct
7 Correct 11 ms 26908 KB Output is correct
8 Correct 11 ms 26820 KB Output is correct
9 Correct 56 ms 37440 KB Output is correct
10 Correct 17 ms 30148 KB Output is correct
11 Correct 34 ms 33604 KB Output is correct
12 Correct 19 ms 30380 KB Output is correct
13 Correct 19 ms 29624 KB Output is correct
14 Correct 12 ms 26896 KB Output is correct
15 Correct 13 ms 26948 KB Output is correct
16 Correct 54 ms 37456 KB Output is correct
17 Correct 13 ms 29252 KB Output is correct
18 Correct 13 ms 29204 KB Output is correct
19 Correct 13 ms 29252 KB Output is correct
20 Correct 13 ms 29264 KB Output is correct
21 Correct 12 ms 26820 KB Output is correct
22 Correct 13 ms 29252 KB Output is correct
23 Correct 111 ms 47664 KB Output is correct
24 Correct 13 ms 29252 KB Output is correct
25 Correct 15 ms 29300 KB Output is correct
26 Correct 12 ms 27028 KB Output is correct
27 Correct 13 ms 27184 KB Output is correct
28 Correct 51 ms 36796 KB Output is correct
29 Correct 70 ms 40768 KB Output is correct
30 Correct 92 ms 44228 KB Output is correct
31 Correct 111 ms 47664 KB Output is correct
32 Correct 13 ms 29252 KB Output is correct
33 Correct 15 ms 29196 KB Output is correct
34 Correct 14 ms 29252 KB Output is correct
35 Correct 12 ms 26820 KB Output is correct
36 Correct 12 ms 26904 KB Output is correct
37 Correct 13 ms 29208 KB Output is correct
38 Correct 17 ms 29212 KB Output is correct
39 Correct 13 ms 29212 KB Output is correct
40 Correct 13 ms 29252 KB Output is correct
41 Correct 12 ms 26820 KB Output is correct
42 Correct 15 ms 29228 KB Output is correct
43 Correct 12 ms 26948 KB Output is correct
44 Correct 13 ms 27096 KB Output is correct
45 Correct 58 ms 37528 KB Output is correct
46 Correct 74 ms 41412 KB Output is correct
47 Correct 73 ms 41340 KB Output is correct
48 Correct 12 ms 29252 KB Output is correct
49 Correct 12 ms 29212 KB Output is correct
50 Correct 12 ms 29252 KB Output is correct
51 Correct 13 ms 29200 KB Output is correct
52 Correct 13 ms 29252 KB Output is correct
53 Correct 13 ms 29252 KB Output is correct
54 Correct 13 ms 29240 KB Output is correct
55 Correct 115 ms 48040 KB Output is correct
56 Correct 13 ms 29252 KB Output is correct
57 Correct 14 ms 29380 KB Output is correct
58 Correct 16 ms 29892 KB Output is correct
59 Correct 14 ms 27568 KB Output is correct
60 Correct 73 ms 39336 KB Output is correct
61 Correct 79 ms 42400 KB Output is correct
62 Correct 96 ms 45344 KB Output is correct
63 Correct 117 ms 48180 KB Output is correct
64 Correct 12 ms 26904 KB Output is correct
65 Correct 13 ms 29188 KB Output is correct
66 Correct 12 ms 26820 KB Output is correct
67 Correct 99 ms 45456 KB Output is correct
68 Correct 97 ms 45500 KB Output is correct
69 Correct 94 ms 45340 KB Output is correct
70 Correct 12 ms 27100 KB Output is correct
71 Correct 13 ms 27332 KB Output is correct
72 Correct 53 ms 37332 KB Output is correct
73 Correct 74 ms 41788 KB Output is correct
74 Correct 96 ms 45500 KB Output is correct
75 Correct 111 ms 47160 KB Output is correct
76 Correct 100 ms 45488 KB Output is correct
77 Correct 11 ms 27172 KB Output is correct
78 Correct 12 ms 27460 KB Output is correct
79 Correct 53 ms 37812 KB Output is correct
80 Correct 77 ms 42440 KB Output is correct
81 Correct 112 ms 46396 KB Output is correct
82 Runtime error 27 ms 38436 KB Execution killed with signal 11
83 Halted 0 ms 0 KB -