oj.uz

답안 #435743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435743 2021-06-23T16:26:05 Z talant117408 분수 공원 (IOI21_parks) C++17
15 / 100
 1142 ms 92020 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];
int used[MAXN];
int link[MAXN], saizu[MAXN];
int x[MAXN], y[MAXN];
vector <int> WrongRoads;
int numOfWrongRoads;
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) {
    used[v] = 1;
    if (v < RN && sz(graph[v]) == 1) {
        WrongRoads.pb(v);
        numOfWrongRoads++;
    }
    for (auto to : graph[v]) {
        if (!used[to]) {
            dfs2(to, v);
        }
    }
    used[v] = 2;
}

void dfs3(int v, int p) {
    parent[v] = p;
    used[v] = 1;
    for (auto to : graph[v]) {
        if (used[to]) continue;
        degree[v]++;
        dfs3(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]) {
            numOfWrongRoads = 0;
            dfs2(i, i);
            if (numOfWrongRoads > 1) {
                WrongRoads.pop_back();
            }
        }
    }
    for (int i = 0; i < RN+BN; i++) {
        used[i] = 0;
    }
    for (auto to : WrongRoads) {
        used[to] = 1;
    }
    for (int i = 0; i < RN; i++) {
        if (!used[i] && sz(graph[i]) == 1) {
            dfs3(i, i);
        }
    }
    for (int i = 0; i < RN; i++) {
        if (!used[i]) {
            dfs3(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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct
17 Correct 8 ms 14432 KB Output is correct
18 Correct 8 ms 14448 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 10 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 1018 ms 73988 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 12 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 14 ms 15068 KB Output is correct
28 Correct 335 ms 38604 KB Output is correct
29 Correct 577 ms 49636 KB Output is correct
30 Correct 785 ms 62852 KB Output is correct
31 Correct 1075 ms 73792 KB Output is correct
32 Correct 9 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 14404 KB Output is correct
36 Correct 9 ms 14408 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 11 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 9 ms 14412 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 12 ms 14704 KB Output is correct
44 Correct 15 ms 14940 KB Output is correct
45 Correct 472 ms 46092 KB Output is correct
46 Correct 767 ms 61324 KB Output is correct
47 Correct 796 ms 61208 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct
17 Correct 8 ms 14432 KB Output is correct
18 Correct 8 ms 14448 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 10 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 1018 ms 73988 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 12 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 14 ms 15068 KB Output is correct
28 Correct 335 ms 38604 KB Output is correct
29 Correct 577 ms 49636 KB Output is correct
30 Correct 785 ms 62852 KB Output is correct
31 Correct 1075 ms 73792 KB Output is correct
32 Correct 9 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 14404 KB Output is correct
36 Correct 9 ms 14408 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 11 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 9 ms 14412 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 12 ms 14704 KB Output is correct
44 Correct 15 ms 14940 KB Output is correct
45 Correct 472 ms 46092 KB Output is correct
46 Correct 767 ms 61324 KB Output is correct
47 Correct 796 ms 61208 KB Output is correct
48 Correct 9 ms 14412 KB Output is correct
49 Correct 10 ms 14540 KB Output is correct
50 Correct 10 ms 14412 KB Output is correct
51 Incorrect 10 ms 14412 KB Given structure is not connected: There is no path between vertices 0 and 3
52 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct
17 Correct 8 ms 14412 KB Output is correct
18 Correct 8 ms 14412 KB Output is correct
19 Correct 8 ms 14344 KB Output is correct
20 Correct 1037 ms 92020 KB Output is correct
21 Correct 1034 ms 74736 KB Output is correct
22 Correct 1046 ms 75764 KB Output is correct
23 Correct 868 ms 79992 KB Output is correct
24 Correct 201 ms 23832 KB Output is correct
25 Correct 669 ms 58812 KB Output is correct
26 Correct 681 ms 58844 KB Output is correct
27 Correct 1142 ms 90220 KB Output is correct
28 Correct 1076 ms 90220 KB Output is correct
29 Correct 1109 ms 88792 KB Output is correct
30 Correct 1129 ms 88728 KB Output is correct
31 Correct 9 ms 14412 KB Output is correct
32 Incorrect 50 ms 18716 KB Given structure is not connected: There is no path between vertices 0 and 1
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct
17 Correct 1085 ms 91876 KB Output is correct
18 Incorrect 1077 ms 90572 KB Given structure is not connected: There is no path between vertices 0 and 3
19 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14284 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 9 ms 14424 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 8 ms 14412 KB Output is correct
6 Correct 10 ms 14392 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 9 ms 14412 KB Output is correct
9 Correct 461 ms 53228 KB Output is correct
10 Correct 27 ms 18372 KB Output is correct
11 Correct 122 ms 35280 KB Output is correct
12 Correct 37 ms 20232 KB Output is correct
13 Correct 62 ms 24504 KB Output is correct
14 Correct 10 ms 14600 KB Output is correct
15 Correct 13 ms 14800 KB Output is correct
16 Correct 506 ms 52516 KB Output is correct
17 Correct 8 ms 14432 KB Output is correct
18 Correct 8 ms 14448 KB Output is correct
19 Correct 8 ms 14364 KB Output is correct
20 Correct 10 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 1018 ms 73988 KB Output is correct
24 Correct 9 ms 14412 KB Output is correct
25 Correct 12 ms 14796 KB Output is correct
26 Correct 13 ms 14924 KB Output is correct
27 Correct 14 ms 15068 KB Output is correct
28 Correct 335 ms 38604 KB Output is correct
29 Correct 577 ms 49636 KB Output is correct
30 Correct 785 ms 62852 KB Output is correct
31 Correct 1075 ms 73792 KB Output is correct
32 Correct 9 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 14404 KB Output is correct
36 Correct 9 ms 14408 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 11 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 9 ms 14412 KB Output is correct
41 Correct 10 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 12 ms 14704 KB Output is correct
44 Correct 15 ms 14940 KB Output is correct
45 Correct 472 ms 46092 KB Output is correct
46 Correct 767 ms 61324 KB Output is correct
47 Correct 796 ms 61208 KB Output is correct
48 Correct 9 ms 14412 KB Output is correct
49 Correct 10 ms 14540 KB Output is correct
50 Correct 10 ms 14412 KB Output is correct
51 Incorrect 10 ms 14412 KB Given structure is not connected: There is no path between vertices 0 and 3
52 Halted 0 ms 0 KB -