oj.uz

Submission #1021234

# Submission time Handle Problem Language Result Execution time Memory
1021234 2024-07-12T16:07:42 Z mdn2002 Fountain Parks (IOI21_parks) C++17
25 / 100
 1223 ms 172592 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 ++) {
        if (mp[{x[i] + 2, y[i]}]) {
            int fx = fp(i), fy = fp(mp[{x[i] + 2, y[i]}]);
            if (fx != fy) {
                u.push_back(i), v.push_back(mp[{x[i] + 2, y[i]}]);
                gr[i].push_back(mp[{x[i] + 2, y[i]}]);
                gr[mp[{x[i] + 2, y[i]}]].push_back(i);
                dsu[fx] = fy;
            }
        }
        if (mp[{x[i], y[i] + 2}]) {
            int fx = fp(i), fy = fp(mp[{x[i], y[i] + 2}]);
            if (fx != fy) {
                u.push_back(i), v.push_back(mp[{x[i], y[i] + 2}]);
                gr[i].push_back(mp[{x[i], y[i] + 2}]);
                gr[mp[{x[i], y[i] + 2}]].push_back(i);
                dsu[fx] = fy;
            }
        }
    }

    int num = 0, st = 0;
    vector<int> vis(n + 1);
    for (int i = 1; i <= n; i ++) {
        if (gr[i].size() == 1) {
            st = i;
            break;
        }
    }
    function<void(int)> go = [&] (int v) {
        num ++;
        vis[v] = 1;
        vector nx = {0, 2, 0, -2};
        vector 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);
    for (int i = 0; i < u.size(); i ++) {
        a.push_back(mpp[{u[i], v[i]}].first);
        b.push_back(mpp[{u[i], v[i]}].second);
        u[i] --;
        v[i] --;
    }
    if (num == n) {
        build(u, v, a, b);
        return 1;
    }
    return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB a[0] = 0 is not an odd integer
20 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB a[0] = 0 is not an odd integer
20 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 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 348 KB Output is correct
20 Correct 989 ms 163384 KB Output is correct
21 Correct 1111 ms 165684 KB Output is correct
22 Correct 1018 ms 162352 KB Output is correct
23 Correct 986 ms 149468 KB Output is correct
24 Correct 381 ms 49064 KB Output is correct
25 Correct 488 ms 58416 KB Output is correct
26 Correct 530 ms 58416 KB Output is correct
27 Correct 986 ms 77868 KB Output is correct
28 Correct 982 ms 77620 KB Output is correct
29 Correct 1134 ms 77856 KB Output is correct
30 Correct 1144 ms 77864 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 46 ms 7812 KB Output is correct
33 Correct 108 ms 24992 KB Output is correct
34 Correct 1018 ms 165804 KB Output is correct
35 Correct 21 ms 3412 KB Output is correct
36 Correct 101 ms 14792 KB Output is correct
37 Correct 213 ms 28192 KB Output is correct
38 Correct 300 ms 30288 KB Output is correct
39 Correct 471 ms 41204 KB Output is correct
40 Correct 618 ms 52024 KB Output is correct
41 Correct 815 ms 63296 KB Output is correct
42 Correct 947 ms 74292 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 348 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 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 4 ms 1372 KB Output is correct
55 Correct 5 ms 1296 KB Output is correct
56 Correct 446 ms 64064 KB Output is correct
57 Correct 698 ms 93960 KB Output is correct
58 Correct 715 ms 81692 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 436 KB Output is correct
61 Correct 0 ms 604 KB Output is correct
62 Correct 1216 ms 171392 KB Output is correct
63 Correct 1181 ms 165032 KB Output is correct
64 Correct 1223 ms 167192 KB Output is correct
65 Correct 7 ms 1880 KB Output is correct
66 Correct 13 ms 3120 KB Output is correct
67 Correct 446 ms 53060 KB Output is correct
68 Correct 736 ms 93664 KB Output is correct
69 Correct 1000 ms 117552 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 KB Output is correct
17 Correct 1147 ms 172592 KB Output is correct
18 Incorrect 1146 ms 168828 KB a[11866] = 0 is not an odd integer
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 1 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 505 ms 88108 KB Output is correct
10 Correct 26 ms 9060 KB Output is correct
11 Correct 185 ms 47784 KB Output is correct
12 Correct 45 ms 13412 KB Output is correct
13 Correct 110 ms 29168 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1188 KB Output is correct
16 Correct 478 ms 82008 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Incorrect 0 ms 348 KB a[0] = 0 is not an odd integer
20 Halted 0 ms 0 KB -