oj.uz

답안 #560695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560695 2022-05-11T23:46:43 Z AlperenT 분수 공원 (IOI21_parks) C++17
30 / 100
 634 ms 88412 KB 
#include "parks.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 2e5 + 5;
 
struct DSU{
    int par[N], setsize[N], setcnt;
 
    void reset(int n){
        for(int i = 0; i < n; i++) par[i] = i, setsize[i] = 1;
        setcnt = n;
    }
 
    int setfind(int a){
        if(a == par[a]) return a;
        else return par[a] = setfind(par[a]);
    }
 
    void setunion(int a, int b){
        a = setfind(a), b = setfind(b);
 
        if(a != b){
            if(setsize[b] > setsize[a]) swap(a, b);
            par[b] = par[a];
            setsize[a] += setsize[b];
            setcnt--;
        }
    }
};
 
DSU dsu;
 
struct Point{
    int x, y;
 
    bool operator < (const Point &sc) const{
        if(x == sc.x) return y < sc.y;
        else return x < sc.x;
    }
};
 
int construct_roads(vector<int> xvec, vector<int> yvec){
    int n = xvec.size();
 
    dsu.reset(n);
 
    map<Point, int> nodes;
    map<Point, Point> edges;
    map<Point, bool> vis;
 
    for(int i = 0; i < n; i++) nodes[{xvec[i], yvec[i]}] = i;
 
    if(*max_element(xvec.begin(), xvec.end()) <= 2){    // subtask 1
        for(auto p : nodes){
            Point po = p.first;
            if(nodes.find({2, po.y + 2}) != nodes.end()){
                edges[{p.second, nodes[{2, po.y + 2}]}] = {1, po.y + 1};
                dsu.setunion(p.second, nodes[{2, po.y + 2}]);
            }
        }
    }
    else if(*max_element(xvec.begin(), xvec.end()) <= 4){    // subtask 2
        vector<int> x2, x4;
 
        for(int i = 0; i < n; i++){
            if(xvec[i] == 2) x2.push_back(yvec[i]);
            else if(xvec[i] == 4) x4.push_back(yvec[i]);
        } 
 
        sort(x2.begin(), x2.end());
        sort(x4.begin(), x4.end());
 
        for(auto y : x2){
            if(nodes.find({2, y + 2}) != nodes.end()){
                edges[{nodes[{2, y}], nodes[{2, y + 2}]}] = {1, y + 1};
                dsu.setunion(nodes[{2, y}], nodes[{2, y + 2}]);
            }
        }
 
        for(auto y : x4){
            if(nodes.find({4, y + 2}) != nodes.end()){
                edges[{nodes[{4, y}], nodes[{4, y + 2}]}] = {5, y + 1};
                dsu.setunion(nodes[{4, y}], nodes[{4, y + 2}]);
            }
 
            if(nodes.find({2, y}) != nodes.end()){
                edges[{nodes[{4, y}], nodes[{2, y}]}] = {3, y + 1};
                dsu.setunion(nodes[{4, y}], nodes[{2, y}]);
            }
        }
    }
    else if(*max_element(xvec.begin(), xvec.end()) <= 6){    // subtask 3
        vector<int> x2, x4, x6;
 
        for(int i = 0; i < n; i++){
            if(xvec[i] == 2) x2.push_back(yvec[i]);
            else if(xvec[i] == 4) x4.push_back(yvec[i]);
            else if(xvec[i] == 6) x6.push_back(yvec[i]);
        } 
 
        sort(x2.begin(), x2.end());
        sort(x4.begin(), x4.end());
        sort(x6.begin(), x6.end());
 
        for(auto y : x2){
            if(nodes.find({2, y + 2}) != nodes.end()){
                edges[{nodes[{2, y}], nodes[{2, y + 2}]}] = {1, y + 1};
                dsu.setunion(nodes[{2, y}], nodes[{2, y + 2}]);
            }
        }
 
        for(auto y : x6){
            if(nodes.find({6, y + 2}) != nodes.end()){
                edges[{nodes[{6, y}], nodes[{6, y + 2}]}] = {7, y + 1};
                dsu.setunion(nodes[{6, y}], nodes[{6, y + 2}]);
            }
        }
 
        for(auto y : x4){
            if(nodes.find({4, y + 2}) != nodes.end()){
                dsu.setunion(nodes[{4, y}], nodes[{4, y + 2}]);
            }
        }
 
        for(auto y : x4){
            if(nodes.find({6, y}) != nodes.end() && dsu.setfind(nodes[{4, y}]) != dsu.setfind(nodes[{6, y}])){
                edges[{nodes[{4, y}], nodes[{6, y}]}] = {5, y - 1};
                vis[{5, y - 1}] = true;
                dsu.setunion(nodes[{4, y}], nodes[{6, y}]);
 
                if(nodes.find({2, y}) != nodes.end() && dsu.setfind(nodes[{4, y}]) != dsu.setfind(nodes[{2, y}])){
                    edges[{nodes[{2, y}], nodes[{4, y}]}] = {3, y + 1};
                    vis[{3, y + 1}] = true;
                    dsu.setunion(nodes[{2, y}], nodes[{4, y}]);
                }
            }
            else if(nodes.find({2, y}) != nodes.end() && dsu.setfind(nodes[{4, y}]) != dsu.setfind(nodes[{2, y}])){
                edges[{nodes[{2, y}], nodes[{4, y}]}] = {3, y - 1};
                vis[{3, y - 1}] = true;
                dsu.setunion(nodes[{2, y}], nodes[{4, y}]);
            }
        }
 
        for(auto y : x4){
            if(nodes.find({4, y + 2}) != nodes.end()){
                if(!vis[{3, y + 1}]){
                    edges[{nodes[{4, y}], nodes[{4, y + 2}]}] = {3, y + 1};
                }
                else if(!vis[{5, y + 1}]){
                    edges[{nodes[{4, y}], nodes[{4, y + 2}]}] = {5, y + 1};
                }
                else assert(false);
            }
        }
    }
    else{    // subtask 4, 5
        for(auto p : nodes){
            Point po = p.first;

            if(nodes.find({po.x + 2, po.y}) != nodes.end()){
                if(!vis[{po.x + 1, po.y - 1}]){
                    edges[{p.second, nodes[{po.x + 2, po.y}]}] = {po.x + 1, po.y - 1};
                    vis[{po.x + 1, po.y - 1}] = true;
                    dsu.setunion(p.second, nodes[{po.x + 2, po.y}]);
                }
                else if(!vis[{po.x + 1, po.y + 1}]){
                    edges[{p.second, nodes[{po.x + 2, po.y}]}] = {po.x + 1, po.y + 1};
                    vis[{po.x + 1, po.y + 1}] = true;
                    dsu.setunion(p.second, nodes[{po.x + 2, po.y}]);
                }
                else assert(false);
            }

            if(nodes.find({po.x, po.y + 2}) != nodes.end()){
                if(!vis[{po.x + 1, po.y + 1}]){
                    edges[{p.second, nodes[{po.x, po.y + 2}]}] = {po.x + 1, po.y + 1};
                    vis[{po.x + 1, po.y + 1}] = true;
                    dsu.setunion(p.second, nodes[{po.x, po.y + 2}]);
                }
                else if(!vis[{po.x - 1, po.y + 1}]){
                    edges[{p.second, nodes[{po.x, po.y + 2}]}] = {po.x - 1, po.y + 1};
                    vis[{po.x - 1, po.y + 1}] = true;
                    dsu.setunion(p.second, nodes[{po.x, po.y + 2}]);
                }
                else assert(false);
            }
        }
    }
 
    if(dsu.setcnt == 1){
        vector<int> vecs[4];
 
        for(auto p : edges){
            vecs[0].push_back(p.first.x);
            vecs[1].push_back(p.first.y);
            vecs[2].push_back(p.second.x);
            vecs[3].push_back(p.second.y);
        }
 
        build(vecs[0], vecs[1], vecs[2], vecs[3]);
 
        return 1;
    }
    else return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 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 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 598 ms 50460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 936 KB Output is correct
28 Correct 179 ms 20576 KB Output is correct
29 Correct 297 ms 30508 KB Output is correct
30 Correct 437 ms 40616 KB Output is correct
31 Correct 576 ms 50476 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 179 ms 20184 KB Output is correct
46 Correct 299 ms 29816 KB Output is correct
47 Correct 303 ms 29672 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 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 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 598 ms 50460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 936 KB Output is correct
28 Correct 179 ms 20576 KB Output is correct
29 Correct 297 ms 30508 KB Output is correct
30 Correct 437 ms 40616 KB Output is correct
31 Correct 576 ms 50476 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 179 ms 20184 KB Output is correct
46 Correct 299 ms 29816 KB Output is correct
47 Correct 303 ms 29672 KB Output is correct
48 Correct 1 ms 256 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 523 ms 44224 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 9 ms 1748 KB Output is correct
59 Correct 11 ms 2004 KB Output is correct
60 Correct 222 ms 22424 KB Output is correct
61 Correct 314 ms 29580 KB Output is correct
62 Correct 406 ms 36264 KB Output is correct
63 Correct 538 ms 44204 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 466 ms 40080 KB Output is correct
68 Correct 468 ms 40032 KB Output is correct
69 Correct 448 ms 39912 KB Output is correct
70 Correct 4 ms 980 KB Output is correct
71 Correct 9 ms 1796 KB Output is correct
72 Correct 227 ms 23768 KB Output is correct
73 Correct 403 ms 34628 KB Output is correct
74 Correct 548 ms 46512 KB Output is correct
75 Correct 504 ms 42748 KB Output is correct
76 Correct 452 ms 40064 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 10 ms 1876 KB Output is correct
79 Correct 217 ms 23008 KB Output is correct
80 Correct 403 ms 33872 KB Output is correct
81 Correct 554 ms 45532 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 566 ms 54700 KB Output is correct
21 Correct 634 ms 54392 KB Output is correct
22 Correct 554 ms 54360 KB Output is correct
23 Correct 521 ms 46136 KB Output is correct
24 Correct 192 ms 19232 KB Output is correct
25 Correct 521 ms 44256 KB Output is correct
26 Correct 499 ms 44008 KB Output is correct
27 Correct 589 ms 53676 KB Output is correct
28 Correct 597 ms 53672 KB Output is correct
29 Correct 606 ms 53732 KB Output is correct
30 Correct 595 ms 53796 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Runtime error 7 ms 3028 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 KB Output is correct
17 Correct 622 ms 52136 KB Output is correct
18 Correct 595 ms 54276 KB Output is correct
19 Runtime error 459 ms 88412 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
9 Correct 173 ms 20080 KB Output is correct
10 Correct 11 ms 2516 KB Output is correct
11 Correct 69 ms 10972 KB Output is correct
12 Correct 16 ms 3548 KB Output is correct
13 Correct 42 ms 6816 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 156 ms 20020 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 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 598 ms 50460 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 936 KB Output is correct
28 Correct 179 ms 20576 KB Output is correct
29 Correct 297 ms 30508 KB Output is correct
30 Correct 437 ms 40616 KB Output is correct
31 Correct 576 ms 50476 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 179 ms 20184 KB Output is correct
46 Correct 299 ms 29816 KB Output is correct
47 Correct 303 ms 29672 KB Output is correct
48 Correct 1 ms 256 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 523 ms 44224 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 9 ms 1748 KB Output is correct
59 Correct 11 ms 2004 KB Output is correct
60 Correct 222 ms 22424 KB Output is correct
61 Correct 314 ms 29580 KB Output is correct
62 Correct 406 ms 36264 KB Output is correct
63 Correct 538 ms 44204 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 466 ms 40080 KB Output is correct
68 Correct 468 ms 40032 KB Output is correct
69 Correct 448 ms 39912 KB Output is correct
70 Correct 4 ms 980 KB Output is correct
71 Correct 9 ms 1796 KB Output is correct
72 Correct 227 ms 23768 KB Output is correct
73 Correct 403 ms 34628 KB Output is correct
74 Correct 548 ms 46512 KB Output is correct
75 Correct 504 ms 42748 KB Output is correct
76 Correct 452 ms 40064 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 10 ms 1876 KB Output is correct
79 Correct 217 ms 23008 KB Output is correct
80 Correct 403 ms 33872 KB Output is correct
81 Correct 554 ms 45532 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 566 ms 54700 KB Output is correct
86 Correct 634 ms 54392 KB Output is correct
87 Correct 554 ms 54360 KB Output is correct
88 Correct 521 ms 46136 KB Output is correct
89 Correct 192 ms 19232 KB Output is correct
90 Correct 521 ms 44256 KB Output is correct
91 Correct 499 ms 44008 KB Output is correct
92 Correct 589 ms 53676 KB Output is correct
93 Correct 597 ms 53672 KB Output is correct
94 Correct 606 ms 53732 KB Output is correct
95 Correct 595 ms 53796 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Runtime error 7 ms 3028 KB Execution killed with signal 6
98 Halted 0 ms 0 KB -