oj.uz

Submission #797809

# Submission time Handle Problem Language Result Execution time Memory
797809 2023-07-29T23:54:19 Z Liudas Fountain Parks (IOI21_parks) C++17
15 / 100
 2635 ms 118328 KB 
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
vector<vector<int>> new_tree;
void dfs(int head, vector<vector<int>>&tree, vector<int> &vis){
    vis[head] = true;
    for(int i : tree[head]){
        if(!vis[i]){
            new_tree[head].push_back(i);
            new_tree[i].push_back(head);
            dfs(i, tree, vis);
        }
    }
}
int count_benches(vector<int> &c, map<pair<int,int>, int> &taken){
    int s = 2;
    if(c[0] != c[2]){
        s -= taken[{c[0] - (c[0]-c[2])/2, c[1] + 1}];
        s -= taken[{c[0] - (c[0]-c[2])/2, c[1] - 1}];
    }
    else{
        s -= taken[{c[0] + 1, c[1] - (c[1] - c[3]) / 2}];
        s -= taken[{c[0] - 1, c[1] - (c[1] - c[3]) / 2}];
    }
    return s;
}
int construct_roads(vector<int> x, vector<int> y){
    int N = x.size();
    vector<vector<int>> tree(N);
    map<pair<int,int>, int> arr, bench, taken;
    map<array<int, 4>, bool> road;
    for(int i = 0; i < N; i ++){
        arr[{x[i], y[i]}] = i;
    }
    vector<int> dx = {-2, 2, 0, 0}, dy = {0,0,2,-2};
    for(int i = 0; i < N; i ++){
        for(int j = 0; j < 4; j ++){
            if(arr.find({x[i] + dx[j], y[i] + dy[j]}) != arr.end()){
                tree[i].push_back(arr[{x[i] + dx[j], y[i] + dy[j]}]);
            }
        }
    }
    vector<int> vis(N, 0);
    new_tree.resize(N);
    dfs(0, tree, vis);
    tree = new_tree;
    for(int i = 0; i < N; i ++){
        for(int j : tree[i]){
            road[{x[i], y[i], x[j], y[j]}] = true;
            road[{x[j], y[j], x[i], y[i]}] = true;
            if(x[j] != x[i]){
                bench[{(x[i] + x[j])/2, y[i] + 1}] ++;
                bench[{(x[i] + x[j])/2, y[i] - 1}] ++;
            }
            if(y[j] != y[i]){
                bench[{x[i] + 1, (y[i] + y[j]) / 2}] ++;
                bench[{x[i] - 1, (y[i] + y[j]) / 2}] ++;
            }
        }
    }
    vector<pair<int, int>> pairs;
    for(auto [l, r] : bench){
        pairs.push_back(l);
    }
    sort(pairs.begin(), pairs.end(), [&](pair<int, int> a, pair<int, int> b){return bench[a] < bench[b];});
    for(int i : vis){
        if(!i){
            return 0;
        }
    }
    vector<int> ansu, ansv, ansa, ansb;
    for(auto[l ,r] : pairs){
        vector<int> dix = {1, -1, 1, -1}, diy = {-1, 1, 1, -1};
        int bi = -1, bj = -1, s = 1e9;
        for(int i = 0; i < 4; i ++){
            for(int j = 0; j < 4; j ++){
                int ss = 1e9;
                if(road.find({l + dix[i], r + diy[i], l + dix[j], r + diy[j]}) != road.end()){
                    vector<int> tt = {l + dix[i], r + diy[i], l + dix[j], r + diy[j]};
                    ss = count_benches(tt, taken);
                }
                if(s > ss){
                    s = ss;
                    bi = i;
                    bj = j;
                }
            }
        }
        if(bi + 1){
            road.erase({l + dix[bi], r + diy[bi], l + dix[bj], r + diy[bj]});
            road.erase({l + dix[bj], r + diy[bj], l + dix[bi], r + diy[bi]});
            ansu.push_back(arr[{l + dix[bi], r + diy[bi]}]);
            ansv.push_back(arr[{l + dix[bj], r + diy[bj]}]);
            ansa.push_back(l);
            ansb.push_back(r);
            taken[{l, r}] = true;
        }
    }
    build(ansv, ansu, ansa, ansb);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2059 ms 102468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 5 ms 820 KB Output is correct
26 Correct 6 ms 1224 KB Output is correct
27 Correct 6 ms 1108 KB Output is correct
28 Correct 632 ms 42476 KB Output is correct
29 Correct 1056 ms 60416 KB Output is correct
30 Correct 1534 ms 82532 KB Output is correct
31 Correct 2007 ms 100932 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 974 ms 52312 KB Output is correct
46 Correct 1614 ms 76760 KB Output is correct
47 Correct 1602 ms 76176 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2059 ms 102468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 5 ms 820 KB Output is correct
26 Correct 6 ms 1224 KB Output is correct
27 Correct 6 ms 1108 KB Output is correct
28 Correct 632 ms 42476 KB Output is correct
29 Correct 1056 ms 60416 KB Output is correct
30 Correct 1534 ms 82532 KB Output is correct
31 Correct 2007 ms 100932 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 974 ms 52312 KB Output is correct
46 Correct 1614 ms 76760 KB Output is correct
47 Correct 1602 ms 76176 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 2301 ms 101176 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Incorrect 9 ms 1208 KB Given structure is not connected: There is no path between vertices 0 and 421
58 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1734 ms 103756 KB Output is correct
21 Correct 1784 ms 100212 KB Output is correct
22 Correct 1756 ms 99056 KB Output is correct
23 Correct 1857 ms 96340 KB Output is correct
24 Correct 288 ms 26668 KB Output is correct
25 Correct 414 ms 33160 KB Output is correct
26 Correct 357 ms 33224 KB Output is correct
27 Correct 2289 ms 102800 KB Output is correct
28 Correct 2251 ms 102684 KB Output is correct
29 Correct 2622 ms 102648 KB Output is correct
30 Correct 2635 ms 102616 KB Output is correct
31 Correct 0 ms 300 KB Output is correct
32 Incorrect 99 ms 7396 KB Given structure is not connected: There is no path between vertices 0 and 1
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct
17 Correct 2219 ms 118328 KB Output is correct
18 Correct 2221 ms 116760 KB Output is correct
19 Incorrect 1778 ms 103712 KB Given structure is not connected: There is no path between vertices 0 and 103320
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1042 ms 58296 KB Output is correct
10 Correct 71 ms 6244 KB Output is correct
11 Correct 514 ms 32360 KB Output is correct
12 Correct 107 ms 9156 KB Output is correct
13 Correct 195 ms 19276 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 840 KB Output is correct
16 Correct 977 ms 55740 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2059 ms 102468 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 5 ms 820 KB Output is correct
26 Correct 6 ms 1224 KB Output is correct
27 Correct 6 ms 1108 KB Output is correct
28 Correct 632 ms 42476 KB Output is correct
29 Correct 1056 ms 60416 KB Output is correct
30 Correct 1534 ms 82532 KB Output is correct
31 Correct 2007 ms 100932 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 4 ms 980 KB Output is correct
45 Correct 974 ms 52312 KB Output is correct
46 Correct 1614 ms 76760 KB Output is correct
47 Correct 1602 ms 76176 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 2301 ms 101176 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Incorrect 9 ms 1208 KB Given structure is not connected: There is no path between vertices 0 and 421
58 Halted 0 ms 0 KB -