oj.uz

Submission #435702

# Submission time Handle Problem Language Result Execution time Memory
435702 2021-06-23T15:16:13 Z talant117408 Fountain Parks (IOI21_parks) C++17
55 / 100
 1162 ms 90940 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;

const int MAXN = 6e5+7;
vector <int> graph[MAXN];
int N, RN, BN, degree[MAXN], parent[MAXN];
bool used[MAXN];
int link[MAXN], saizu[MAXN];
int x[MAXN], y[MAXN];
pii roads[MAXN];
vector <pii> benches;

int find(int n) {
    if (n == link[n]) return n;
    return link[n] = find(link[n]);
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b) return;
    if (saizu[a] < saizu[b]) swap(a, b);
    saizu[a] += saizu[b];
    link[b] = a;
}

bool same(int a, int b) {
    return find(a) == find(b);
}

void dfs(int v) {
    used[v] = 1;
    for (auto to : graph[v]) {
        if (!used[to]) {
            dfs(to);
        }
    }
}

void dfs2(int v, int p) {
    parent[v] = p;
    used[v] = 1;
    for (auto to : graph[v]) {
        if (used[to]) continue;
        degree[v]++;
        dfs2(to, v);
    }
}

int construct_roads(vector<int> X, vector<int> Y) {
    N = sz(X);
    
    if (N == 1) {
        build({}, {}, {}, {});
        return 1;
    }
    
    for (int i = 0; i < N; i++) {
        link[i] = i;
        saizu[i] = 1;
        x[i] = X[i];
        y[i] = Y[i];
    }
    X.clear(); Y.clear();
    
    //***************** get roads and benches *****************
    vector <pair <pii, int>> tmp;
    vector <pii> edges;
    set <pii> tmpBenches;
    for (int i = 0; i < N; i++) {
        tmp.pb(mp(mp(x[i], y[i]), i));
    }
    sort(all(tmp));
    for (int i = 0; i < N; i++) {
        auto it = lb(all(tmp), mp(mp(x[i]-2, y[i]), 0));
        if (it != tmp.end() && (*it).first == mp(x[i]-2, y[i])) {
            edges.pb(mp(i, (*it).second));
        }
        it = lb(all(tmp), mp(mp(x[i]+2, y[i]), 0));
        if (it != tmp.end() && (*it).first == mp(x[i]+2, y[i])) {
            edges.pb(mp(i, (*it).second));
        }
        it = lb(all(tmp), mp(mp(x[i], y[i]-2), 0));
        if (it != tmp.end() && (*it).first == mp(x[i], y[i]-2)) {
            edges.pb(mp(i, (*it).second));
        }
        it = lb(all(tmp), mp(mp(x[i], y[i]+2), 0));
        if (it != tmp.end() && (*it).first == mp(x[i], y[i]+2)) {
            edges.pb(mp(i, (*it).second));
        }
    }
    for (auto &to : edges) {
        if (mp(x[to.first], y[to.first]) > mp(x[to.second], y[to.second])) {
            swap(to.first, to.second);
        }
        if (!same(to.first, to.second)) {
            unite(to.first, to.second);
            graph[to.first].pb(to.second);
            graph[to.second].pb(to.first);
            roads[RN++] = mp(to.first, to.second);
            if (x[to.first] == x[to.second]) {
                tmpBenches.insert(mp(x[to.first]-1, y[to.first]+1));
                tmpBenches.insert(mp(x[to.first]+1, y[to.first]+1));
            }
            else {
                tmpBenches.insert(mp(x[to.first]+1, y[to.first]+1));
                tmpBenches.insert(mp(x[to.first]+1, y[to.first]-1));
            }
        }
    }
    for (auto to : tmpBenches) {
        benches.pb(to);
    }
    BN = sz(benches);
    //***************** get roads and benches *****************
    
    //***************** check if connected ***************** 
    dfs(0);
    bool flag = 1;
    for (int i = 0; i < N; i++) {
        if (!used[i]) {
            flag = 0;
            break;
        }
    }
    if (!flag) {
        return 0;
    }
    for (int i = 0; i < RN+BN; i++) {
        link[i] = i;
        saizu[i] = 1;
        used[i] = 0;
        graph[i].clear();
    }
    edges.clear();
    //***************** check if connected ***************** 
    
    //***************** create a new graph *****************
    for (int i = 0; i < RN; i++) {
        auto a = roads[i].first, b = roads[i].second;
        if (x[a] == x[b]) {
            auto it = lb(all(benches), mp(x[a]-1, y[a]+1))-benches.begin();
            edges.pb(mp(i, it+RN));
            it = lb(all(benches), mp(x[a]+1, y[a]+1))-benches.begin();
            edges.pb(mp(i, it+RN));
        }
        else {
            auto it = lb(all(benches), mp(x[a]+1, y[a]-1))-benches.begin();
            edges.pb(mp(i, it+RN));
            it = lb(all(benches), mp(x[a]+1, y[a]+1))-benches.begin();
            edges.pb(mp(i, it+RN));
        }
    }
    for (auto to : edges) {
        if (!same(to.first, to.second)) {
            unite(to.first, to.second);
            graph[to.first].pb(to.second);
            graph[to.second].pb(to.first);
        }
    }
    for (int i = 0; i < RN; i++) {
        if (!used[i] && sz(graph[i]) == 1) {
            dfs2(i, i);
        }
    }
    for (int i = 0; i < RN; i++) {
        if (!used[i]) {
            dfs2(i, i);
        }
    }
    for (int i = 0; i < RN+BN; i++) {
        used[i] = 0;
    }
    //***************** create a new graph *****************
    
    //***************** get the answer *****************
    vector <int> _u, _v, _x, _y;
    queue <int> K;
    for (int i = RN; i < RN+BN; i++) {
        if (!degree[i]) {
            K.push(i);
        }
    }
    while (!K.empty()) {
        auto v = K.front(); K.pop();
        if (!used[v] && !used[parent[v]]) {
            used[v] = 1;
            used[parent[v]] = 1;
            _u.pb(roads[parent[v]].first);
            _v.pb(roads[parent[v]].second);
            _x.pb(benches[v-RN].first);
            _y.pb(benches[v-RN].second);
            v = parent[parent[v]];
            if (v >= RN) {
                degree[v]--;
                if (!used[v] && !degree[v]) {
                    K.push(v);
                }
            }
        }
    }
    build(_u, _v, _x, _y);
    //***************** get the answer *****************
    
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1012 ms 72752 KB Output is correct
24 Correct 11 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 17 ms 15052 KB Output is correct
28 Correct 379 ms 38112 KB Output is correct
29 Correct 527 ms 48868 KB Output is correct
30 Correct 849 ms 61776 KB Output is correct
31 Correct 1034 ms 72532 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 9 ms 14412 KB Output is correct
34 Correct 9 ms 14412 KB Output is correct
35 Correct 10 ms 14412 KB Output is correct
36 Correct 10 ms 14328 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 12 ms 14412 KB Output is correct
40 Correct 11 ms 14396 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 10 ms 14412 KB Output is correct
43 Correct 13 ms 14780 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 470 ms 45492 KB Output is correct
46 Correct 739 ms 60332 KB Output is correct
47 Correct 779 ms 60372 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1012 ms 72752 KB Output is correct
24 Correct 11 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 17 ms 15052 KB Output is correct
28 Correct 379 ms 38112 KB Output is correct
29 Correct 527 ms 48868 KB Output is correct
30 Correct 849 ms 61776 KB Output is correct
31 Correct 1034 ms 72532 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 9 ms 14412 KB Output is correct
34 Correct 9 ms 14412 KB Output is correct
35 Correct 10 ms 14412 KB Output is correct
36 Correct 10 ms 14328 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 12 ms 14412 KB Output is correct
40 Correct 11 ms 14396 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 10 ms 14412 KB Output is correct
43 Correct 13 ms 14780 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 470 ms 45492 KB Output is correct
46 Correct 739 ms 60332 KB Output is correct
47 Correct 779 ms 60372 KB Output is correct
48 Correct 10 ms 14412 KB Output is correct
49 Correct 10 ms 14412 KB Output is correct
50 Correct 10 ms 14412 KB Output is correct
51 Correct 11 ms 14412 KB Output is correct
52 Correct 11 ms 14412 KB Output is correct
53 Correct 10 ms 14412 KB Output is correct
54 Correct 10 ms 14412 KB Output is correct
55 Incorrect 991 ms 69824 KB Given structure is not connected: There is no path between vertices 0 and 1
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 11 ms 14412 KB Output is correct
20 Correct 1056 ms 90940 KB Output is correct
21 Correct 1060 ms 73488 KB Output is correct
22 Correct 1110 ms 74596 KB Output is correct
23 Correct 991 ms 78540 KB Output is correct
24 Correct 254 ms 23880 KB Output is correct
25 Correct 810 ms 58824 KB Output is correct
26 Correct 744 ms 58892 KB Output is correct
27 Correct 1072 ms 88464 KB Output is correct
28 Correct 1162 ms 88608 KB Output is correct
29 Correct 1141 ms 87060 KB Output is correct
30 Correct 1090 ms 86988 KB Output is correct
31 Correct 11 ms 14412 KB Output is correct
32 Correct 51 ms 18612 KB Output is correct
33 Correct 104 ms 19136 KB Output is correct
34 Correct 1049 ms 86860 KB Output is correct
35 Correct 27 ms 16140 KB Output is correct
36 Correct 111 ms 23132 KB Output is correct
37 Correct 276 ms 31792 KB Output is correct
38 Correct 345 ms 37176 KB Output is correct
39 Correct 554 ms 45124 KB Output is correct
40 Correct 740 ms 54684 KB Output is correct
41 Correct 927 ms 62692 KB Output is correct
42 Correct 1127 ms 70640 KB Output is correct
43 Correct 10 ms 14412 KB Output is correct
44 Correct 10 ms 14412 KB Output is correct
45 Correct 10 ms 14328 KB Output is correct
46 Correct 10 ms 14412 KB Output is correct
47 Correct 10 ms 14376 KB Output is correct
48 Correct 10 ms 14412 KB Output is correct
49 Correct 9 ms 14412 KB Output is correct
50 Correct 10 ms 14412 KB Output is correct
51 Correct 10 ms 14412 KB Output is correct
52 Correct 10 ms 14412 KB Output is correct
53 Correct 9 ms 14412 KB Output is correct
54 Correct 15 ms 14804 KB Output is correct
55 Correct 15 ms 14924 KB Output is correct
56 Correct 462 ms 45508 KB Output is correct
57 Correct 764 ms 60312 KB Output is correct
58 Correct 752 ms 60440 KB Output is correct
59 Correct 10 ms 14412 KB Output is correct
60 Correct 9 ms 14412 KB Output is correct
61 Correct 9 ms 14340 KB Output is correct
62 Correct 1098 ms 89548 KB Output is correct
63 Correct 1141 ms 89484 KB Output is correct
64 Correct 1076 ms 89700 KB Output is correct
65 Correct 16 ms 15180 KB Output is correct
66 Correct 23 ms 15900 KB Output is correct
67 Correct 464 ms 44576 KB Output is correct
68 Correct 794 ms 60976 KB Output is correct
69 Correct 1127 ms 74668 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct
17 Correct 1085 ms 90300 KB Output is correct
18 Correct 1093 ms 88848 KB Output is correct
19 Correct 1012 ms 87052 KB Output is correct
20 Correct 949 ms 71392 KB Output is correct
21 Correct 945 ms 73356 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 108 ms 23472 KB Output is correct
24 Correct 45 ms 18048 KB Output is correct
25 Correct 166 ms 27308 KB Output is correct
26 Correct 351 ms 36740 KB Output is correct
27 Correct 443 ms 43328 KB Output is correct
28 Correct 594 ms 50368 KB Output is correct
29 Correct 747 ms 58700 KB Output is correct
30 Correct 896 ms 65436 KB Output is correct
31 Correct 1052 ms 72312 KB Output is correct
32 Correct 1066 ms 78148 KB Output is correct
33 Correct 1161 ms 90024 KB Output is correct
34 Correct 17 ms 15308 KB Output is correct
35 Correct 23 ms 16080 KB Output is correct
36 Correct 499 ms 44940 KB Output is correct
37 Correct 799 ms 61124 KB Output is correct
38 Correct 1127 ms 75776 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 9 ms 14444 KB Output is correct
3 Correct 9 ms 14412 KB Output is correct
4 Correct 10 ms 14412 KB Output is correct
5 Correct 9 ms 14448 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 10 ms 14340 KB Output is correct
8 Correct 10 ms 14412 KB Output is correct
9 Correct 558 ms 52324 KB Output is correct
10 Correct 28 ms 18316 KB Output is correct
11 Correct 128 ms 34904 KB Output is correct
12 Correct 48 ms 20044 KB Output is correct
13 Correct 65 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 12 ms 14796 KB Output is correct
16 Correct 475 ms 51700 KB Output is correct
17 Correct 9 ms 14412 KB Output is correct
18 Correct 10 ms 14412 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 11 ms 14412 KB Output is correct
21 Correct 11 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1012 ms 72752 KB Output is correct
24 Correct 11 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 17 ms 15052 KB Output is correct
28 Correct 379 ms 38112 KB Output is correct
29 Correct 527 ms 48868 KB Output is correct
30 Correct 849 ms 61776 KB Output is correct
31 Correct 1034 ms 72532 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 9 ms 14412 KB Output is correct
34 Correct 9 ms 14412 KB Output is correct
35 Correct 10 ms 14412 KB Output is correct
36 Correct 10 ms 14328 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 12 ms 14412 KB Output is correct
40 Correct 11 ms 14396 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 10 ms 14412 KB Output is correct
43 Correct 13 ms 14780 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 470 ms 45492 KB Output is correct
46 Correct 739 ms 60332 KB Output is correct
47 Correct 779 ms 60372 KB Output is correct
48 Correct 10 ms 14412 KB Output is correct
49 Correct 10 ms 14412 KB Output is correct
50 Correct 10 ms 14412 KB Output is correct
51 Correct 11 ms 14412 KB Output is correct
52 Correct 11 ms 14412 KB Output is correct
53 Correct 10 ms 14412 KB Output is correct
54 Correct 10 ms 14412 KB Output is correct
55 Incorrect 991 ms 69824 KB Given structure is not connected: There is no path between vertices 0 and 1
56 Halted 0 ms 0 KB -