oj.uz

Submission #1021375

# Submission time Handle Problem Language Result Execution time Memory
1021375 2024-07-12T17:22:04 Z mdn2002 Fountain Parks (IOI21_parks) C++17
25 / 100
 1362 ms 175928 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);
    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:127:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |     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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 KB Output is correct
17 Incorrect 0 ms 348 KB a[1] = 0 is not an odd integer
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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 KB Output is correct
17 Incorrect 0 ms 348 KB a[1] = 0 is not an odd integer
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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 KB Output is correct
17 Correct 0 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 1121 ms 161428 KB Output is correct
21 Correct 1199 ms 144456 KB Output is correct
22 Correct 1140 ms 134328 KB Output is correct
23 Correct 1016 ms 122668 KB Output is correct
24 Correct 495 ms 47412 KB Output is correct
25 Correct 685 ms 56976 KB Output is correct
26 Correct 716 ms 57140 KB Output is correct
27 Correct 1158 ms 76072 KB Output is correct
28 Correct 1123 ms 76084 KB Output is correct
29 Correct 1341 ms 76028 KB Output is correct
30 Correct 1347 ms 76084 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 52 ms 8168 KB Output is correct
33 Correct 144 ms 23872 KB Output is correct
34 Correct 1133 ms 142388 KB Output is correct
35 Correct 25 ms 3416 KB Output is correct
36 Correct 136 ms 14280 KB Output is correct
37 Correct 283 ms 27316 KB Output is correct
38 Correct 353 ms 29144 KB Output is correct
39 Correct 523 ms 39604 KB Output is correct
40 Correct 729 ms 50480 KB Output is correct
41 Correct 939 ms 61088 KB Output is correct
42 Correct 1176 ms 71608 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 1 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 5 ms 1372 KB Output is correct
55 Correct 6 ms 1372 KB Output is correct
56 Correct 510 ms 66484 KB Output is correct
57 Correct 806 ms 98572 KB Output is correct
58 Correct 817 ms 96068 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1258 ms 138848 KB Output is correct
63 Correct 1339 ms 145604 KB Output is correct
64 Correct 1333 ms 155148 KB Output is correct
65 Correct 10 ms 1880 KB Output is correct
66 Correct 18 ms 3164 KB Output is correct
67 Correct 541 ms 52288 KB Output is correct
68 Correct 917 ms 86500 KB Output is correct
69 Correct 1314 ms 104344 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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 KB Output is correct
17 Incorrect 1362 ms 175928 KB a[1] = 0 is not an odd integer
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 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 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 563 ms 83668 KB Output is correct
10 Correct 27 ms 9060 KB Output is correct
11 Correct 212 ms 47668 KB Output is correct
12 Correct 43 ms 13396 KB Output is correct
13 Correct 124 ms 30032 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 516 ms 66868 KB Output is correct
17 Incorrect 0 ms 348 KB a[1] = 0 is not an odd integer
18 Halted 0 ms 0 KB -