oj.uz

Submission #446406

# Submission time Handle Problem Language Result Execution time Memory
446406 2021-07-21T21:06:21 Z luciocf Fountain Parks (IOI21_parks) C++17
15 / 100
 453 ms 50644 KB 
#include <bits/stdc++.h>
#include "parks.h"

using namespace std;

const int maxn = 2e5+10;

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;
    }
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:58:30: warning: control reaches end of non-void function [-Wreturn-type]
   58 |     map<pair<int, int>, int> mp;
      |                              ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 450 ms 50460 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 860 KB Output is correct
27 Correct 4 ms 1100 KB Output is correct
28 Correct 150 ms 20496 KB Output is correct
29 Correct 239 ms 30508 KB Output is correct
30 Correct 347 ms 40476 KB Output is correct
31 Correct 448 ms 50644 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 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 1 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 183 ms 27048 KB Output is correct
46 Correct 289 ms 39152 KB Output is correct
47 Correct 289 ms 39156 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 450 ms 50460 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 860 KB Output is correct
27 Correct 4 ms 1100 KB Output is correct
28 Correct 150 ms 20496 KB Output is correct
29 Correct 239 ms 30508 KB Output is correct
30 Correct 347 ms 40476 KB Output is correct
31 Correct 448 ms 50644 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 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 1 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 183 ms 27048 KB Output is correct
46 Correct 289 ms 39152 KB Output is correct
47 Correct 289 ms 39156 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 300 KB Output is correct
55 Correct 453 ms 50012 KB Output is correct
56 Incorrect 1 ms 204 KB Tree @(5, 183571) appears more than once: for edges on positions 4 and 6
57 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct
17 Runtime error 3 ms 460 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct
17 Runtime error 210 ms 38472 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 212 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 181 ms 28588 KB Output is correct
10 Correct 13 ms 3276 KB Output is correct
11 Correct 79 ms 15536 KB Output is correct
12 Correct 20 ms 4804 KB Output is correct
13 Correct 46 ms 10612 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 182 ms 28584 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 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 450 ms 50460 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 860 KB Output is correct
27 Correct 4 ms 1100 KB Output is correct
28 Correct 150 ms 20496 KB Output is correct
29 Correct 239 ms 30508 KB Output is correct
30 Correct 347 ms 40476 KB Output is correct
31 Correct 448 ms 50644 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 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 1 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 183 ms 27048 KB Output is correct
46 Correct 289 ms 39152 KB Output is correct
47 Correct 289 ms 39156 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 300 KB Output is correct
55 Correct 453 ms 50012 KB Output is correct
56 Incorrect 1 ms 204 KB Tree @(5, 183571) appears more than once: for edges on positions 4 and 6
57 Halted 0 ms 0 KB -