oj.uz

답안 #1061395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061395 2024-08-16T08:38:41 Z TheQuantiX 분수 공원 (IOI21_parks) C++17
30 / 100
 123 ms 37944 KB 
#include<bits/stdc++.h>
#include "parks.h"

using namespace std;
using ll = long long;

ll n, m, q, k, x, y, a, b, c;

struct dsu {
    ll n;
    vector<ll> par;
    vector<ll> sz;
    
    dsu(ll N) : n(N) {
        par.resize(n);
        sz.resize(n);
        for (int i = 0; i < n; i++) {
            par[i] = i;
            sz[i] = 1;
        }
    }

    ll find_p(ll x) {
        if (par[x] == x) {
            return x;
        }
        ll p = find_p(par[x]);
        par[x] = p;
        return p;
    }

    void join(ll x, ll y) {
        x = find_p(x);
        y = find_p(y);
        if (x == y) {
            return;
        }
        if (sz[y] > sz[x]) {
            swap(x, y);
        }
        par[y] = x;
        sz[x] += sz[y];
    }
};

int construct_roads(vector<int> x, vector<int> y) {
    vector< vector<ll> > v(7, vector<ll> (200001, -1));
    n = x.size();
    for (int i = 0; i < n; i++) {
        v[x[i]][y[i]] = i;
    }
    dsu d(n);
    array< vector<int>, 4 > ans;
    for (int i = 2; i < 200000; i += 2) {
        if (v[2][i] != -1 && v[2][i + 2] != -1 && d.find_p(v[2][i]) != d.find_p(v[2][i + 2])) {
            d.join(v[2][i], v[2][i + 2]);
            ans[0].push_back(v[2][i]);
            ans[1].push_back(v[2][i + 2]);
            ans[2].push_back(1);
            ans[3].push_back(i + 1);
        }
        if (v[6][i] != -1 && v[6][i + 2] != -1 && d.find_p(v[6][i]) != d.find_p(v[6][i + 2])) {
            d.join(v[6][i], v[6][i + 2]);
            ans[0].push_back(v[6][i]);
            ans[1].push_back(v[6][i + 2]);
            ans[2].push_back(7);
            ans[3].push_back(i + 1);
        }
    }
    vector< pair< ll, pair<ll, ll> > > vec;
    for (int i = 2; i < 200000; i += 2) {
        if (v[4][i] != -1 && v[4][i + 2] != -1 && d.find_p(v[4][i]) != d.find_p(v[4][i + 2])) {
            d.join(v[4][i], v[4][i + 2]);
            vec.push_back({i + 1, {v[4][i], v[4][i + 2]}});
        }
    }
    for (int i = 2; i <= 200000; i += 2) {
        if (v[4][i] != -1 && v[2][i] != -1 && d.find_p(v[4][i]) != d.find_p(v[2][i])) {
            d.join(v[4][i], v[2][i]);
            vec.push_back({i, {v[4][i], v[2][i]}});
        }
        if (v[4][i] != -1 && v[6][i] != -1 && d.find_p(v[4][i]) != d.find_p(v[6][i])) {
            d.join(v[4][i], v[6][i]);
            vec.push_back({i, {v[4][i], v[6][i]}});
        }
    }
    set< pair<ll, ll> > st;
    sort(vec.begin(), vec.end());
    for (auto i : vec) {
        if (i.first % 2 == 0) {
            if (!st.count({(x[i.second.first] + x[i.second.second]) / 2, i.first - 1})) {
                st.insert({(x[i.second.first] + x[i.second.second]) / 2, i.first - 1});
                ans[0].push_back(i.second.first);
                ans[1].push_back(i.second.second);
                ans[2].push_back((x[i.second.first] + x[i.second.second]) / 2);
                ans[3].push_back(i.first - 1);
            }
            else {
                st.insert({(x[i.second.first] + x[i.second.second]) / 2, i.first + 1});
                ans[0].push_back(i.second.first);
                ans[1].push_back(i.second.second);
                ans[2].push_back((x[i.second.first] + x[i.second.second]) / 2);
                ans[3].push_back(i.first + 1);
            }
        }
        else {
            if (!st.count({(x[i.second.first] + x[i.second.second]) / 2 - 1, (y[i.second.first] + y[i.second.second]) / 2})) {
                st.insert({(x[i.second.first] + x[i.second.second]) / 2 - 1, (y[i.second.first] + y[i.second.second]) / 2});
                ans[0].push_back(i.second.first);
                ans[1].push_back(i.second.second);
                ans[2].push_back((x[i.second.first] + x[i.second.second]) / 2 - 1);
                ans[3].push_back((y[i.second.first] + y[i.second.second]) / 2);
            }
            else {
                st.insert({(x[i.second.first] + x[i.second.second]) / 2 + 1, (y[i.second.first] + y[i.second.second]) / 2});
                ans[0].push_back(i.second.first);
                ans[1].push_back(i.second.second);
                ans[2].push_back((x[i.second.first] + x[i.second.second]) / 2 + 1);
                ans[3].push_back((y[i.second.first] + y[i.second.second]) / 2);
            }
        }
    }
    if (d.sz[d.find_p(0)] != n) {
        return 0;
    }
    build(ans[0], ans[1], ans[2], ans[3]);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct
17 Correct 6 ms 12892 KB Output is correct
18 Correct 5 ms 12892 KB Output is correct
19 Correct 6 ms 12892 KB Output is correct
20 Correct 7 ms 12892 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 101 ms 37732 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 7 ms 12892 KB Output is correct
26 Correct 9 ms 13008 KB Output is correct
27 Correct 7 ms 12892 KB Output is correct
28 Correct 44 ms 21884 KB Output is correct
29 Correct 61 ms 26940 KB Output is correct
30 Correct 82 ms 32824 KB Output is correct
31 Correct 106 ms 37940 KB Output is correct
32 Correct 6 ms 12892 KB Output is correct
33 Correct 6 ms 12892 KB Output is correct
34 Correct 5 ms 12892 KB Output is correct
35 Correct 5 ms 12892 KB Output is correct
36 Correct 6 ms 12892 KB Output is correct
37 Correct 6 ms 12892 KB Output is correct
38 Correct 7 ms 12892 KB Output is correct
39 Correct 6 ms 12892 KB Output is correct
40 Correct 6 ms 12888 KB Output is correct
41 Correct 5 ms 12892 KB Output is correct
42 Correct 5 ms 12844 KB Output is correct
43 Correct 7 ms 12892 KB Output is correct
44 Correct 7 ms 12892 KB Output is correct
45 Correct 49 ms 27304 KB Output is correct
46 Correct 72 ms 33340 KB Output is correct
47 Correct 76 ms 32564 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct
17 Correct 6 ms 12892 KB Output is correct
18 Correct 5 ms 12892 KB Output is correct
19 Correct 6 ms 12892 KB Output is correct
20 Correct 7 ms 12892 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 101 ms 37732 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 7 ms 12892 KB Output is correct
26 Correct 9 ms 13008 KB Output is correct
27 Correct 7 ms 12892 KB Output is correct
28 Correct 44 ms 21884 KB Output is correct
29 Correct 61 ms 26940 KB Output is correct
30 Correct 82 ms 32824 KB Output is correct
31 Correct 106 ms 37940 KB Output is correct
32 Correct 6 ms 12892 KB Output is correct
33 Correct 6 ms 12892 KB Output is correct
34 Correct 5 ms 12892 KB Output is correct
35 Correct 5 ms 12892 KB Output is correct
36 Correct 6 ms 12892 KB Output is correct
37 Correct 6 ms 12892 KB Output is correct
38 Correct 7 ms 12892 KB Output is correct
39 Correct 6 ms 12892 KB Output is correct
40 Correct 6 ms 12888 KB Output is correct
41 Correct 5 ms 12892 KB Output is correct
42 Correct 5 ms 12844 KB Output is correct
43 Correct 7 ms 12892 KB Output is correct
44 Correct 7 ms 12892 KB Output is correct
45 Correct 49 ms 27304 KB Output is correct
46 Correct 72 ms 33340 KB Output is correct
47 Correct 76 ms 32564 KB Output is correct
48 Correct 6 ms 12892 KB Output is correct
49 Correct 6 ms 12892 KB Output is correct
50 Correct 5 ms 12888 KB Output is correct
51 Correct 5 ms 12892 KB Output is correct
52 Correct 5 ms 12892 KB Output is correct
53 Correct 6 ms 12984 KB Output is correct
54 Correct 6 ms 12892 KB Output is correct
55 Correct 100 ms 34616 KB Output is correct
56 Correct 6 ms 12892 KB Output is correct
57 Correct 6 ms 12840 KB Output is correct
58 Correct 8 ms 12892 KB Output is correct
59 Correct 7 ms 13144 KB Output is correct
60 Correct 43 ms 22952 KB Output is correct
61 Correct 58 ms 27960 KB Output is correct
62 Correct 70 ms 30732 KB Output is correct
63 Correct 93 ms 34868 KB Output is correct
64 Correct 6 ms 12892 KB Output is correct
65 Correct 6 ms 12892 KB Output is correct
66 Correct 5 ms 12784 KB Output is correct
67 Correct 69 ms 29236 KB Output is correct
68 Correct 67 ms 29236 KB Output is correct
69 Correct 68 ms 29344 KB Output is correct
70 Correct 7 ms 12888 KB Output is correct
71 Correct 7 ms 13148 KB Output is correct
72 Correct 60 ms 24476 KB Output is correct
73 Correct 69 ms 31836 KB Output is correct
74 Correct 123 ms 37944 KB Output is correct
75 Correct 78 ms 32564 KB Output is correct
76 Correct 67 ms 29236 KB Output is correct
77 Correct 7 ms 12892 KB Output is correct
78 Correct 10 ms 12992 KB Output is correct
79 Correct 44 ms 24128 KB Output is correct
80 Correct 67 ms 30516 KB Output is correct
81 Correct 94 ms 37176 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct
17 Runtime error 12 ms 22588 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct
17 Runtime error 37 ms 31088 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12892 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12980 KB Output is correct
4 Correct 6 ms 12888 KB Output is correct
5 Correct 5 ms 12892 KB Output is correct
6 Correct 6 ms 12892 KB Output is correct
7 Correct 6 ms 12984 KB Output is correct
8 Correct 5 ms 12892 KB Output is correct
9 Correct 46 ms 20288 KB Output is correct
10 Correct 9 ms 13144 KB Output is correct
11 Correct 20 ms 16444 KB Output is correct
12 Correct 10 ms 13148 KB Output is correct
13 Correct 11 ms 14400 KB Output is correct
14 Correct 5 ms 12840 KB Output is correct
15 Correct 6 ms 12884 KB Output is correct
16 Correct 36 ms 20276 KB Output is correct
17 Correct 6 ms 12892 KB Output is correct
18 Correct 5 ms 12892 KB Output is correct
19 Correct 6 ms 12892 KB Output is correct
20 Correct 7 ms 12892 KB Output is correct
21 Correct 5 ms 12892 KB Output is correct
22 Correct 5 ms 12892 KB Output is correct
23 Correct 101 ms 37732 KB Output is correct
24 Correct 6 ms 12892 KB Output is correct
25 Correct 7 ms 12892 KB Output is correct
26 Correct 9 ms 13008 KB Output is correct
27 Correct 7 ms 12892 KB Output is correct
28 Correct 44 ms 21884 KB Output is correct
29 Correct 61 ms 26940 KB Output is correct
30 Correct 82 ms 32824 KB Output is correct
31 Correct 106 ms 37940 KB Output is correct
32 Correct 6 ms 12892 KB Output is correct
33 Correct 6 ms 12892 KB Output is correct
34 Correct 5 ms 12892 KB Output is correct
35 Correct 5 ms 12892 KB Output is correct
36 Correct 6 ms 12892 KB Output is correct
37 Correct 6 ms 12892 KB Output is correct
38 Correct 7 ms 12892 KB Output is correct
39 Correct 6 ms 12892 KB Output is correct
40 Correct 6 ms 12888 KB Output is correct
41 Correct 5 ms 12892 KB Output is correct
42 Correct 5 ms 12844 KB Output is correct
43 Correct 7 ms 12892 KB Output is correct
44 Correct 7 ms 12892 KB Output is correct
45 Correct 49 ms 27304 KB Output is correct
46 Correct 72 ms 33340 KB Output is correct
47 Correct 76 ms 32564 KB Output is correct
48 Correct 6 ms 12892 KB Output is correct
49 Correct 6 ms 12892 KB Output is correct
50 Correct 5 ms 12888 KB Output is correct
51 Correct 5 ms 12892 KB Output is correct
52 Correct 5 ms 12892 KB Output is correct
53 Correct 6 ms 12984 KB Output is correct
54 Correct 6 ms 12892 KB Output is correct
55 Correct 100 ms 34616 KB Output is correct
56 Correct 6 ms 12892 KB Output is correct
57 Correct 6 ms 12840 KB Output is correct
58 Correct 8 ms 12892 KB Output is correct
59 Correct 7 ms 13144 KB Output is correct
60 Correct 43 ms 22952 KB Output is correct
61 Correct 58 ms 27960 KB Output is correct
62 Correct 70 ms 30732 KB Output is correct
63 Correct 93 ms 34868 KB Output is correct
64 Correct 6 ms 12892 KB Output is correct
65 Correct 6 ms 12892 KB Output is correct
66 Correct 5 ms 12784 KB Output is correct
67 Correct 69 ms 29236 KB Output is correct
68 Correct 67 ms 29236 KB Output is correct
69 Correct 68 ms 29344 KB Output is correct
70 Correct 7 ms 12888 KB Output is correct
71 Correct 7 ms 13148 KB Output is correct
72 Correct 60 ms 24476 KB Output is correct
73 Correct 69 ms 31836 KB Output is correct
74 Correct 123 ms 37944 KB Output is correct
75 Correct 78 ms 32564 KB Output is correct
76 Correct 67 ms 29236 KB Output is correct
77 Correct 7 ms 12892 KB Output is correct
78 Correct 10 ms 12992 KB Output is correct
79 Correct 44 ms 24128 KB Output is correct
80 Correct 67 ms 30516 KB Output is correct
81 Correct 94 ms 37176 KB Output is correct
82 Runtime error 12 ms 22588 KB Execution killed with signal 11
83 Halted 0 ms 0 KB -