oj.uz

Submission #439954

# Submission time Handle Problem Language Result Execution time Memory
439954 2021-07-01T09:47:12 Z cheeheng Fountain Parks (IOI21_parks) C++17
55 / 100
 1369 ms 149912 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;

const int dx[] = {-1,0,0,1};
const int dy[] = {0,1,-1,0};

vector<int> AdjList[200005];
ii EdgeList[800005];
ii EdgeList2[800005];
map<ii, int> indx;
map<ii, int> indxEdge;
map<ii, int> indxBench;

vector<int> AdjListBench[800005];
set<int> AdjListRoad[200005];
int degBench[800005];
ii benchXY[800005];

struct UnionFind{
    vector<int> p;
    vector<int> rank1;
    void init(int n){
        p.assign(n, 0);
        rank1.assign(n, 0);
        for(int i = 0; i < n; i ++){
            p[i] = i;
            rank1[i] = 0;
        }
    }

    int findSet(int i){
        return (p[i] == i) ? i : (p[i] = findSet(p[i]));
    }

    bool isSameSet(int i, int j){
        return findSet(i) == findSet(j);
    }

    void unionSet(int i, int j){
        int x = findSet(i);
        int y = findSet(j);

        if(x != y){
            if(rank1[x] > rank1[y]){
                p[y] = x;
            }else{
                p[x] = y;
                if(rank1[x] == rank1[y]){
                    rank1[y] ++;
                }
            }
        }
    }
};

int p[200005];

int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = (int)x.size();
    if (n == 1) {
        build({}, {}, {}, {});
        return 1;
    }

    vector<int> U(n-1);
    vector<int> V(n-1);
    vector<int> A(n-1);
    vector<int> B(n-1);

    for(int i = 0; i < n; i ++){
        indx[ii(x[i], y[i])] = i;
    }

    int cnt3 = 0;
    for(pair<ii, int> temp: indx){
        p[cnt3 ++] = temp.second;
    }

    int m = 0;
    for(int i = 0; i < n; i ++){
        int i2 = p[i];
        for(int k = 0; k < 4; k ++){
            int nx = x[i2] + 2*dx[k];
            int ny = y[i2] + 2*dy[k];

            if(indx.find(ii(nx, ny)) != indx.end()){
                int j = indx[ii(nx, ny)];
                EdgeList[m ++] = ii(i2, j);
            }
        }
    }

    UnionFind* uf = new UnionFind();
    uf->init(n);

    int cnt = 0;
    for(int i = 0; i < m; i ++){
        int u, v;
        tie(u, v) = EdgeList[i];
        if(!uf->isSameSet(u, v)){
            uf->unionSet(u, v);
            AdjList[u].push_back(v);
            AdjList[v].push_back(u);
            EdgeList2[cnt] = ii(u, v);
            indxEdge[ii(u, v)] = cnt;
            cnt ++;
        }
    }

    if(cnt != n-1){
        return 0;
    }

    int benches = 0;
    memset(degBench, 0, sizeof(degBench));
    for(int i = 0; i < n-1; i ++){
        int u, v;
        tie(u, v) = EdgeList2[i];
        int x2 = (x[u] + x[v])/2;
        int y2 = (y[u] + y[v])/2;

        for(int k = 0; k < 4; k ++){
            int nx = x2 + dx[k];
            int ny = y2 + dy[k];
            if(nx%2 == 1 && ny%2 == 1){
                int indx2 = benches;
                if(indxBench.find(ii(nx, ny)) != indxBench.end()){
                    indx2 = indxBench[ii(nx, ny)];
                }else{
                    benchXY[benches] = ii(nx, ny);
                    indxBench[ii(nx, ny)] = benches;
                    //printf("bench %d; (%d, %d)\n", benches, nx, ny);
                    benches ++;
                }

                AdjListBench[indx2].push_back(i);
                AdjListRoad[i].insert(indx2);
                //printf("road %d; bench %d\n", i, indx2);
                degBench[i] ++;
            }
        }
    }

    set<ii> s;
    for(int i = 0; i < n-1; i ++){
        if(degBench[i] > 0){
            s.insert(ii(degBench[i], i));
        }
    }

    int cnt2 = 0;
    while(!s.empty()){
        ii temp = *s.begin();
        int indx = temp.second;
        int bench = *(--AdjListRoad[indx].end());
        //printf("road %d matched to bench %d\n", indx, bench);

        tie(U[cnt2], V[cnt2]) = EdgeList2[indx];
        tie(A[cnt2], B[cnt2]) = benchXY[bench];
        cnt2 ++;

        for(int road: AdjListBench[bench]){
            //assert(s.count(ii(degBench[road], road)));
            s.erase(ii(degBench[road], road));
            degBench[road] --;
            AdjListRoad[road].erase(bench);

            if(degBench[road] > 0 && road != indx){
                s.insert(ii(degBench[road], road));
            }
        }
    }

    if(cnt2 == n-1){
        build(U, V, A, B);
        return 1;
    }else{
        return 0;
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct
17 Correct 21 ms 36320 KB Output is correct
18 Correct 22 ms 36272 KB Output is correct
19 Correct 22 ms 36244 KB Output is correct
20 Correct 23 ms 36216 KB Output is correct
21 Correct 21 ms 33092 KB Output is correct
22 Correct 21 ms 36256 KB Output is correct
23 Correct 1073 ms 131168 KB Output is correct
24 Correct 21 ms 36248 KB Output is correct
25 Correct 24 ms 36768 KB Output is correct
26 Correct 25 ms 33868 KB Output is correct
27 Correct 27 ms 34004 KB Output is correct
28 Correct 377 ms 74156 KB Output is correct
29 Correct 586 ms 93132 KB Output is correct
30 Correct 815 ms 112252 KB Output is correct
31 Correct 1104 ms 131080 KB Output is correct
32 Correct 22 ms 36300 KB Output is correct
33 Correct 22 ms 36300 KB Output is correct
34 Correct 22 ms 36320 KB Output is correct
35 Correct 20 ms 33100 KB Output is correct
36 Correct 22 ms 33092 KB Output is correct
37 Correct 23 ms 36288 KB Output is correct
38 Correct 22 ms 36300 KB Output is correct
39 Correct 23 ms 36332 KB Output is correct
40 Correct 20 ms 36240 KB Output is correct
41 Correct 19 ms 33100 KB Output is correct
42 Correct 24 ms 36300 KB Output is correct
43 Correct 25 ms 33612 KB Output is correct
44 Correct 27 ms 33740 KB Output is correct
45 Correct 474 ms 88320 KB Output is correct
46 Correct 768 ms 111684 KB Output is correct
47 Correct 763 ms 109556 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct
17 Correct 21 ms 36320 KB Output is correct
18 Correct 22 ms 36272 KB Output is correct
19 Correct 22 ms 36244 KB Output is correct
20 Correct 23 ms 36216 KB Output is correct
21 Correct 21 ms 33092 KB Output is correct
22 Correct 21 ms 36256 KB Output is correct
23 Correct 1073 ms 131168 KB Output is correct
24 Correct 21 ms 36248 KB Output is correct
25 Correct 24 ms 36768 KB Output is correct
26 Correct 25 ms 33868 KB Output is correct
27 Correct 27 ms 34004 KB Output is correct
28 Correct 377 ms 74156 KB Output is correct
29 Correct 586 ms 93132 KB Output is correct
30 Correct 815 ms 112252 KB Output is correct
31 Correct 1104 ms 131080 KB Output is correct
32 Correct 22 ms 36300 KB Output is correct
33 Correct 22 ms 36300 KB Output is correct
34 Correct 22 ms 36320 KB Output is correct
35 Correct 20 ms 33100 KB Output is correct
36 Correct 22 ms 33092 KB Output is correct
37 Correct 23 ms 36288 KB Output is correct
38 Correct 22 ms 36300 KB Output is correct
39 Correct 23 ms 36332 KB Output is correct
40 Correct 20 ms 36240 KB Output is correct
41 Correct 19 ms 33100 KB Output is correct
42 Correct 24 ms 36300 KB Output is correct
43 Correct 25 ms 33612 KB Output is correct
44 Correct 27 ms 33740 KB Output is correct
45 Correct 474 ms 88320 KB Output is correct
46 Correct 768 ms 111684 KB Output is correct
47 Correct 763 ms 109556 KB Output is correct
48 Correct 21 ms 36244 KB Output is correct
49 Correct 21 ms 36300 KB Output is correct
50 Correct 22 ms 36300 KB Output is correct
51 Correct 22 ms 36272 KB Output is correct
52 Correct 21 ms 36328 KB Output is correct
53 Correct 23 ms 36300 KB Output is correct
54 Correct 23 ms 36300 KB Output is correct
55 Correct 1217 ms 131572 KB Output is correct
56 Correct 21 ms 36300 KB Output is correct
57 Incorrect 28 ms 37056 KB Solution announced impossible, but it is possible.
58 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct
17 Correct 21 ms 36300 KB Output is correct
18 Correct 22 ms 36336 KB Output is correct
19 Correct 20 ms 33196 KB Output is correct
20 Correct 995 ms 129468 KB Output is correct
21 Correct 1158 ms 129492 KB Output is correct
22 Correct 1035 ms 129552 KB Output is correct
23 Correct 892 ms 132944 KB Output is correct
24 Correct 314 ms 54340 KB Output is correct
25 Correct 759 ms 77764 KB Output is correct
26 Correct 669 ms 77784 KB Output is correct
27 Correct 1100 ms 149824 KB Output is correct
28 Correct 1068 ms 149808 KB Output is correct
29 Correct 1127 ms 149776 KB Output is correct
30 Correct 1163 ms 149788 KB Output is correct
31 Correct 22 ms 36224 KB Output is correct
32 Correct 74 ms 43720 KB Output is correct
33 Correct 149 ms 43724 KB Output is correct
34 Correct 1133 ms 129420 KB Output is correct
35 Correct 35 ms 35404 KB Output is correct
36 Correct 122 ms 44336 KB Output is correct
37 Correct 252 ms 55468 KB Output is correct
38 Correct 429 ms 77592 KB Output is correct
39 Correct 557 ms 93224 KB Output is correct
40 Correct 701 ms 108560 KB Output is correct
41 Correct 1004 ms 124040 KB Output is correct
42 Correct 1143 ms 139604 KB Output is correct
43 Correct 22 ms 36300 KB Output is correct
44 Correct 24 ms 36252 KB Output is correct
45 Correct 22 ms 36320 KB Output is correct
46 Correct 19 ms 33148 KB Output is correct
47 Correct 22 ms 33104 KB Output is correct
48 Correct 22 ms 36304 KB Output is correct
49 Correct 25 ms 36236 KB Output is correct
50 Correct 21 ms 36320 KB Output is correct
51 Correct 26 ms 36292 KB Output is correct
52 Correct 21 ms 33120 KB Output is correct
53 Correct 23 ms 36212 KB Output is correct
54 Correct 23 ms 33612 KB Output is correct
55 Correct 22 ms 33864 KB Output is correct
56 Correct 577 ms 88308 KB Output is correct
57 Correct 857 ms 111772 KB Output is correct
58 Correct 855 ms 109496 KB Output is correct
59 Correct 19 ms 33100 KB Output is correct
60 Correct 21 ms 36368 KB Output is correct
61 Correct 19 ms 33132 KB Output is correct
62 Correct 1094 ms 149912 KB Output is correct
63 Correct 1163 ms 149828 KB Output is correct
64 Correct 1105 ms 149180 KB Output is correct
65 Correct 25 ms 33996 KB Output is correct
66 Correct 32 ms 35008 KB Output is correct
67 Correct 515 ms 88568 KB Output is correct
68 Correct 869 ms 114308 KB Output is correct
69 Correct 1215 ms 140096 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct
17 Correct 1249 ms 149772 KB Output is correct
18 Correct 1192 ms 149888 KB Output is correct
19 Correct 1270 ms 129496 KB Output is correct
20 Correct 1246 ms 135272 KB Output is correct
21 Correct 1085 ms 132056 KB Output is correct
22 Correct 24 ms 36300 KB Output is correct
23 Correct 173 ms 52564 KB Output is correct
24 Correct 64 ms 37724 KB Output is correct
25 Correct 237 ms 48924 KB Output is correct
26 Correct 346 ms 60224 KB Output is correct
27 Correct 520 ms 89240 KB Output is correct
28 Correct 696 ms 102564 KB Output is correct
29 Correct 877 ms 115700 KB Output is correct
30 Correct 1042 ms 128968 KB Output is correct
31 Correct 1129 ms 142292 KB Output is correct
32 Correct 1172 ms 138236 KB Output is correct
33 Correct 1202 ms 149768 KB Output is correct
34 Correct 37 ms 34232 KB Output is correct
35 Correct 38 ms 35096 KB Output is correct
36 Correct 610 ms 88664 KB Output is correct
37 Correct 843 ms 114888 KB Output is correct
38 Correct 1369 ms 141044 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33100 KB Output is correct
2 Correct 25 ms 36300 KB Output is correct
3 Correct 21 ms 33108 KB Output is correct
4 Correct 24 ms 36348 KB Output is correct
5 Correct 22 ms 36328 KB Output is correct
6 Correct 21 ms 33108 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 19 ms 33184 KB Output is correct
9 Correct 519 ms 92972 KB Output is correct
10 Correct 53 ms 42024 KB Output is correct
11 Correct 220 ms 66820 KB Output is correct
12 Correct 65 ms 44892 KB Output is correct
13 Correct 84 ms 42976 KB Output is correct
14 Correct 23 ms 33348 KB Output is correct
15 Correct 24 ms 33600 KB Output is correct
16 Correct 498 ms 93124 KB Output is correct
17 Correct 21 ms 36320 KB Output is correct
18 Correct 22 ms 36272 KB Output is correct
19 Correct 22 ms 36244 KB Output is correct
20 Correct 23 ms 36216 KB Output is correct
21 Correct 21 ms 33092 KB Output is correct
22 Correct 21 ms 36256 KB Output is correct
23 Correct 1073 ms 131168 KB Output is correct
24 Correct 21 ms 36248 KB Output is correct
25 Correct 24 ms 36768 KB Output is correct
26 Correct 25 ms 33868 KB Output is correct
27 Correct 27 ms 34004 KB Output is correct
28 Correct 377 ms 74156 KB Output is correct
29 Correct 586 ms 93132 KB Output is correct
30 Correct 815 ms 112252 KB Output is correct
31 Correct 1104 ms 131080 KB Output is correct
32 Correct 22 ms 36300 KB Output is correct
33 Correct 22 ms 36300 KB Output is correct
34 Correct 22 ms 36320 KB Output is correct
35 Correct 20 ms 33100 KB Output is correct
36 Correct 22 ms 33092 KB Output is correct
37 Correct 23 ms 36288 KB Output is correct
38 Correct 22 ms 36300 KB Output is correct
39 Correct 23 ms 36332 KB Output is correct
40 Correct 20 ms 36240 KB Output is correct
41 Correct 19 ms 33100 KB Output is correct
42 Correct 24 ms 36300 KB Output is correct
43 Correct 25 ms 33612 KB Output is correct
44 Correct 27 ms 33740 KB Output is correct
45 Correct 474 ms 88320 KB Output is correct
46 Correct 768 ms 111684 KB Output is correct
47 Correct 763 ms 109556 KB Output is correct
48 Correct 21 ms 36244 KB Output is correct
49 Correct 21 ms 36300 KB Output is correct
50 Correct 22 ms 36300 KB Output is correct
51 Correct 22 ms 36272 KB Output is correct
52 Correct 21 ms 36328 KB Output is correct
53 Correct 23 ms 36300 KB Output is correct
54 Correct 23 ms 36300 KB Output is correct
55 Correct 1217 ms 131572 KB Output is correct
56 Correct 21 ms 36300 KB Output is correct
57 Incorrect 28 ms 37056 KB Solution announced impossible, but it is possible.
58 Halted 0 ms 0 KB -