oj.uz

답안 #797794

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
797794 2023-07-29T22:46:25 Z Liudas 분수 공원 (IOI21_parks) C++17
15 / 100
 2610 ms 115020 KB 
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
void dfs(int head, vector<vector<int>>&tree, vector<int> &vis){
    vis[head] = true;
    for(int i : tree[head]){
        if(!vis[i]){
            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]}]);
                road[{x[i], y[i], x[i]+dx[j], y[i] + dy[j]}] = true;
                road[{x[i]+dx[j], y[i] + dy[j], x[i], y[i]}] = true;
                if(dx[j]){
                    bench[{x[i] + dx[j]/2, y[i] + 1}] ++;
                    bench[{x[i] + dx[j]/2, y[i] - 1}] ++;
                }
                if(dy[j]){
                    bench[{x[i] + 1, y[i] + dy[j] / 2}] ++;
                    bench[{x[i] - 1, y[i] + dy[j] / 2}] ++;
                }
            }
        }
    }
    vector<pair<int, int>> pairs;
    for(auto [l, r] : bench){
        pairs.push_back(l);
    }
    vector<int> vis(N, 0);
    dfs(0, tree, vis);
    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

# 결과 실행 시간 메모리 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 2438 ms 115020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 980 KB Output is correct
26 Correct 9 ms 1664 KB Output is correct
27 Correct 12 ms 2004 KB Output is correct
28 Correct 765 ms 44084 KB Output is correct
29 Correct 1275 ms 66436 KB Output is correct
30 Correct 1875 ms 89432 KB Output is correct
31 Correct 2409 ms 114164 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 0 ms 212 KB Output is correct
43 Correct 4 ms 1000 KB Output is correct
44 Correct 7 ms 1364 KB Output is correct
45 Correct 771 ms 44156 KB Output is correct
46 Correct 1259 ms 64468 KB Output is correct
47 Correct 1249 ms 64144 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 2438 ms 115020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 980 KB Output is correct
26 Correct 9 ms 1664 KB Output is correct
27 Correct 12 ms 2004 KB Output is correct
28 Correct 765 ms 44084 KB Output is correct
29 Correct 1275 ms 66436 KB Output is correct
30 Correct 1875 ms 89432 KB Output is correct
31 Correct 2409 ms 114164 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 0 ms 212 KB Output is correct
43 Correct 4 ms 1000 KB Output is correct
44 Correct 7 ms 1364 KB Output is correct
45 Correct 771 ms 44156 KB Output is correct
46 Correct 1259 ms 64468 KB Output is correct
47 Correct 1249 ms 64144 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 1 ms 212 KB Output is correct
55 Correct 2610 ms 114616 KB Output is correct
56 Incorrect 0 ms 212 KB Given structure is not connected: There is no path between vertices 0 and 2
57 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 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 1447 ms 86180 KB Output is correct
21 Correct 1461 ms 85804 KB Output is correct
22 Correct 1506 ms 83280 KB Output is correct
23 Correct 1351 ms 83004 KB Output is correct
24 Correct 285 ms 21328 KB Output is correct
25 Correct 1465 ms 81068 KB Output is correct
26 Correct 1185 ms 81268 KB Output is correct
27 Correct 1698 ms 91116 KB Output is correct
28 Correct 1687 ms 91068 KB Output is correct
29 Correct 2055 ms 91064 KB Output is correct
30 Correct 2096 ms 90972 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 72 ms 6220 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 KB Output is correct
17 Correct 1603 ms 100388 KB Output is correct
18 Correct 1611 ms 99464 KB Output is correct
19 Incorrect 1527 ms 85892 KB Given structure is not connected: There is no path between vertices 0 and 19799
20 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 1 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 713 ms 49944 KB Output is correct
10 Correct 51 ms 5280 KB Output is correct
11 Correct 245 ms 27112 KB Output is correct
12 Correct 53 ms 7648 KB Output is correct
13 Correct 94 ms 19428 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 4 ms 1108 KB Output is correct
16 Correct 676 ms 48044 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 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 2438 ms 115020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 980 KB Output is correct
26 Correct 9 ms 1664 KB Output is correct
27 Correct 12 ms 2004 KB Output is correct
28 Correct 765 ms 44084 KB Output is correct
29 Correct 1275 ms 66436 KB Output is correct
30 Correct 1875 ms 89432 KB Output is correct
31 Correct 2409 ms 114164 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 0 ms 212 KB Output is correct
43 Correct 4 ms 1000 KB Output is correct
44 Correct 7 ms 1364 KB Output is correct
45 Correct 771 ms 44156 KB Output is correct
46 Correct 1259 ms 64468 KB Output is correct
47 Correct 1249 ms 64144 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 1 ms 212 KB Output is correct
55 Correct 2610 ms 114616 KB Output is correct
56 Incorrect 0 ms 212 KB Given structure is not connected: There is no path between vertices 0 and 2
57 Halted 0 ms 0 KB -