oj.uz

답안 #560317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560317 2022-05-11T09:28:10 Z kartel 분수 공원 (IOI21_parks) C++17
45 / 100
 2383 ms 381388 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;

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

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);
    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);
}

int construct_roads(vector <int> x, vector <int> y) {
    int n = sz(x);
    map <pair <int, int>, int> mp, used;
    vector <pair <int, int> > r;

    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);
    }

    for (int i = 0; i < n; i++) {
        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}) && !used[{i, mp[{cx, cy}]}] && (sd || f(i) != f(mp[{cx, cy}]))) {
                int to = mp[{cx, cy}];
                link(i, to);
                r.pb({i, to});
                used[{to, i}] = 1;
                used[{i, to}] = 1;
            }
        }
    }
    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;
        }
        assert(sz(v) == 2);
        int a = v[0], b = v[1];

        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:108:13: warning: unused variable 'x' [-Wunused-variable]
  108 |         int x = p.F, y = p.S;
      |             ^
parks.cpp:108:22: warning: unused variable 'y' [-Wunused-variable]
  108 |         int x = p.F, y = p.S;
      |                      ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct
17 Runtime error 244 ms 381388 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct
17 Runtime error 244 ms 381388 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct
17 Correct 148 ms 231300 KB Output is correct
18 Correct 149 ms 231396 KB Output is correct
19 Correct 103 ms 188168 KB Output is correct
20 Correct 1472 ms 339292 KB Output is correct
21 Correct 1546 ms 335324 KB Output is correct
22 Correct 1790 ms 335436 KB Output is correct
23 Correct 1302 ms 314404 KB Output is correct
24 Correct 493 ms 204616 KB Output is correct
25 Correct 1296 ms 231124 KB Output is correct
26 Correct 1124 ms 231180 KB Output is correct
27 Correct 1789 ms 329212 KB Output is correct
28 Correct 1724 ms 329356 KB Output is correct
29 Correct 1931 ms 329264 KB Output is correct
30 Correct 2128 ms 329248 KB Output is correct
31 Correct 173 ms 231396 KB Output is correct
32 Correct 256 ms 238468 KB Output is correct
33 Correct 272 ms 196424 KB Output is correct
34 Correct 1904 ms 338228 KB Output is correct
35 Correct 136 ms 190276 KB Output is correct
36 Correct 354 ms 198920 KB Output is correct
37 Correct 682 ms 209684 KB Output is correct
38 Correct 842 ms 271612 KB Output is correct
39 Correct 1184 ms 286780 KB Output is correct
40 Correct 1564 ms 302404 KB Output is correct
41 Correct 1966 ms 317492 KB Output is correct
42 Correct 2383 ms 332704 KB Output is correct
43 Correct 217 ms 231384 KB Output is correct
44 Correct 175 ms 231380 KB Output is correct
45 Correct 175 ms 231392 KB Output is correct
46 Correct 106 ms 188128 KB Output is correct
47 Correct 96 ms 188108 KB Output is correct
48 Correct 182 ms 231388 KB Output is correct
49 Correct 180 ms 231388 KB Output is correct
50 Correct 182 ms 231436 KB Output is correct
51 Correct 178 ms 231392 KB Output is correct
52 Correct 138 ms 188144 KB Output is correct
53 Correct 178 ms 231388 KB Output is correct
54 Correct 106 ms 188600 KB Output is correct
55 Correct 100 ms 188760 KB Output is correct
56 Correct 874 ms 281288 KB Output is correct
57 Correct 1333 ms 303996 KB Output is correct
58 Correct 1263 ms 303372 KB Output is correct
59 Correct 104 ms 188116 KB Output is correct
60 Correct 159 ms 231396 KB Output is correct
61 Correct 87 ms 188108 KB Output is correct
62 Correct 1683 ms 329420 KB Output is correct
63 Correct 1653 ms 329324 KB Output is correct
64 Correct 1563 ms 328840 KB Output is correct
65 Correct 107 ms 188960 KB Output is correct
66 Correct 106 ms 189944 KB Output is correct
67 Correct 909 ms 281352 KB Output is correct
68 Correct 1472 ms 306248 KB Output is correct
69 Correct 2031 ms 331184 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct
17 Correct 1647 ms 329492 KB Output is correct
18 Correct 1637 ms 329464 KB Output is correct
19 Correct 1838 ms 338000 KB Output is correct
20 Correct 2063 ms 338152 KB Output is correct
21 Correct 1627 ms 320080 KB Output is correct
22 Correct 156 ms 231408 KB Output is correct
23 Correct 347 ms 247504 KB Output is correct
24 Correct 163 ms 192916 KB Output is correct
25 Correct 391 ms 204864 KB Output is correct
26 Correct 761 ms 216800 KB Output is correct
27 Correct 916 ms 284440 KB Output is correct
28 Correct 1241 ms 297744 KB Output is correct
29 Correct 1525 ms 310728 KB Output is correct
30 Correct 1817 ms 323572 KB Output is correct
31 Correct 2089 ms 337224 KB Output is correct
32 Correct 1971 ms 335820 KB Output is correct
33 Correct 1625 ms 329276 KB Output is correct
34 Correct 118 ms 189356 KB Output is correct
35 Correct 132 ms 190240 KB Output is correct
36 Correct 934 ms 282504 KB Output is correct
37 Correct 1366 ms 307976 KB Output is correct
38 Correct 2008 ms 334304 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 231420 KB Output is correct
2 Correct 157 ms 231488 KB Output is correct
3 Correct 88 ms 188212 KB Output is correct
4 Correct 145 ms 231376 KB Output is correct
5 Correct 148 ms 231388 KB Output is correct
6 Correct 92 ms 188116 KB Output is correct
7 Correct 89 ms 188184 KB Output is correct
8 Correct 86 ms 188108 KB Output is correct
9 Correct 639 ms 280280 KB Output is correct
10 Correct 174 ms 236180 KB Output is correct
11 Correct 307 ms 257516 KB Output is correct
12 Correct 184 ms 238580 KB Output is correct
13 Correct 173 ms 197632 KB Output is correct
14 Correct 90 ms 188364 KB Output is correct
15 Correct 93 ms 188572 KB Output is correct
16 Correct 636 ms 280400 KB Output is correct
17 Runtime error 244 ms 381388 KB Execution killed with signal 6
18 Halted 0 ms 0 KB -