oj.uz

답안 #446409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446409 2021-07-21T21:16:47 Z luciocf 분수 공원 (IOI21_parks) C++17
30 / 100
 1238 ms 70120 KB 
#include <bits/stdc++.h>
#include "parks.h"

using namespace std;

const int maxn = 2e5+10;

int linha[] = {-2, 2, 0, 0};
int coluna[] = {0, 0, -2, 2};

struct Pt
{
    int x, y, ind;
} a[maxn];

struct Road
{
    int u, v, x, y;
} road[maxn];

struct DSU
{
    int pai[maxn], peso[maxn];

    void init(int n)
    {
        for (int i = 1; i <= n; i++)
            pai[i] = i;
    }

    int Find(int x)
    {
        if (pai[x] == x) return x;
        return pai[x] = Find(pai[x]);
    }

    void Join(int x, int y)
    {
        x = Find(x), y = Find(y);
        if (x == y) return;

        if (peso[x] < peso[y]) swap(x, y);

        pai[y] = x, peso[x] += peso[y]; 
    }
} dsu;

bool comp(Pt a, Pt b)
{
    if (a.x == b.x) return a.y < b.y;
    return a.x < b.x;
}

int construct_roads(vector<int> X, vector<int> Y)
{
    int n = X.size();

    bool sub = 1;
    int mn = 8, mx = 0;

    map<pair<int, int>, int> mp;

    for (int i = 1; i <= n; i++)
    {
        a[i] = {X[i-1], Y[i-1], i};

        mp[{a[i].x, a[i].y}] = i;

        mx = max(mx, a[i].x);
        mn = min(mn, a[i].x);
    }

    if (mx > 6) sub = 0;

    dsu.init(n);

    if (sub)
    {
        map<pair<int, int>, int> bench;

        sort(a+1, a+n+1, comp);

        int ind = 0;

        for (int i = 1; i < n; i++)
        {
            if (dsu.Find(a[i].ind) != dsu.Find(a[i+1].ind) && a[i].x == a[i+1].x && a[i].y+2 == a[i+1].y)
            {
                dsu.Join(a[i].ind, a[i+1].ind);

                road[++ind] = {a[i].ind, a[i+1].ind, a[i].x-1, a[i].y+1};

                if (a[i].x == mx)
                {
                    road[ind].x = a[i].x+1, road[ind].y = a[i].y+1;
                    bench[{a[i].x+1, a[i].y+1}] = 1;
                }
                else if (a[i].x == mn)
                {
                    bench[{a[i].x-1, a[i].y+1}] = 1;
                } 
                else
                {
                    if (bench[{a[i].x-1, a[i].y+1}] == 1)
                    {
                        road[ind].x = a[i].x+1, road[ind].y = a[i].y+1;
                        bench[{a[i].x+1, a[i].y+1}] = 1;
                    }
                    else
                    {
                        bench[{a[i].x-1, a[i].y+1}] = 1;
                    }
                }
            }

            if (mp[{a[i].x+2, a[i].y}] && dsu.Find(a[i].ind) != dsu.Find(mp[{a[i].x+2, a[i].y}]))
            {
                dsu.Join(a[i].ind, mp[{a[i].x+2, a[i].y}]);

                if (bench[{a[i].x+1, a[i].y-1}])
                {
                    road[++ind] = {a[i].ind, mp[{a[i].x+2, a[i].y}], a[i].x+1, a[i].y+1};
                    bench[{a[i].x+1, a[i].y+1}] = 1;
                }
                else
                {
                    road[++ind] = {a[i].ind, mp[{a[i].x+2, a[i].y}], a[i].x+1, a[i].y-1};
                    bench[{a[i].x+1, a[i].y-1}] = 1;
                }
            }
        }

        if (ind != n-1) return 0;

        vector<int> U, V, A, B;

        for (int i = 1; i < n; i++)
        {
            U.push_back(road[i].u-1), V.push_back(road[i].v-1);
            A.push_back(road[i].x), B.push_back(road[i].y);
        }

        build(U, V, A, B);
        return 1;
    }

    map<pair<int, int>, int> bench;

    int ind = 0;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < 4; j++)
        {
            int dx = a[i].x+linha[j], dy = a[i].y+coluna[j];

            if (!mp[{dx, dy}]) continue;

            int o = mp[{dx, dy}];

            if (dsu.Find(i) != dsu.Find(o) && a[i].x == a[o].x && a[i].y+2 == a[o].y)
            {
                dsu.Join(i, o);

                road[++ind] = {a[i].ind, a[i+1].ind, a[i].x-1, a[i].y+1};

                if (bench[{a[i].x-1, a[i].y+1}] == 1)
                {
                    road[ind].x = a[i].x+1, road[ind].y = a[i].y+1;
                    bench[{a[i].x+1, a[i].y+1}] = 1;
                }
                else
                {
                    bench[{a[i].x-1, a[i].y+1}] = 1;
                }
            }

            if (dsu.Find(i) != dsu.Find(o) && a[i].x+2 == a[o].x)
            {
                dsu.Join(i, o);

                if (bench[{a[i].x+1, a[i].y-1}])
                {
                    road[++ind] = {a[i].ind, mp[{a[i].x+2, a[i].y}], a[i].x+1, a[i].y+1};
                    bench[{a[i].x+1, a[i].y+1}] = 1;
                }
                else
                {
                    road[++ind] = {a[i].ind, mp[{a[i].x+2, a[i].y}], a[i].x+1, a[i].y-1};
                    bench[{a[i].x+1, a[i].y-1}] = 1;
                }
            }
        }
    }

    if (ind != n-1) return 0;

    vector<int> U, V, A, B;

    for (int i = 1; i < n; i++)
    {
        U.push_back(road[i].u-1), V.push_back(road[i].v-1);
        A.push_back(road[i].x), B.push_back(road[i].y);
    }

    build(U, V, A, B);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 454 ms 50536 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 4 ms 844 KB Output is correct
27 Correct 5 ms 1100 KB Output is correct
28 Correct 155 ms 20464 KB Output is correct
29 Correct 243 ms 30536 KB Output is correct
30 Correct 346 ms 40448 KB Output is correct
31 Correct 462 ms 50524 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 716 KB Output is correct
44 Correct 3 ms 972 KB Output is correct
45 Correct 191 ms 27052 KB Output is correct
46 Correct 292 ms 39068 KB Output is correct
47 Correct 295 ms 39032 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 454 ms 50536 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 4 ms 844 KB Output is correct
27 Correct 5 ms 1100 KB Output is correct
28 Correct 155 ms 20464 KB Output is correct
29 Correct 243 ms 30536 KB Output is correct
30 Correct 346 ms 40448 KB Output is correct
31 Correct 462 ms 50524 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 716 KB Output is correct
44 Correct 3 ms 972 KB Output is correct
45 Correct 191 ms 27052 KB Output is correct
46 Correct 292 ms 39068 KB Output is correct
47 Correct 295 ms 39032 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 461 ms 48440 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 3 ms 716 KB Output is correct
58 Correct 9 ms 1808 KB Output is correct
59 Correct 12 ms 2152 KB Output is correct
60 Correct 194 ms 24464 KB Output is correct
61 Correct 286 ms 32800 KB Output is correct
62 Correct 359 ms 40164 KB Output is correct
63 Correct 456 ms 48412 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 420 ms 56864 KB Output is correct
68 Correct 428 ms 56768 KB Output is correct
69 Correct 420 ms 56476 KB Output is correct
70 Correct 5 ms 1100 KB Output is correct
71 Correct 10 ms 1996 KB Output is correct
72 Correct 192 ms 26792 KB Output is correct
73 Correct 321 ms 40092 KB Output is correct
74 Correct 444 ms 53156 KB Output is correct
75 Correct 461 ms 51744 KB Output is correct
76 Correct 430 ms 56784 KB Output is correct
77 Correct 6 ms 1356 KB Output is correct
78 Correct 10 ms 2240 KB Output is correct
79 Correct 193 ms 26540 KB Output is correct
80 Correct 321 ms 39580 KB Output is correct
81 Correct 444 ms 52796 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 0 ms 204 KB Pair u[0]=1 @(200000, 199998) and v[0]=2 @(199998, 200000) does not form a valid edge (distance != 2)
19 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct
17 Incorrect 1238 ms 70120 KB Pair u[1]=1 @(100002, 52498) and v[1]=2 @(82816, 2) does not form a valid edge (distance != 2)
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 184 ms 28584 KB Output is correct
10 Correct 14 ms 3276 KB Output is correct
11 Correct 79 ms 15544 KB Output is correct
12 Correct 22 ms 4812 KB Output is correct
13 Correct 47 ms 10608 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 184 ms 28584 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 454 ms 50536 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 4 ms 844 KB Output is correct
27 Correct 5 ms 1100 KB Output is correct
28 Correct 155 ms 20464 KB Output is correct
29 Correct 243 ms 30536 KB Output is correct
30 Correct 346 ms 40448 KB Output is correct
31 Correct 462 ms 50524 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 2 ms 716 KB Output is correct
44 Correct 3 ms 972 KB Output is correct
45 Correct 191 ms 27052 KB Output is correct
46 Correct 292 ms 39068 KB Output is correct
47 Correct 295 ms 39032 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 461 ms 48440 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 3 ms 716 KB Output is correct
58 Correct 9 ms 1808 KB Output is correct
59 Correct 12 ms 2152 KB Output is correct
60 Correct 194 ms 24464 KB Output is correct
61 Correct 286 ms 32800 KB Output is correct
62 Correct 359 ms 40164 KB Output is correct
63 Correct 456 ms 48412 KB Output is correct
64 Correct 0 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 420 ms 56864 KB Output is correct
68 Correct 428 ms 56768 KB Output is correct
69 Correct 420 ms 56476 KB Output is correct
70 Correct 5 ms 1100 KB Output is correct
71 Correct 10 ms 1996 KB Output is correct
72 Correct 192 ms 26792 KB Output is correct
73 Correct 321 ms 40092 KB Output is correct
74 Correct 444 ms 53156 KB Output is correct
75 Correct 461 ms 51744 KB Output is correct
76 Correct 430 ms 56784 KB Output is correct
77 Correct 6 ms 1356 KB Output is correct
78 Correct 10 ms 2240 KB Output is correct
79 Correct 193 ms 26540 KB Output is correct
80 Correct 321 ms 39580 KB Output is correct
81 Correct 444 ms 52796 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Incorrect 0 ms 204 KB Pair u[0]=1 @(200000, 199998) and v[0]=2 @(199998, 200000) does not form a valid edge (distance != 2)
84 Halted 0 ms 0 KB -