oj.uz

답안 #1022394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022394 2024-07-13T12:41:12 Z mdn2002 분수 공원 (IOI21_parks) C++17
15 / 100
 2454 ms 316644 KB 
/*
Mayoeba Yabureru
*/
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
static vector<int> _u, _v, _a, _b;

int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    vector<vector<int>> gr(n + 1);
    vector<int> dsu(n + 1);
    map<pair<int, int>, int> mp;
    map<pair<int, int>, pair<int, int>> mpp;
    vector<pair<int, int>> vv;
    x.insert(x.begin(), 0);
    y.insert(y.begin(), 0);
    for (int i = 1; i <= n; i ++) {
        mp[{x[i], y[i]}] = i;
        vv.push_back({x[i], y[i]});
        dsu[i] = i;
    }
    vector<int> u, v, a, b;
    map<pair<int, int>, int> taken;
    map<pair<int, int>, int> connected;

    function<int(int)> fp = [&](int x) {
        if (dsu[x] == x) return x;
        return dsu[x] = fp(dsu[x]);
    };
    function cmp = [&] (pair<int, int> a, pair<int, int> b) {
        if (a.first + a.second < b.first + b.second) return 1;
        return 0;
    };
    sort(vv.begin(), vv.end(), cmp);
    for (int i = 0; i < n; i ++) {
        vector nx = {0, 0}, ny = {2, -2};
        for (int j = 0; j < 4; j ++) {
            auto xx = make_pair(vv[i].first + nx[j], vv[i].second + ny[j]);
            if (mp[xx]) {
                int fx = fp(mp[vv[i]]), fy = fp(mp[xx]);
                if (fx != fy) {
                    if (vv[i].first < xx.first || vv[i].second < xx.second) {
                        u.push_back(mp[vv[i]]);
                        v.push_back(mp[xx]);
                    }
                    else {
                        v.push_back(mp[vv[i]]);
                        u.push_back(mp[xx]);
                    }
                    gr[mp[vv[i]]].push_back(mp[xx]);
                    gr[mp[xx]].push_back(mp[vv[i]]);
                    dsu[fx] = fy;
                    connected[{mp[vv[i]], mp[xx]}] = 1;
                    connected[{mp[xx], mp[vv[i]]}] = 1;
                }
            }
        }
    }
    for (int i = 0; i < n; i ++) {
        vector nx = {2, -2}, ny = {0, 0};
        for (int j = 0; j < 4; j ++) {
            auto xx = make_pair(vv[i].first + nx[j], vv[i].second + ny[j]);
            if (mp[xx]) {
                int fx = fp(mp[vv[i]]), fy = fp(mp[xx]);
                if (fx != fy) {
                    if (vv[i].first < xx.first || vv[i].second < xx.second) {
                        u.push_back(mp[vv[i]]);
                        v.push_back(mp[xx]);
                    }
                    else {
                        v.push_back(mp[vv[i]]);
                        u.push_back(mp[xx]);
                    }
                    gr[mp[vv[i]]].push_back(mp[xx]);
                    gr[mp[xx]].push_back(mp[vv[i]]);
                    dsu[fx] = fy;
                    connected[{mp[vv[i]], mp[xx]}] = 1;
                    connected[{mp[xx], mp[vv[i]]}] = 1;
                }
            }
        }
    }

    int num = 0, st = 1;
    vector<int> vis(n + 1);
    for (int i = 1; i <= n; i ++) {
        if (mp[{x[i], y[i] + 2}]) {
            st = i;
            break;
        }
    }

    function<void(int)> go = [&] (int v) {
        num ++;
        vis[v] = 1;
        vector nx = {0, 2, 0, -2}, ny = {2, 0, -2, 0};
        int ii = 0;
        for (int i = 0; i < 4; i ++) {
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0) continue;
            if (vis[u]) {
                ii = (i + 1) % 4;
                break;
            }
        }
        int nummmm = 10;
        while (nummmm --) {
            int i = ii;
            ii = (ii + 1) % 4;
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0 || vis[u] || connected[{u, v}] == 0) continue;
            if (x[v] != x[u]) {
                int xx = v, uu = u;
                if (x[xx] > x[uu]) {
                    if (taken[{x[uu] + 1, y[uu] - 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] - 1};
                        taken[{x[uu] + 1, y[uu] - 1}] = 1;
                    }
                    else if (taken[{x[uu] + 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] + 1};
                        taken[{x[uu] + 1, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    if (taken[{x[xx] + 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] + 1};
                        taken[{x[xx] + 1, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + 1, y[xx] - 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] - 1};
                        taken[{x[xx] + 1, y[xx] - 1}] = 1;
                    }
                    else assert(0);
                }
            }
            else {
                int xx = v, uu = u;
                if (y[xx] > y[uu]) {
                    int ad = y[uu] % 4;
                    if (ad == 2) ad = 1;
                    else ad = -1;
                    if (taken[{x[uu] + ad, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + ad, y[uu] + 1};
                        taken[{x[uu] + ad, y[uu] + 1}] = 1;
                    }
                    else if (taken[{x[uu] - ad, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] - ad, y[uu] + 1};
                        taken[{x[uu] - ad, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    int ad = y[xx] % 4;
                    if (ad == 2) ad = 1;
                    else ad = -1;
                    if (taken[{x[xx] - ad, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] - ad, y[xx] + 1};
                        taken[{x[xx] - ad, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + ad, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + ad, y[xx] + 1};
                        taken[{x[xx] + ad, y[xx] + 1}] = 1;
                    }
                    else assert(0);
                }
            }
            go(u);
        }
    };
    go(st);
    for (int i = 0; i < u.size(); i ++) {
        a.push_back(mpp[{u[i], v[i]}].first);
        b.push_back(mpp[{u[i], v[i]}].second);
        u[i] --;
        v[i] --;
    }
    if (num == n) {
        build(u, v, a, b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:173:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |     for (int i = 0; i < u.size(); i ++) {
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1957 ms 186144 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 1516 KB Output is correct
26 Correct 11 ms 2140 KB Output is correct
27 Correct 13 ms 2252 KB Output is correct
28 Correct 664 ms 78292 KB Output is correct
29 Correct 1182 ms 97716 KB Output is correct
30 Correct 1554 ms 124880 KB Output is correct
31 Correct 1901 ms 182832 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 7 ms 1416 KB Output is correct
44 Correct 10 ms 1880 KB Output is correct
45 Correct 858 ms 80196 KB Output is correct
46 Correct 1293 ms 118236 KB Output is correct
47 Correct 1285 ms 115704 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1957 ms 186144 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 1516 KB Output is correct
26 Correct 11 ms 2140 KB Output is correct
27 Correct 13 ms 2252 KB Output is correct
28 Correct 664 ms 78292 KB Output is correct
29 Correct 1182 ms 97716 KB Output is correct
30 Correct 1554 ms 124880 KB Output is correct
31 Correct 1901 ms 182832 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 7 ms 1416 KB Output is correct
44 Correct 10 ms 1880 KB Output is correct
45 Correct 858 ms 80196 KB Output is correct
46 Correct 1293 ms 118236 KB Output is correct
47 Correct 1285 ms 115704 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Runtime error 1453 ms 269656 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2301 ms 186096 KB Output is correct
21 Correct 1891 ms 169392 KB Output is correct
22 Correct 2359 ms 161780 KB Output is correct
23 Correct 1572 ms 144916 KB Output is correct
24 Correct 771 ms 48940 KB Output is correct
25 Correct 1575 ms 83508 KB Output is correct
26 Correct 1505 ms 83504 KB Output is correct
27 Correct 2145 ms 103296 KB Output is correct
28 Correct 2156 ms 103300 KB Output is correct
29 Correct 2454 ms 103152 KB Output is correct
30 Correct 2403 ms 103120 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Runtime error 54 ms 10688 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct
17 Correct 1961 ms 192536 KB Output is correct
18 Correct 1973 ms 172836 KB Output is correct
19 Runtime error 1884 ms 316644 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 854 ms 97440 KB Output is correct
10 Correct 55 ms 10320 KB Output is correct
11 Correct 323 ms 54944 KB Output is correct
12 Correct 87 ms 15440 KB Output is correct
13 Correct 212 ms 36080 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 7 ms 1516 KB Output is correct
16 Correct 798 ms 80540 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1957 ms 186144 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 5 ms 1516 KB Output is correct
26 Correct 11 ms 2140 KB Output is correct
27 Correct 13 ms 2252 KB Output is correct
28 Correct 664 ms 78292 KB Output is correct
29 Correct 1182 ms 97716 KB Output is correct
30 Correct 1554 ms 124880 KB Output is correct
31 Correct 1901 ms 182832 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 7 ms 1416 KB Output is correct
44 Correct 10 ms 1880 KB Output is correct
45 Correct 858 ms 80196 KB Output is correct
46 Correct 1293 ms 118236 KB Output is correct
47 Correct 1285 ms 115704 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Runtime error 1453 ms 269656 KB Execution killed with signal 6
56 Halted 0 ms 0 KB -