oj.uz

답안 #435724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435724 2021-06-23T15:50:53 Z talant117408 분수 공원 (IOI21_parks) C++17
55 / 100
 1297 ms 92056 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];
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) 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) {
                return 0;
            }
        }
    }
    for (int i = 0; i < RN+BN; i++) {
        used[i] = 0;
    }
    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 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct
17 Correct 11 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 13 ms 14412 KB Output is correct
21 Correct 10 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1146 ms 73964 KB Output is correct
24 Correct 10 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 14 ms 14924 KB Output is correct
27 Correct 16 ms 15180 KB Output is correct
28 Correct 348 ms 38672 KB Output is correct
29 Correct 568 ms 49716 KB Output is correct
30 Correct 844 ms 62788 KB Output is correct
31 Correct 1069 ms 73800 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 10 ms 14412 KB Output is correct
34 Correct 11 ms 14420 KB Output is correct
35 Correct 11 ms 14412 KB Output is correct
36 Correct 11 ms 14412 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 11 ms 14428 KB Output is correct
41 Correct 9 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 13 ms 14796 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 501 ms 46156 KB Output is correct
46 Correct 909 ms 61316 KB Output is correct
47 Correct 852 ms 61228 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct
17 Correct 11 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 13 ms 14412 KB Output is correct
21 Correct 10 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1146 ms 73964 KB Output is correct
24 Correct 10 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 14 ms 14924 KB Output is correct
27 Correct 16 ms 15180 KB Output is correct
28 Correct 348 ms 38672 KB Output is correct
29 Correct 568 ms 49716 KB Output is correct
30 Correct 844 ms 62788 KB Output is correct
31 Correct 1069 ms 73800 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 10 ms 14412 KB Output is correct
34 Correct 11 ms 14420 KB Output is correct
35 Correct 11 ms 14412 KB Output is correct
36 Correct 11 ms 14412 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 11 ms 14428 KB Output is correct
41 Correct 9 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 13 ms 14796 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 501 ms 46156 KB Output is correct
46 Correct 909 ms 61316 KB Output is correct
47 Correct 852 ms 61228 KB Output is correct
48 Correct 9 ms 14332 KB Output is correct
49 Correct 10 ms 14412 KB Output is correct
50 Correct 11 ms 14412 KB Output is correct
51 Correct 10 ms 14408 KB Output is correct
52 Correct 11 ms 14364 KB Output is correct
53 Correct 10 ms 14412 KB Output is correct
54 Correct 10 ms 14412 KB Output is correct
55 Incorrect 876 ms 58500 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct
17 Correct 10 ms 14412 KB Output is correct
18 Correct 10 ms 14388 KB Output is correct
19 Correct 10 ms 14412 KB Output is correct
20 Correct 1210 ms 92056 KB Output is correct
21 Correct 1126 ms 74712 KB Output is correct
22 Correct 1181 ms 75792 KB Output is correct
23 Correct 916 ms 80040 KB Output is correct
24 Correct 209 ms 23868 KB Output is correct
25 Correct 731 ms 58764 KB Output is correct
26 Correct 675 ms 58804 KB Output is correct
27 Correct 1137 ms 90260 KB Output is correct
28 Correct 1167 ms 90380 KB Output is correct
29 Correct 1160 ms 88648 KB Output is correct
30 Correct 1173 ms 88720 KB Output is correct
31 Correct 9 ms 14412 KB Output is correct
32 Correct 55 ms 18628 KB Output is correct
33 Correct 99 ms 19136 KB Output is correct
34 Correct 1177 ms 87912 KB Output is correct
35 Correct 27 ms 16124 KB Output is correct
36 Correct 115 ms 23192 KB Output is correct
37 Correct 333 ms 32044 KB Output is correct
38 Correct 394 ms 37812 KB Output is correct
39 Correct 591 ms 45880 KB Output is correct
40 Correct 826 ms 55716 KB Output is correct
41 Correct 1031 ms 63752 KB Output is correct
42 Correct 1275 ms 72024 KB Output is correct
43 Correct 9 ms 14412 KB Output is correct
44 Correct 9 ms 14412 KB Output is correct
45 Correct 11 ms 14412 KB Output is correct
46 Correct 10 ms 14412 KB Output is correct
47 Correct 10 ms 14320 KB Output is correct
48 Correct 12 ms 14412 KB Output is correct
49 Correct 9 ms 14412 KB Output is correct
50 Correct 9 ms 14412 KB Output is correct
51 Correct 9 ms 14412 KB Output is correct
52 Correct 10 ms 14412 KB Output is correct
53 Correct 10 ms 14412 KB Output is correct
54 Correct 13 ms 14772 KB Output is correct
55 Correct 14 ms 15012 KB Output is correct
56 Correct 507 ms 46056 KB Output is correct
57 Correct 867 ms 61436 KB Output is correct
58 Correct 840 ms 61236 KB Output is correct
59 Correct 9 ms 14412 KB Output is correct
60 Correct 10 ms 14412 KB Output is correct
61 Correct 10 ms 14424 KB Output is correct
62 Correct 1161 ms 91272 KB Output is correct
63 Correct 1213 ms 91252 KB Output is correct
64 Correct 1259 ms 91312 KB Output is correct
65 Correct 19 ms 15080 KB Output is correct
66 Correct 22 ms 15920 KB Output is correct
67 Correct 506 ms 45092 KB Output is correct
68 Correct 914 ms 61760 KB Output is correct
69 Correct 1297 ms 76016 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct
17 Correct 1152 ms 91788 KB Output is correct
18 Correct 1194 ms 90776 KB Output is correct
19 Correct 1137 ms 88120 KB Output is correct
20 Correct 1100 ms 72664 KB Output is correct
21 Correct 1041 ms 74648 KB Output is correct
22 Correct 11 ms 14412 KB Output is correct
23 Correct 122 ms 23696 KB Output is correct
24 Correct 58 ms 18112 KB Output is correct
25 Correct 177 ms 27544 KB Output is correct
26 Correct 337 ms 37276 KB Output is correct
27 Correct 503 ms 44084 KB Output is correct
28 Correct 721 ms 51020 KB Output is correct
29 Correct 887 ms 59536 KB Output is correct
30 Correct 975 ms 66688 KB Output is correct
31 Correct 1137 ms 73640 KB Output is correct
32 Correct 1221 ms 79484 KB Output is correct
33 Correct 1171 ms 91860 KB Output is correct
34 Correct 21 ms 15304 KB Output is correct
35 Correct 24 ms 16092 KB Output is correct
36 Correct 541 ms 45752 KB Output is correct
37 Correct 938 ms 62240 KB Output is correct
38 Correct 1212 ms 77356 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14284 KB Output is correct
2 Correct 10 ms 14396 KB Output is correct
3 Correct 10 ms 14412 KB Output is correct
4 Correct 9 ms 14412 KB Output is correct
5 Correct 9 ms 14412 KB Output is correct
6 Correct 10 ms 14412 KB Output is correct
7 Correct 9 ms 14412 KB Output is correct
8 Correct 10 ms 14416 KB Output is correct
9 Correct 538 ms 53232 KB Output is correct
10 Correct 29 ms 18316 KB Output is correct
11 Correct 125 ms 35276 KB Output is correct
12 Correct 37 ms 20228 KB Output is correct
13 Correct 74 ms 24380 KB Output is correct
14 Correct 12 ms 14540 KB Output is correct
15 Correct 14 ms 14796 KB Output is correct
16 Correct 510 ms 52444 KB Output is correct
17 Correct 11 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 13 ms 14412 KB Output is correct
21 Correct 10 ms 14412 KB Output is correct
22 Correct 10 ms 14412 KB Output is correct
23 Correct 1146 ms 73964 KB Output is correct
24 Correct 10 ms 14412 KB Output is correct
25 Correct 13 ms 14796 KB Output is correct
26 Correct 14 ms 14924 KB Output is correct
27 Correct 16 ms 15180 KB Output is correct
28 Correct 348 ms 38672 KB Output is correct
29 Correct 568 ms 49716 KB Output is correct
30 Correct 844 ms 62788 KB Output is correct
31 Correct 1069 ms 73800 KB Output is correct
32 Correct 10 ms 14412 KB Output is correct
33 Correct 10 ms 14412 KB Output is correct
34 Correct 11 ms 14420 KB Output is correct
35 Correct 11 ms 14412 KB Output is correct
36 Correct 11 ms 14412 KB Output is correct
37 Correct 10 ms 14412 KB Output is correct
38 Correct 10 ms 14412 KB Output is correct
39 Correct 10 ms 14412 KB Output is correct
40 Correct 11 ms 14428 KB Output is correct
41 Correct 9 ms 14412 KB Output is correct
42 Correct 9 ms 14412 KB Output is correct
43 Correct 13 ms 14796 KB Output is correct
44 Correct 15 ms 14924 KB Output is correct
45 Correct 501 ms 46156 KB Output is correct
46 Correct 909 ms 61316 KB Output is correct
47 Correct 852 ms 61228 KB Output is correct
48 Correct 9 ms 14332 KB Output is correct
49 Correct 10 ms 14412 KB Output is correct
50 Correct 11 ms 14412 KB Output is correct
51 Correct 10 ms 14408 KB Output is correct
52 Correct 11 ms 14364 KB Output is correct
53 Correct 10 ms 14412 KB Output is correct
54 Correct 10 ms 14412 KB Output is correct
55 Incorrect 876 ms 58500 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -