oj.uz

Submission #446958

# Submission time Handle Problem Language Result Execution time Memory
446958 2021-07-24T05:26:26 Z blue Fountain Parks (IOI21_parks) C++17
55 / 100
 1093 ms 119988 KB 
#include "parks.h"
#include <vector>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;

const int maxN = 200'000;
const int MX = 1'000'000;



vector<int> fountain_edge[maxN];
vector<int> fountain_visit(maxN, 0);
int visit_count = 0;

void fountain_dfs(int u)
{
    fountain_visit[u] = 1;
    visit_count++;
    for(int v: fountain_edge[u])
    {
        if(fountain_visit[v]) continue;
        fountain_dfs(v);
    }
}






struct point
{
    int i;
    int x;
    int y;
};

bool operator < (point A, point B)
{
    if(A.x == B.x) return A.y < B.y;
    return A.x < B.x;
};


int N;
vector<int> X, Y;
set<point> fountains;

int point_index(int x, int y)
{
    set<point>::iterator it = fountains.find(point{-1, x, y});
    if(it == fountains.end()) return -1;
    else return it->i;
}





struct path
{
    int i;
    int a;
    int b;

    path(int A, int B)
    {
        a = min(A, B);
        b = max(A, B);
    }

    path(int I, int A, int B)
    {
        i = I;
        a = min(A, B);
        b = max(A, B);
    }
};

bool operator < (path P, path Q)
{
    if(P.a == Q.a) return P.b < Q.b;
    return P.a < Q.a;
}

vector<path> temp_paths;
set<path> paths;





struct bench
{
    int i;
    int x;
    int y;
};

bool operator < (bench C, bench D)
{
    if(C.x == D.x) return C.y < D.y;
    return C.x < D.x;
}


set<bench> benches;

int bench_index(int x, int y)
{
    set<bench>::iterator it = benches.find(bench{-1, x, y});
    if(it == benches.end()) return -1;
    else return it->i;
}


vector<path>* bench_edge = new vector<path>[MX];











vector<int> bench_visit(MX, 0);

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










vector<int> parent(maxN);
vector<int> siz(maxN, 1);


int getRoot(int u)
{
    int v;
    for(v = u; parent[v] != v; v = parent[v]);
    parent[u] = v;
    return v;
}

void join(int u, int v)
{
    u = getRoot(u);
    v = getRoot(v);

    if(siz[u] < siz[v]) swap(u, v);

    parent[v] = u;
    siz[u] += siz[v];
}

bool connected(int u, int v)
{
    return getRoot(u) == getRoot(v);
}








int construct_roads(vector<int> x, vector<int> y)
{
    // cerr << "check\n";
    X = x;
    Y = y;

    N = X.size();

    for(int i = 0; i < N; i++)
        fountains.insert(point{i, x[i], y[i]});







    // cerr << "check 2\n";


    for(int i = 0; i < N; i++)
    {
        int I;

        I = point_index(x[i] - 2, y[i]);
        if(I != -1)
        {
            // cerr << i << ' ' << I << '\n';

            fountain_edge[i].push_back(I);
            fountain_edge[I].push_back(i);

            temp_paths.push_back(path(i, I));

            // cerr << temp_paths.size() << '\n';
        }

        I = point_index(x[i], y[i] - 2);
        if(I != -1)
        {
            // cerr << i << ' ' << I << '\n';

            fountain_edge[i].push_back(I);
            fountain_edge[I].push_back(i);

            temp_paths.push_back(path(i, I));

            // cerr << temp_paths.size() << '\n';
        }
    }

    // cerr << temp_paths.size() << '\n';

    // cerr << "check 3\n";






    fountain_dfs(0);
    if(visit_count != N)
    {
        return 0;
    }





    int path_id = -1;
    for(path p: temp_paths)
    {
        path_id++;
            // cerr << "P -> " << path_id << ' ' << p.a <<  ' ' << p.b << '\n';
        paths.insert(path(path_id, p.a, p.b));
    }

    // cerr << "check 4\n";







    int bench_id = -1;
    for(path p: paths)
    {
        // cerr << "p = " << p.i << ' ' << p.a << ' ' << p.b << '\n';
        int x1 = X[p.a];
        int y1 = Y[p.a];

        int x2 = X[p.b];
        int y2 = Y[p.b];


        bench new_bench;

        if(x1 == x2)
        {
            if( ((x1+1) + (y1+y2)/2) % 4 == 0 )
                new_bench = bench{-1, x1+1, (y1+y2)/2};
            else
                new_bench = bench{-1, x1-1, (y1+y2)/2};
        }
        else
        {
            if( ((x1+x2)/2 + (y1+1)) % 4 == 2 )
                new_bench = bench{-1, (x1+x2)/2, y1+1};
            else
                new_bench = bench{-1, (x1+x2)/2, y1-1};
        }

        int curr_bench_index;

        // cerr << "before I\n";

        int I = bench_index(new_bench.x, new_bench.y);

        if(I == -1)
        {
            bench_id++;
            curr_bench_index = bench_id;

            new_bench.i = curr_bench_index;

            benches.insert(new_bench);
        }
        else
        {
            curr_bench_index = I;
        }

        bench_edge[curr_bench_index].push_back(p);
    }

    // cerr << "check 5\n";









    for(int i = 0; i < N; i++)
        parent[i] = i;


    for(int i = 0; i <= bench_id; i++)
    {
        sort(bench_edge[i].begin(), bench_edge[i].end(), [] (path P1, path P2)
        {
            if(X[P1.a] == X[P1.b]) return Y[P1.a] < Y[P2.a];
            else return X[P1.a] < X[P2.a];
        });
    }

    // cerr << "check 6\n";



    for(bench q: benches)
    {
        for(path z: bench_edge[q.i])
        {
            // if(connected(z.a, z.b)) continue;

            U.push_back(z.a);
            V.push_back(z.b);
            A.push_back(q.x);
            B.push_back(q.y);

            // join(z.a, z.b);

            break;
        }
    }



    // cerr << "check 7\n";

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct
17 Correct 17 ms 34704 KB Output is correct
18 Correct 18 ms 34744 KB Output is correct
19 Correct 17 ms 34756 KB Output is correct
20 Correct 17 ms 34648 KB Output is correct
21 Correct 18 ms 34724 KB Output is correct
22 Correct 17 ms 34636 KB Output is correct
23 Correct 1093 ms 116752 KB Output is correct
24 Correct 17 ms 34636 KB Output is correct
25 Correct 19 ms 35228 KB Output is correct
26 Correct 19 ms 35148 KB Output is correct
27 Correct 20 ms 35272 KB Output is correct
28 Correct 324 ms 67828 KB Output is correct
29 Correct 522 ms 83036 KB Output is correct
30 Correct 788 ms 100696 KB Output is correct
31 Correct 975 ms 116332 KB Output is correct
32 Correct 17 ms 34764 KB Output is correct
33 Correct 17 ms 34636 KB Output is correct
34 Correct 17 ms 34764 KB Output is correct
35 Correct 17 ms 34764 KB Output is correct
36 Correct 17 ms 34760 KB Output is correct
37 Correct 19 ms 34636 KB Output is correct
38 Correct 17 ms 34648 KB Output is correct
39 Correct 17 ms 34664 KB Output is correct
40 Correct 18 ms 34684 KB Output is correct
41 Correct 17 ms 34628 KB Output is correct
42 Correct 20 ms 34692 KB Output is correct
43 Correct 18 ms 34932 KB Output is correct
44 Correct 19 ms 35152 KB Output is correct
45 Correct 301 ms 71596 KB Output is correct
46 Correct 536 ms 89388 KB Output is correct
47 Correct 512 ms 89064 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct
17 Correct 17 ms 34704 KB Output is correct
18 Correct 18 ms 34744 KB Output is correct
19 Correct 17 ms 34756 KB Output is correct
20 Correct 17 ms 34648 KB Output is correct
21 Correct 18 ms 34724 KB Output is correct
22 Correct 17 ms 34636 KB Output is correct
23 Correct 1093 ms 116752 KB Output is correct
24 Correct 17 ms 34636 KB Output is correct
25 Correct 19 ms 35228 KB Output is correct
26 Correct 19 ms 35148 KB Output is correct
27 Correct 20 ms 35272 KB Output is correct
28 Correct 324 ms 67828 KB Output is correct
29 Correct 522 ms 83036 KB Output is correct
30 Correct 788 ms 100696 KB Output is correct
31 Correct 975 ms 116332 KB Output is correct
32 Correct 17 ms 34764 KB Output is correct
33 Correct 17 ms 34636 KB Output is correct
34 Correct 17 ms 34764 KB Output is correct
35 Correct 17 ms 34764 KB Output is correct
36 Correct 17 ms 34760 KB Output is correct
37 Correct 19 ms 34636 KB Output is correct
38 Correct 17 ms 34648 KB Output is correct
39 Correct 17 ms 34664 KB Output is correct
40 Correct 18 ms 34684 KB Output is correct
41 Correct 17 ms 34628 KB Output is correct
42 Correct 20 ms 34692 KB Output is correct
43 Correct 18 ms 34932 KB Output is correct
44 Correct 19 ms 35152 KB Output is correct
45 Correct 301 ms 71596 KB Output is correct
46 Correct 536 ms 89388 KB Output is correct
47 Correct 512 ms 89064 KB Output is correct
48 Correct 17 ms 34756 KB Output is correct
49 Correct 17 ms 34684 KB Output is correct
50 Correct 17 ms 34764 KB Output is correct
51 Correct 18 ms 34764 KB Output is correct
52 Correct 17 ms 34752 KB Output is correct
53 Correct 17 ms 34636 KB Output is correct
54 Correct 18 ms 34764 KB Output is correct
55 Incorrect 1071 ms 117632 KB Given structure is not connected: There is no path between vertices 0 and 4195
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct
17 Correct 17 ms 34752 KB Output is correct
18 Correct 17 ms 34676 KB Output is correct
19 Correct 16 ms 34680 KB Output is correct
20 Correct 758 ms 111700 KB Output is correct
21 Correct 844 ms 110412 KB Output is correct
22 Correct 765 ms 109624 KB Output is correct
23 Correct 649 ms 98400 KB Output is correct
24 Correct 294 ms 51920 KB Output is correct
25 Correct 442 ms 60516 KB Output is correct
26 Correct 415 ms 60512 KB Output is correct
27 Correct 794 ms 104828 KB Output is correct
28 Correct 777 ms 104724 KB Output is correct
29 Correct 871 ms 104732 KB Output is correct
30 Correct 925 ms 104712 KB Output is correct
31 Correct 20 ms 34720 KB Output is correct
32 Correct 49 ms 40008 KB Output is correct
33 Correct 122 ms 43328 KB Output is correct
34 Correct 762 ms 110720 KB Output is correct
35 Correct 26 ms 36044 KB Output is correct
36 Correct 80 ms 41160 KB Output is correct
37 Correct 172 ms 47620 KB Output is correct
38 Correct 289 ms 63472 KB Output is correct
39 Correct 370 ms 73452 KB Output is correct
40 Correct 545 ms 85156 KB Output is correct
41 Correct 646 ms 95468 KB Output is correct
42 Correct 819 ms 105632 KB Output is correct
43 Correct 18 ms 34764 KB Output is correct
44 Correct 18 ms 34764 KB Output is correct
45 Correct 21 ms 34684 KB Output is correct
46 Correct 20 ms 34744 KB Output is correct
47 Correct 19 ms 34720 KB Output is correct
48 Correct 17 ms 34636 KB Output is correct
49 Correct 18 ms 34664 KB Output is correct
50 Correct 16 ms 34764 KB Output is correct
51 Correct 18 ms 34744 KB Output is correct
52 Correct 17 ms 34664 KB Output is correct
53 Correct 17 ms 34708 KB Output is correct
54 Correct 18 ms 34968 KB Output is correct
55 Correct 19 ms 35104 KB Output is correct
56 Correct 343 ms 71544 KB Output is correct
57 Correct 541 ms 89216 KB Output is correct
58 Correct 572 ms 89080 KB Output is correct
59 Correct 16 ms 34764 KB Output is correct
60 Correct 16 ms 34708 KB Output is correct
61 Correct 17 ms 34636 KB Output is correct
62 Correct 751 ms 109240 KB Output is correct
63 Correct 767 ms 109316 KB Output is correct
64 Correct 790 ms 109644 KB Output is correct
65 Correct 20 ms 35284 KB Output is correct
66 Correct 23 ms 35688 KB Output is correct
67 Correct 305 ms 70560 KB Output is correct
68 Correct 518 ms 90296 KB Output is correct
69 Correct 814 ms 106832 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct
17 Correct 887 ms 111488 KB Output is correct
18 Correct 752 ms 110876 KB Output is correct
19 Correct 847 ms 111692 KB Output is correct
20 Correct 950 ms 119988 KB Output is correct
21 Correct 781 ms 102280 KB Output is correct
22 Correct 17 ms 34764 KB Output is correct
23 Correct 98 ms 47188 KB Output is correct
24 Correct 37 ms 37376 KB Output is correct
25 Correct 108 ms 44324 KB Output is correct
26 Correct 234 ms 51824 KB Output is correct
27 Correct 436 ms 75508 KB Output is correct
28 Correct 538 ms 87284 KB Output is correct
29 Correct 632 ms 96868 KB Output is correct
30 Correct 798 ms 106600 KB Output is correct
31 Correct 952 ms 116828 KB Output is correct
32 Correct 909 ms 117324 KB Output is correct
33 Correct 834 ms 111084 KB Output is correct
34 Correct 20 ms 35532 KB Output is correct
35 Correct 24 ms 35980 KB Output is correct
36 Correct 346 ms 73412 KB Output is correct
37 Correct 622 ms 94044 KB Output is correct
38 Correct 875 ms 112628 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34636 KB Output is correct
2 Correct 18 ms 34684 KB Output is correct
3 Correct 18 ms 34648 KB Output is correct
4 Correct 17 ms 34636 KB Output is correct
5 Correct 18 ms 34764 KB Output is correct
6 Correct 19 ms 34748 KB Output is correct
7 Correct 17 ms 34660 KB Output is correct
8 Correct 17 ms 34728 KB Output is correct
9 Correct 306 ms 72476 KB Output is correct
10 Correct 33 ms 38616 KB Output is correct
11 Correct 131 ms 55036 KB Output is correct
12 Correct 43 ms 40384 KB Output is correct
13 Correct 53 ms 41392 KB Output is correct
14 Correct 18 ms 34788 KB Output is correct
15 Correct 19 ms 34908 KB Output is correct
16 Correct 294 ms 71168 KB Output is correct
17 Correct 17 ms 34704 KB Output is correct
18 Correct 18 ms 34744 KB Output is correct
19 Correct 17 ms 34756 KB Output is correct
20 Correct 17 ms 34648 KB Output is correct
21 Correct 18 ms 34724 KB Output is correct
22 Correct 17 ms 34636 KB Output is correct
23 Correct 1093 ms 116752 KB Output is correct
24 Correct 17 ms 34636 KB Output is correct
25 Correct 19 ms 35228 KB Output is correct
26 Correct 19 ms 35148 KB Output is correct
27 Correct 20 ms 35272 KB Output is correct
28 Correct 324 ms 67828 KB Output is correct
29 Correct 522 ms 83036 KB Output is correct
30 Correct 788 ms 100696 KB Output is correct
31 Correct 975 ms 116332 KB Output is correct
32 Correct 17 ms 34764 KB Output is correct
33 Correct 17 ms 34636 KB Output is correct
34 Correct 17 ms 34764 KB Output is correct
35 Correct 17 ms 34764 KB Output is correct
36 Correct 17 ms 34760 KB Output is correct
37 Correct 19 ms 34636 KB Output is correct
38 Correct 17 ms 34648 KB Output is correct
39 Correct 17 ms 34664 KB Output is correct
40 Correct 18 ms 34684 KB Output is correct
41 Correct 17 ms 34628 KB Output is correct
42 Correct 20 ms 34692 KB Output is correct
43 Correct 18 ms 34932 KB Output is correct
44 Correct 19 ms 35152 KB Output is correct
45 Correct 301 ms 71596 KB Output is correct
46 Correct 536 ms 89388 KB Output is correct
47 Correct 512 ms 89064 KB Output is correct
48 Correct 17 ms 34756 KB Output is correct
49 Correct 17 ms 34684 KB Output is correct
50 Correct 17 ms 34764 KB Output is correct
51 Correct 18 ms 34764 KB Output is correct
52 Correct 17 ms 34752 KB Output is correct
53 Correct 17 ms 34636 KB Output is correct
54 Correct 18 ms 34764 KB Output is correct
55 Incorrect 1071 ms 117632 KB Given structure is not connected: There is no path between vertices 0 and 4195
56 Halted 0 ms 0 KB -