oj.uz

답안 #560697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560697 2022-05-11T23:52:19 Z AlperenT 분수 공원 (IOI21_parks) C++17
30 / 100
 705 ms 52264 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() && dsu.setfind(p.second) != dsu.setfind(nodes[{po.x + 2, po.y}])){
                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() && dsu.setfind(p.second) != dsu.setfind(nodes[{po.x, po.y + 2}])){
                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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 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 643 ms 50500 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 194 ms 20580 KB Output is correct
29 Correct 350 ms 30456 KB Output is correct
30 Correct 452 ms 40756 KB Output is correct
31 Correct 613 ms 50648 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 200 ms 20208 KB Output is correct
46 Correct 297 ms 29700 KB Output is correct
47 Correct 349 ms 29788 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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 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 643 ms 50500 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 194 ms 20580 KB Output is correct
29 Correct 350 ms 30456 KB Output is correct
30 Correct 452 ms 40756 KB Output is correct
31 Correct 613 ms 50648 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 200 ms 20208 KB Output is correct
46 Correct 297 ms 29700 KB Output is correct
47 Correct 349 ms 29788 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 600 ms 44172 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 1736 KB Output is correct
59 Correct 12 ms 2048 KB Output is correct
60 Correct 262 ms 22320 KB Output is correct
61 Correct 343 ms 29648 KB Output is correct
62 Correct 481 ms 36156 KB Output is correct
63 Correct 576 ms 44192 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 531 ms 39992 KB Output is correct
68 Correct 550 ms 40016 KB Output is correct
69 Correct 498 ms 39832 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 11 ms 1748 KB Output is correct
72 Correct 268 ms 24096 KB Output is correct
73 Correct 459 ms 34652 KB Output is correct
74 Correct 587 ms 46524 KB Output is correct
75 Correct 557 ms 42564 KB Output is correct
76 Correct 531 ms 40024 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 15 ms 1876 KB Output is correct
79 Correct 248 ms 22924 KB Output is correct
80 Correct 418 ms 33900 KB Output is correct
81 Correct 642 ms 45540 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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 244 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 635 ms 52032 KB Output is correct
21 Correct 667 ms 52212 KB Output is correct
22 Correct 640 ms 52080 KB Output is correct
23 Correct 551 ms 44288 KB Output is correct
24 Correct 216 ms 17540 KB Output is correct
25 Correct 585 ms 42516 KB Output is correct
26 Correct 551 ms 42520 KB Output is correct
27 Correct 656 ms 52044 KB Output is correct
28 Correct 638 ms 52016 KB Output is correct
29 Correct 705 ms 52056 KB Output is correct
30 Correct 636 ms 52096 KB Output is correct
31 Correct 0 ms 224 KB Output is correct
32 Incorrect 20 ms 3256 KB Solution announced impossible, but it is possible.
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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 KB Output is correct
17 Correct 636 ms 52264 KB Output is correct
18 Correct 693 ms 52112 KB Output is correct
19 Correct 621 ms 52052 KB Output is correct
20 Correct 599 ms 51204 KB Output is correct
21 Correct 544 ms 45680 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Incorrect 48 ms 6808 KB Solution announced impossible, but it is possible.
24 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 1 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 1 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 196 ms 19912 KB Output is correct
10 Correct 11 ms 2492 KB Output is correct
11 Correct 77 ms 10928 KB Output is correct
12 Correct 17 ms 3468 KB Output is correct
13 Correct 47 ms 6880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 186 ms 19976 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 643 ms 50500 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 4 ms 852 KB Output is correct
27 Correct 5 ms 980 KB Output is correct
28 Correct 194 ms 20580 KB Output is correct
29 Correct 350 ms 30456 KB Output is correct
30 Correct 452 ms 40756 KB Output is correct
31 Correct 613 ms 50648 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 1 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 2 ms 596 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 200 ms 20208 KB Output is correct
46 Correct 297 ms 29700 KB Output is correct
47 Correct 349 ms 29788 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 600 ms 44172 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 1736 KB Output is correct
59 Correct 12 ms 2048 KB Output is correct
60 Correct 262 ms 22320 KB Output is correct
61 Correct 343 ms 29648 KB Output is correct
62 Correct 481 ms 36156 KB Output is correct
63 Correct 576 ms 44192 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 531 ms 39992 KB Output is correct
68 Correct 550 ms 40016 KB Output is correct
69 Correct 498 ms 39832 KB Output is correct
70 Correct 5 ms 980 KB Output is correct
71 Correct 11 ms 1748 KB Output is correct
72 Correct 268 ms 24096 KB Output is correct
73 Correct 459 ms 34652 KB Output is correct
74 Correct 587 ms 46524 KB Output is correct
75 Correct 557 ms 42564 KB Output is correct
76 Correct 531 ms 40024 KB Output is correct
77 Correct 6 ms 1108 KB Output is correct
78 Correct 15 ms 1876 KB Output is correct
79 Correct 248 ms 22924 KB Output is correct
80 Correct 418 ms 33900 KB Output is correct
81 Correct 642 ms 45540 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 244 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 635 ms 52032 KB Output is correct
86 Correct 667 ms 52212 KB Output is correct
87 Correct 640 ms 52080 KB Output is correct
88 Correct 551 ms 44288 KB Output is correct
89 Correct 216 ms 17540 KB Output is correct
90 Correct 585 ms 42516 KB Output is correct
91 Correct 551 ms 42520 KB Output is correct
92 Correct 656 ms 52044 KB Output is correct
93 Correct 638 ms 52016 KB Output is correct
94 Correct 705 ms 52056 KB Output is correct
95 Correct 636 ms 52096 KB Output is correct
96 Correct 0 ms 224 KB Output is correct
97 Incorrect 20 ms 3256 KB Solution announced impossible, but it is possible.
98 Halted 0 ms 0 KB -