oj.uz

답안 #446414

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

using namespace std;

const int maxn = 2e5+10;

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

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

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

bool mark[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;

    queue<int> fila;
    fila.push(1), mark[1] = 1;

    while (!fila.empty())
    {
        int i = fila.front(); fila.pop();

        for (int j = 0; j < 2; 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 (mark[o]) continue;

            fila.push(o), mark[o] = 1;

            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] = {i, o, 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] = {i, o, a[i].x+1, a[i].y+1};
                    bench[{a[i].x+1, a[i].y+1}] = 1;
                }
                else
                {
                    road[++ind] = {i, o, 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 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct
17 Correct 0 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 1 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 456 ms 50708 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 1076 KB Output is correct
28 Correct 153 ms 20492 KB Output is correct
29 Correct 242 ms 30460 KB Output is correct
30 Correct 345 ms 40552 KB Output is correct
31 Correct 469 ms 50476 KB Output is correct
32 Correct 1 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 0 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 1 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 4 ms 844 KB Output is correct
45 Correct 194 ms 27040 KB Output is correct
46 Correct 292 ms 39032 KB Output is correct
47 Correct 288 ms 39068 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct
17 Correct 0 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 1 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 456 ms 50708 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 1076 KB Output is correct
28 Correct 153 ms 20492 KB Output is correct
29 Correct 242 ms 30460 KB Output is correct
30 Correct 345 ms 40552 KB Output is correct
31 Correct 469 ms 50476 KB Output is correct
32 Correct 1 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 0 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 1 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 4 ms 844 KB Output is correct
45 Correct 194 ms 27040 KB Output is correct
46 Correct 292 ms 39032 KB Output is correct
47 Correct 288 ms 39068 KB Output is correct
48 Correct 0 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 0 ms 204 KB Output is correct
55 Correct 451 ms 48384 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 716 KB Output is correct
58 Correct 9 ms 1868 KB Output is correct
59 Correct 12 ms 2216 KB Output is correct
60 Correct 208 ms 24416 KB Output is correct
61 Correct 280 ms 32804 KB Output is correct
62 Correct 362 ms 40088 KB Output is correct
63 Correct 457 ms 48428 KB Output is correct
64 Correct 1 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 433 ms 56732 KB Output is correct
68 Correct 431 ms 56748 KB Output is correct
69 Correct 423 ms 56740 KB Output is correct
70 Correct 5 ms 1100 KB Output is correct
71 Correct 10 ms 1996 KB Output is correct
72 Correct 190 ms 26796 KB Output is correct
73 Correct 309 ms 40000 KB Output is correct
74 Correct 451 ms 53212 KB Output is correct
75 Correct 456 ms 52008 KB Output is correct
76 Correct 435 ms 57000 KB Output is correct
77 Correct 6 ms 1356 KB Output is correct
78 Correct 10 ms 2124 KB Output is correct
79 Correct 193 ms 26532 KB Output is correct
80 Correct 310 ms 39580 KB Output is correct
81 Correct 447 ms 52596 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct
17 Incorrect 0 ms 204 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct
17 Incorrect 209 ms 20556 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 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 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 182 ms 28716 KB Output is correct
10 Correct 14 ms 3404 KB Output is correct
11 Correct 83 ms 15632 KB Output is correct
12 Correct 21 ms 4816 KB Output is correct
13 Correct 48 ms 10660 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 183 ms 28572 KB Output is correct
17 Correct 0 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 1 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 456 ms 50708 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 1076 KB Output is correct
28 Correct 153 ms 20492 KB Output is correct
29 Correct 242 ms 30460 KB Output is correct
30 Correct 345 ms 40552 KB Output is correct
31 Correct 469 ms 50476 KB Output is correct
32 Correct 1 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 0 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 1 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 4 ms 844 KB Output is correct
45 Correct 194 ms 27040 KB Output is correct
46 Correct 292 ms 39032 KB Output is correct
47 Correct 288 ms 39068 KB Output is correct
48 Correct 0 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 0 ms 204 KB Output is correct
55 Correct 451 ms 48384 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 3 ms 716 KB Output is correct
58 Correct 9 ms 1868 KB Output is correct
59 Correct 12 ms 2216 KB Output is correct
60 Correct 208 ms 24416 KB Output is correct
61 Correct 280 ms 32804 KB Output is correct
62 Correct 362 ms 40088 KB Output is correct
63 Correct 457 ms 48428 KB Output is correct
64 Correct 1 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 433 ms 56732 KB Output is correct
68 Correct 431 ms 56748 KB Output is correct
69 Correct 423 ms 56740 KB Output is correct
70 Correct 5 ms 1100 KB Output is correct
71 Correct 10 ms 1996 KB Output is correct
72 Correct 190 ms 26796 KB Output is correct
73 Correct 309 ms 40000 KB Output is correct
74 Correct 451 ms 53212 KB Output is correct
75 Correct 456 ms 52008 KB Output is correct
76 Correct 435 ms 57000 KB Output is correct
77 Correct 6 ms 1356 KB Output is correct
78 Correct 10 ms 2124 KB Output is correct
79 Correct 193 ms 26532 KB Output is correct
80 Correct 310 ms 39580 KB Output is correct
81 Correct 447 ms 52596 KB Output is correct
82 Incorrect 0 ms 204 KB Solution announced impossible, but it is possible.
83 Halted 0 ms 0 KB -