oj.uz

답안 #565327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
565327 2022-05-20T17:07:35 Z kartel 분수 공원 (IOI21_parks) C++17
45 / 100
 2724 ms 327160 KB 
#include <bits/stdc++.h>
//#include "grader.cpp"
#include "parks.h"
#define F first
#define S second
#define pb push_back
#define sz(x) (int)x.size()
#define el "\n"
#define all(x) (x).begin(), (x).end()

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")

using namespace std;
typedef long long ll;

const int N = 2e6 + 500;

mt19937 rnd(time(0));

const int steps[4][2] = {{0, 2}, {2, 0}, {0, -2}, {-2, 0}};
const int dsteps[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};

map <pair <int, int>, pair <int, int> > road;

int pr[N];
int cmp[2 * N], to[2 * N];
vector <int> g[2 * N], gr[2 * N], ord;
bool mk[2 * N];

int f(int v) {return (pr[v] == v ? v : pr[v] = f(pr[v]));}
void link(int v, int u) {
    v = f(v); u = f(u);
    if (v == u) {
        return;
    }
    pr[u] = v;
}

int nt(int x) {return (x < N ? x + N : x - N);}

void add_impl(int a, int b) {
    int na = nt(a), nb = nt(b);

    g[na].pb(b); gr[b].pb(na);
    g[nb].pb(a); gr[a].pb(nb);
}

void dfs(int v) {
    mk[v] = 1;
    for (auto u : g[v]) {
        if (mk[u]) {
            continue;
        }
        dfs(u);
    }
    ord.pb(v);
}

void get_erased_2x2(const vector <int> &x, const vector <int> &y, map<pair <int, int>, int> &del) {
    map <pair <int, int>, int> cnt, who;
    vector <pair <int, int> > pts;

    for (int i = 0; i < sz(x); i++) {
        who[{x[i], y[i]}] = i;
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + dsteps[j][0];
            int cy = y[i] + dsteps[j][1];

            cnt[{cx, cy}]++;
            if (cnt[{cx, cy}] == 4) {
                pts.pb({cx, cy});
            }
        }
    }
    sort(all(pts));
    vector <vector <int> > g(sz(pts));
    cnt.clear();
    int ptr = 0;
    for (auto &[x, y] : pts) {
        cnt[{x, y}] = ptr++;
    }

    ptr = 0;
    for (auto &[x, y] : pts) {
        int par = (x / 2 + y / 2) % 2;
        for (int i = 0; i < 2; i++) {
            int cx = x + steps[i * 2 + par][0];
            int cy = y + steps[i * 2 + par][1];

            if (!cnt.count({cx, cy})) {
                continue;
            }
            g[cnt[{cx, cy}]].pb(ptr);
        }
        ptr++;
    }

    vector <pair <int, int> > block(sz(pts));
    for (int i = 0; i < sz(pts); i++) {
        if (mk[i]) {
            continue;
        }
        function <void(int)> dfs = [&](int v) {
            mk[v] = 1;
            for (auto u : g[v]) {
                if (mk[u]) {
                    continue;
                }
                dfs(u);
                int dx = pts[v].F - pts[u].F;
                int dy = pts[v].S - pts[u].S;
                block[u] = road[{dx, dy}];
            }
        };

        int par = (pts[i].F / 2 + pts[i].S / 2) & 1;
        if (par & 1) {
            block[i] = road[{-2, 0}];
        } else {
            block[i] = road[{0, -2}];
        }
        dfs(i);
    }

    for (int i = 0; i < sz(pts); i++) {
        auto [x, y] = pts[i];

        auto [a, b] = block[i];
        int v = who[{x + dsteps[a][0], y + dsteps[a][1]}];
        int u = who[{x + dsteps[b][0], y + dsteps[b][1]}];

        del[{v, u}] = del[{u, v}] = 1;
    }
}

/*

5
4 4
4 6
6 4
4 2
2 4

*/

int construct_roads(vector <int> x, vector <int> y) {
    int n = sz(x);

    road[{0, 2}]  = {2, 0}; road[{2, 0}]  = {0, 1};
    road[{0, -2}] = {1, 3}; road[{-2, 0}] = {3, 2};

    map <pair <int, int>, int> mp;
    vector <pair <int, int> > r;
    map <pair <int, int>, int> del;
    vector <int> pm(n);
    iota(all(pm), 0);
    shuffle(all(pm), rnd);

    bool sd = 1;
    for (int i = 0; i < n; i++) {
        mp[{x[i], y[i]}] = i;
        pr[i] = i;
        sd &= (x[i] >= 2 && x[i] <= 4);
    }

    get_erased_2x2(x, y, del);
    for (auto i : pm) {
        for (int j = 0; j < 4; j++) {
            int cx = x[i] + steps[j][0];
            int cy = y[i] + steps[j][1];

            if (mp.count({cx, cy}) && f(i) != f(mp[{cx, cy}])) {
                int to = mp[{cx, cy}];
                if (del[{i, to}]) {
                    continue;
                }
                link(i, to);
                r.pb({i, to});
            }
        }
    }
    sort(all(r));
    r.resize(unique(all(r)) - r.begin());

    for (int i = 0; i < n; i++) {
        if (f(i) != f(0)) {
            return 0;
        }
    }
    vector <int> u, v, A, B;
    map <pair <int, int>, vector <int> > e;


    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        u.pb(a); v.pb(b);
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            e[{lx - 1, ly + 1}].pb(i);
            e[{lx + 1, ly + 1}].pb(nt(i));
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            e[{lx + 1, ly + 1}].pb(i);
            e[{lx + 1, ly - 1}].pb(nt(i));
        }
    }
    for (auto [p, v] : e) {
        int x = p.F, y = p.S;
        if (sz(v) == 1) {
            continue;
        }
        for (auto a : v) {
            for (auto b : v) {
                if (a == b) {
                    continue;
                }
                add_impl(a, b);
            }
        }
    }

    for (int i = 0; i < 2 * N; i++) {
        cmp[i] = -1;
        if (mk[i]) {
            continue;
        }
        dfs(i);
    }
    reverse(all(ord));

    int C = 0;
    for (auto v : ord) {
        function <void(int)> dfsr = [&](int v) {
            if (cmp[v] != -1) {
                return;
            }
            cmp[v] = C;
            for (auto u : gr[v]) {
                dfsr(u);
            }
        };

        dfsr(v);
        C++;
    }

    for (int i = 0; i < N; i++) {
        if (cmp[i] == cmp[nt(i)]) {
            return 0;
        }
        to[i] = (cmp[i] > cmp[nt(i)]);
    }

    for (int i = 0; i < sz(r); i++) {
        int a = r[i].F, b = r[i].S;
        if (abs(x[a] - x[b]) == 0) {
            int lx = x[a];
            int ly = min(y[a], y[b]);

            if (to[i]) {
                A.pb(lx + 1);
            } else {
                A.pb(lx - 1);
            }
            B.pb(ly + 1);
        } else {
            int lx = min(x[a], x[b]);
            int ly = y[a];

            if (to[i]) {
                B.pb(ly - 1);
            } else {
                B.pb(ly + 1);
            }
            A.pb(lx + 1);
        }
    }

    build(u, v, A, B);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:215:13: warning: unused variable 'x' [-Wunused-variable]
  215 |         int x = p.F, y = p.S;
      |             ^
parks.cpp:215:22: warning: unused variable 'y' [-Wunused-variable]
  215 |         int x = p.F, y = p.S;
      |                      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct
17 Correct 168 ms 231312 KB Output is correct
18 Incorrect 172 ms 231400 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct
17 Correct 168 ms 231312 KB Output is correct
18 Incorrect 172 ms 231400 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct
17 Correct 179 ms 231420 KB Output is correct
18 Correct 174 ms 231396 KB Output is correct
19 Correct 113 ms 188192 KB Output is correct
20 Correct 2272 ms 326920 KB Output is correct
21 Correct 2385 ms 326344 KB Output is correct
22 Correct 2341 ms 325620 KB Output is correct
23 Correct 1864 ms 304556 KB Output is correct
24 Correct 1319 ms 267980 KB Output is correct
25 Correct 1871 ms 243060 KB Output is correct
26 Correct 1671 ms 243088 KB Output is correct
27 Correct 2243 ms 316364 KB Output is correct
28 Correct 2344 ms 317256 KB Output is correct
29 Correct 2593 ms 317236 KB Output is correct
30 Correct 2707 ms 317252 KB Output is correct
31 Correct 188 ms 231288 KB Output is correct
32 Correct 243 ms 237756 KB Output is correct
33 Correct 550 ms 221816 KB Output is correct
34 Correct 2228 ms 325832 KB Output is correct
35 Correct 133 ms 190664 KB Output is correct
36 Correct 334 ms 201364 KB Output is correct
37 Correct 793 ms 213708 KB Output is correct
38 Correct 950 ms 267368 KB Output is correct
39 Correct 1286 ms 280204 KB Output is correct
40 Correct 1701 ms 293016 KB Output is correct
41 Correct 2089 ms 307460 KB Output is correct
42 Correct 2724 ms 320660 KB Output is correct
43 Correct 159 ms 231312 KB Output is correct
44 Correct 189 ms 231376 KB Output is correct
45 Correct 184 ms 231392 KB Output is correct
46 Correct 93 ms 188188 KB Output is correct
47 Correct 102 ms 188224 KB Output is correct
48 Correct 163 ms 231408 KB Output is correct
49 Correct 180 ms 231388 KB Output is correct
50 Correct 189 ms 231396 KB Output is correct
51 Correct 172 ms 231308 KB Output is correct
52 Correct 105 ms 188120 KB Output is correct
53 Correct 177 ms 231396 KB Output is correct
54 Correct 107 ms 188708 KB Output is correct
55 Correct 123 ms 189040 KB Output is correct
56 Correct 1053 ms 274852 KB Output is correct
57 Correct 1636 ms 294356 KB Output is correct
58 Correct 1704 ms 294244 KB Output is correct
59 Correct 106 ms 188196 KB Output is correct
60 Correct 174 ms 231356 KB Output is correct
61 Correct 100 ms 188096 KB Output is correct
62 Correct 1947 ms 317248 KB Output is correct
63 Correct 1853 ms 317172 KB Output is correct
64 Correct 2103 ms 316888 KB Output is correct
65 Correct 119 ms 189212 KB Output is correct
66 Correct 128 ms 190276 KB Output is correct
67 Correct 1056 ms 275192 KB Output is correct
68 Correct 1741 ms 297736 KB Output is correct
69 Correct 2626 ms 319332 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct
17 Correct 2142 ms 318024 KB Output is correct
18 Correct 2267 ms 317840 KB Output is correct
19 Correct 2308 ms 327160 KB Output is correct
20 Correct 2521 ms 317956 KB Output is correct
21 Correct 2045 ms 306940 KB Output is correct
22 Correct 165 ms 231328 KB Output is correct
23 Correct 369 ms 245556 KB Output is correct
24 Correct 185 ms 193220 KB Output is correct
25 Correct 513 ms 205264 KB Output is correct
26 Correct 977 ms 217440 KB Output is correct
27 Correct 1130 ms 275812 KB Output is correct
28 Correct 1527 ms 286876 KB Output is correct
29 Correct 1951 ms 298692 KB Output is correct
30 Correct 2133 ms 307912 KB Output is correct
31 Correct 2641 ms 320908 KB Output is correct
32 Correct 2467 ms 319000 KB Output is correct
33 Correct 2031 ms 317208 KB Output is correct
34 Correct 131 ms 189392 KB Output is correct
35 Correct 139 ms 190616 KB Output is correct
36 Correct 1086 ms 275032 KB Output is correct
37 Correct 1798 ms 297348 KB Output is correct
38 Correct 2464 ms 319428 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 231348 KB Output is correct
2 Correct 161 ms 231400 KB Output is correct
3 Correct 97 ms 188196 KB Output is correct
4 Correct 169 ms 231400 KB Output is correct
5 Correct 166 ms 231312 KB Output is correct
6 Correct 113 ms 188188 KB Output is correct
7 Correct 94 ms 188168 KB Output is correct
8 Correct 109 ms 188212 KB Output is correct
9 Correct 974 ms 275228 KB Output is correct
10 Correct 208 ms 235792 KB Output is correct
11 Correct 463 ms 254740 KB Output is correct
12 Correct 246 ms 237992 KB Output is correct
13 Correct 278 ms 200696 KB Output is correct
14 Correct 107 ms 188480 KB Output is correct
15 Correct 109 ms 188684 KB Output is correct
16 Correct 1004 ms 275244 KB Output is correct
17 Correct 168 ms 231312 KB Output is correct
18 Incorrect 172 ms 231400 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -