oj.uz

답안 #797811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797811 2023-07-30T00:06:35 Z Liudas 분수 공원 (IOI21_parks) C++17
15 / 100
 1860 ms 117596 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());
    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;
        }
    }
   // cout << road.size() << endl;
    build(ansv, ansu, ansa, ansb);
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 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 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1719 ms 103452 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 1188 KB Output is correct
27 Correct 5 ms 1108 KB Output is correct
28 Correct 524 ms 41516 KB Output is correct
29 Correct 841 ms 59736 KB Output is correct
30 Correct 1279 ms 81400 KB Output is correct
31 Correct 1639 ms 102032 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 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 852 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 729 ms 51596 KB Output is correct
46 Correct 1165 ms 75596 KB Output is correct
47 Correct 1134 ms 74940 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 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 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1719 ms 103452 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 1188 KB Output is correct
27 Correct 5 ms 1108 KB Output is correct
28 Correct 524 ms 41516 KB Output is correct
29 Correct 841 ms 59736 KB Output is correct
30 Correct 1279 ms 81400 KB Output is correct
31 Correct 1639 ms 102032 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 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 852 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 729 ms 51596 KB Output is correct
46 Correct 1165 ms 75596 KB Output is correct
47 Correct 1134 ms 74940 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 1680 ms 99004 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 7 ms 1108 KB Output is correct
58 Incorrect 27 ms 3420 KB Given structure is not connected: There is no path between vertices 0 and 1106
59 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1288 ms 103196 KB Output is correct
21 Correct 1339 ms 101784 KB Output is correct
22 Correct 1388 ms 98452 KB Output is correct
23 Correct 1236 ms 95648 KB Output is correct
24 Correct 271 ms 26092 KB Output is correct
25 Correct 400 ms 32524 KB Output is correct
26 Correct 375 ms 32640 KB Output is correct
27 Correct 1532 ms 102140 KB Output is correct
28 Correct 1570 ms 102104 KB Output is correct
29 Correct 1809 ms 101956 KB Output is correct
30 Correct 1860 ms 101992 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 73 ms 7188 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

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 KB Output is correct
17 Correct 1506 ms 117596 KB Output is correct
18 Correct 1584 ms 116060 KB Output is correct
19 Correct 1378 ms 102972 KB Output is correct
20 Correct 1703 ms 100744 KB Output is correct
21 Correct 1506 ms 94208 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 171 ms 15308 KB Given structure is not connected: There is no path between vertices 0 and 1
24 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 611 ms 58288 KB Output is correct
10 Correct 39 ms 6096 KB Output is correct
11 Correct 258 ms 31812 KB Output is correct
12 Correct 60 ms 8928 KB Output is correct
13 Correct 83 ms 18876 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 610 ms 55152 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 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1719 ms 103452 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 1188 KB Output is correct
27 Correct 5 ms 1108 KB Output is correct
28 Correct 524 ms 41516 KB Output is correct
29 Correct 841 ms 59736 KB Output is correct
30 Correct 1279 ms 81400 KB Output is correct
31 Correct 1639 ms 102032 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 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 852 KB Output is correct
44 Correct 3 ms 852 KB Output is correct
45 Correct 729 ms 51596 KB Output is correct
46 Correct 1165 ms 75596 KB Output is correct
47 Correct 1134 ms 74940 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 1680 ms 99004 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 7 ms 1108 KB Output is correct
58 Incorrect 27 ms 3420 KB Given structure is not connected: There is no path between vertices 0 and 1106
59 Halted 0 ms 0 KB -