oj.uz

Submission #1021382

# Submission time Handle Problem Language Result Execution time Memory
1021382 2024-07-12T17:24:46 Z mdn2002 Fountain Parks (IOI21_parks) C++17
25 / 100
 1498 ms 177844 KB 
/*
Mayoeba Yabureru
*/
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
static vector<int> _u, _v, _a, _b;

int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    vector<vector<int>> gr(n + 1);
    vector<int> dsu(n + 1);
    x.insert(x.begin(), 0);
    y.insert(y.begin(), 0);
    map<pair<int, int>, int> mp;
    map<pair<int, int>, pair<int, int>> mpp;
    for (int i = 1; i <= n; i ++) {
        mp[{x[i], y[i]}] = i;
        dsu[i] = i;
    }
    vector<int> u, v, a, b;

    map<pair<int, int>, int> taken;

    function<int(int)> fp = [&](int x) {
        if (dsu[x] == x) return x;
        return dsu[x] = fp(dsu[x]);
    };
    for (int i = 1; i <= n; i ++) {
        vector nx = {0, 2, 0, -2}, ny = {2, 0, -2, 0};
        for (int j = 0; j < 4; j ++) {
            int xx = x[i] + nx[j], yy = y[i] + ny[j];
            if (mp[{xx, yy}]) {
                int fx = fp(i), fy = fp(mp[{xx, yy}]);
                if (fx != fy) {
                    if (x[i] < xx || y[i] < yy) {
                        u.push_back(i);
                        v.push_back(mp[{xx, yy}]);
                    }
                    else {
                        v.push_back(i);
                        u.push_back(mp[{xx, yy}]);
                    }
                    gr[i].push_back(mp[{xx, yy}]);
                    gr[mp[{xx, yy}]].push_back(i);
                    dsu[fx] = fy;
                }
            }
        }
    }

    int num = 0, st = 1;
    vector<int> vis(n + 1);
    function<void(int)> go = [&] (int v) {
        num ++;
        vis[v] = 1;
        vector nx = {0, 2, 0, -2}, ny = {2, 0, -2, 0};
        int ii = 0;
        for (int i = 0; i < 4; i ++) {
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0) continue;
            if (vis[u]) {
                ii = (i + 1) % 4;
                break;
            }
        }
        int nummmm = 10;
        while (nummmm --) {
            int i = ii;
            ii = (ii + 1) % 4;
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0 || vis[u]) continue;
            if (x[v] != x[u]) {
                int xx = v, uu = u;
                if (x[xx] > x[uu]) {
                    if (taken[{x[uu] + 1, y[uu] - 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] - 1};
                        taken[{x[uu] + 1, y[uu] - 1}] = 1;
                    }
                    else if (taken[{x[uu] + 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] + 1};
                        taken[{x[uu] + 1, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    if (taken[{x[xx] + 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] + 1};
                        taken[{x[xx] + 1, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + 1, y[xx] - 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] - 1};
                        taken[{x[xx] + 1, y[xx] - 1}] = 1;
                    }
                    else assert(0);
                }
            }
            else {
                int xx = v, uu = u;
                if (y[xx] > y[uu]) {
                    if (taken[{x[uu] + 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] + 1};
                        taken[{x[uu] + 1, y[uu] + 1}] = 1;
                    }
                    else if (taken[{x[uu] - 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] - 1, y[uu] + 1};
                        taken[{x[uu] - 1, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    if (taken[{x[xx] - 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] - 1, y[xx] + 1};
                        taken[{x[xx] - 1, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] + 1};
                        taken[{x[xx] + 1, y[xx] + 1}] = 1;
                    }
                    else assert(0);
                }
            }
            go(u);
        }
    };
    go(st);
    vector<int> uu, vv;
    for (int i = 0; i < u.size(); i ++) {
        if (mpp[{u[i], v[i]}].first == 0) continue;
        a.push_back(mpp[{u[i], v[i]}].first);
        b.push_back(mpp[{u[i], v[i]}].second);
        u[i] --;
        v[i] --;
        uu.push_back(u[i]);
        vv.push_back(v[i]);
    }
    if (num == n) {
        build(uu, vv, a, b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:128:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for (int i = 0; i < u.size(); i ++) {
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct
17 Incorrect 0 ms 348 KB Given structure is not connected: There is no path between vertices 0 and 1
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct
17 Incorrect 0 ms 348 KB Given structure is not connected: There is no path between vertices 0 and 1
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1331 ms 163248 KB Output is correct
21 Correct 1498 ms 146332 KB Output is correct
22 Correct 1357 ms 136560 KB Output is correct
23 Correct 1217 ms 124476 KB Output is correct
24 Correct 601 ms 47284 KB Output is correct
25 Correct 813 ms 55348 KB Output is correct
26 Correct 812 ms 55344 KB Output is correct
27 Correct 1364 ms 78128 KB Output is correct
28 Correct 1175 ms 78192 KB Output is correct
29 Correct 1395 ms 78208 KB Output is correct
30 Correct 1436 ms 78272 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 53 ms 8376 KB Output is correct
33 Correct 158 ms 23876 KB Output is correct
34 Correct 1233 ms 144436 KB Output is correct
35 Correct 25 ms 3408 KB Output is correct
36 Correct 137 ms 14116 KB Output is correct
37 Correct 281 ms 26804 KB Output is correct
38 Correct 398 ms 29984 KB Output is correct
39 Correct 548 ms 40692 KB Output is correct
40 Correct 783 ms 52484 KB Output is correct
41 Correct 956 ms 63012 KB Output is correct
42 Correct 1201 ms 73780 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 5 ms 1372 KB Output is correct
55 Correct 6 ms 1384 KB Output is correct
56 Correct 553 ms 67576 KB Output is correct
57 Correct 930 ms 100708 KB Output is correct
58 Correct 858 ms 98028 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1358 ms 140820 KB Output is correct
63 Correct 1490 ms 147380 KB Output is correct
64 Correct 1407 ms 156532 KB Output is correct
65 Correct 10 ms 1880 KB Output is correct
66 Correct 18 ms 3160 KB Output is correct
67 Correct 544 ms 53568 KB Output is correct
68 Correct 921 ms 88632 KB Output is correct
69 Correct 1315 ms 106548 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct
17 Incorrect 1393 ms 177844 KB Given structure is not connected: There is no path between vertices 0 and 1
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 641 ms 84680 KB Output is correct
10 Correct 39 ms 9284 KB Output is correct
11 Correct 229 ms 48128 KB Output is correct
12 Correct 53 ms 13656 KB Output is correct
13 Correct 140 ms 30116 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 5 ms 1200 KB Output is correct
16 Correct 619 ms 67648 KB Output is correct
17 Incorrect 0 ms 348 KB Given structure is not connected: There is no path between vertices 0 and 1
18 Halted 0 ms 0 KB -