oj.uz

Submission #439477

# Submission time Handle Problem Language Result Execution time Memory
439477 2021-06-30T05:47:50 Z qwerasdfzxcl Fountain Parks (IOI21_parks) C++17
55 / 100
 1805 ms 146556 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
struct point{
    int x, y, n;
    point(){}
    point(int _x, int _y, int _n): x(_x), y(_y), n(_n) {}
    bool operator<(const point &P) const{
        if (x==P.x) return y<P.y;
        return x<P.x;
    }
};
struct DSU{
    int path[200200];
    void init(int n){
        for (int i=0;i<n;i++) path[i] = i;
    }
    int find(int s){
        if (s==path[s]) return s;
        return path[s] = find(path[s]);
    }
    void merge(int s, int v){
        int x = find(s), y = find(v);
        if (x==y) return;
        path[x] = y;
    }
}dsu;
struct Vertex{
    int s, e, x, y;
    Vertex(){}
    Vertex(int _s, int _e, int _x, int _y): s(_s), e(_e), x(_x), y(_y) {}
};
map<int, int> mp[200200];
multimap<pair<int, int>, int> INV;
vector<Vertex> graph;
vector<int> adj[400400], inv[400400];

bool make_edge(int x, int y, int x2, int y2){
    if (mp[x].find(y)==mp[x].end() || mp[x2].find(y2)==mp[x2].end()) return 0;
    int tmp1 = mp[x][y], tmp2 = mp[x2][y2];
    if (dsu.find(tmp1)==dsu.find(tmp2)) return 0;
    if (tmp1>tmp2) swap(tmp1, tmp2);
    dsu.merge(tmp1, tmp2);

    if (x==x2){
        graph.emplace_back(tmp1, tmp2, x-1, (y+y2)/2);
        graph.emplace_back(tmp1, tmp2, x+1, (y+y2)/2);
        INV.insert(make_pair(make_pair(x-1, (y+y2)/2), (int)graph.size()-2));
        INV.insert(make_pair(make_pair(x+1, (y+y2)/2), (int)graph.size()-1));
    }
    else{
        graph.emplace_back(tmp1, tmp2, (x+x2)/2, y-1);
        graph.emplace_back(tmp1, tmp2, (x+x2)/2, y+1);
        INV.insert(make_pair(make_pair((x+x2)/2, y-1), (int)graph.size()-2));
        INV.insert(make_pair(make_pair((x+x2)/2, y+1), (int)graph.size()-1));
    }
    return 1;
}

bool valid(int n){
    bool ret = 1;
    for (int i=0;i<n-1;i++) if (dsu.find(i)!=dsu.find(i+1)) ret = 0;
    return ret;
}

int sccnum[400400], col[400400], cnt = 0;
bool visited[400400];
stack<int> st;
vector<vector<int>> scc;

void dfs1(int s){
    visited[s] = 1;
    for (auto &v:adj[s]) if (!visited[v]) dfs1(v);
    st.push(s);
}

void dfs2(int s){
    visited[s] = 1;
    sccnum[s] = cnt;
    scc.back().push_back(s);
    for (auto &v:inv[s]) if (!visited[v]) dfs2(v);
}

void getscc(int n){
    for (int i=0;i<n;i++){
        for (auto &v:adj[i]) inv[v].push_back(i);
    }
    for (int i=0;i<n;i++) if (!visited[i]) dfs1(i);
    fill(visited, visited+n, 0);
    scc.push_back(vector<int>());
    while(!st.empty()){
        int cur = st.top(); st.pop();
        if (visited[cur]) continue;
        cnt++;
        scc.push_back(vector<int>());
        dfs2(cur);
    }
}

bool cmp(point &x, point &y){
    if (x.y==y.y) return x.x<y.x;
    return x.y<y.y;
}

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
	build({}, {}, {}, {});
        return 1;
    }
    std::vector<int> ansu, ansv, ansa, ansb;
    vector<point> vec;
    int n = x.size();
    for (int i=0;i<n;i++){
        vec.emplace_back(x[i], y[i], i);
        mp[x[i]][y[i]] = i;
    }

    ///graph modeling
    dsu.init(n);
    for (int i=0;i<n;i++) if ((vec[i].x+vec[i].y)%4==0){
        make_edge(vec[i].x, vec[i].y, vec[i].x+2, vec[i].y);
        make_edge(vec[i].x, vec[i].y, vec[i].x-2, vec[i].y);
        make_edge(vec[i].x, vec[i].y, vec[i].x, vec[i].y+2);
        make_edge(vec[i].x, vec[i].y, vec[i].x, vec[i].y-2);
    }
    for (int i=0;i<n;i++) if ((vec[i].x+vec[i].y)%4==2){
        make_edge(vec[i].x, vec[i].y, vec[i].x+2, vec[i].y);
        make_edge(vec[i].x, vec[i].y, vec[i].x-2, vec[i].y);
        make_edge(vec[i].x, vec[i].y, vec[i].x, vec[i].y+2);
        make_edge(vec[i].x, vec[i].y, vec[i].x, vec[i].y-2);
    }
    if (!valid(n)) return 0;

    for (auto iter=INV.begin();iter!=INV.end();++iter){
        auto tmp = INV.equal_range(iter->first);
        auto iter1 = tmp.first, iter2 = tmp.second;
        for(;iter1!=iter2;++iter1){
            if (iter1==iter) continue;
            adj[iter->second].push_back((iter1->second)^1);
        }
    }
    ///

    getscc((int)graph.size());
    for (int i=0;i<(int)graph.size();i++) if (sccnum[i]==sccnum[i^1]) return 0;

    ///finding solution
    fill(col, col+(int)graph.size(), -1);
    for (auto &V:scc){
        int tmp = 0;
        for (auto &x:V) if (col[x]==1) tmp = 1;
        for (auto &x:V) col[x] = tmp, col[x^1] = tmp^1;
    }
    ///
    for (int i=0;i<(int)graph.size();i++) if (col[i]==1){
        ansu.push_back(graph[i].s);
        ansv.push_back(graph[i].e);
        ansa.push_back(graph[i].x);
        ansb.push_back(graph[i].y);
    }
    build(ansu, ansv, ansa, ansb);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct
17 Correct 25 ms 28492 KB Output is correct
18 Correct 20 ms 28520 KB Output is correct
19 Correct 21 ms 28408 KB Output is correct
20 Correct 19 ms 28416 KB Output is correct
21 Correct 21 ms 28400 KB Output is correct
22 Correct 25 ms 28492 KB Output is correct
23 Correct 1803 ms 132784 KB Output is correct
24 Correct 21 ms 28492 KB Output is correct
25 Correct 24 ms 29156 KB Output is correct
26 Correct 28 ms 29120 KB Output is correct
27 Correct 28 ms 29412 KB Output is correct
28 Correct 519 ms 71212 KB Output is correct
29 Correct 925 ms 91576 KB Output is correct
30 Correct 1219 ms 113988 KB Output is correct
31 Correct 1805 ms 134024 KB Output is correct
32 Correct 20 ms 28492 KB Output is correct
33 Correct 22 ms 28452 KB Output is correct
34 Correct 19 ms 28492 KB Output is correct
35 Correct 19 ms 28484 KB Output is correct
36 Correct 22 ms 28492 KB Output is correct
37 Correct 19 ms 28492 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 21 ms 28444 KB Output is correct
40 Correct 21 ms 28512 KB Output is correct
41 Correct 24 ms 28492 KB Output is correct
42 Correct 19 ms 28448 KB Output is correct
43 Correct 24 ms 28876 KB Output is correct
44 Correct 37 ms 29132 KB Output is correct
45 Correct 628 ms 77688 KB Output is correct
46 Correct 958 ms 100808 KB Output is correct
47 Correct 955 ms 100820 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct
17 Correct 25 ms 28492 KB Output is correct
18 Correct 20 ms 28520 KB Output is correct
19 Correct 21 ms 28408 KB Output is correct
20 Correct 19 ms 28416 KB Output is correct
21 Correct 21 ms 28400 KB Output is correct
22 Correct 25 ms 28492 KB Output is correct
23 Correct 1803 ms 132784 KB Output is correct
24 Correct 21 ms 28492 KB Output is correct
25 Correct 24 ms 29156 KB Output is correct
26 Correct 28 ms 29120 KB Output is correct
27 Correct 28 ms 29412 KB Output is correct
28 Correct 519 ms 71212 KB Output is correct
29 Correct 925 ms 91576 KB Output is correct
30 Correct 1219 ms 113988 KB Output is correct
31 Correct 1805 ms 134024 KB Output is correct
32 Correct 20 ms 28492 KB Output is correct
33 Correct 22 ms 28452 KB Output is correct
34 Correct 19 ms 28492 KB Output is correct
35 Correct 19 ms 28484 KB Output is correct
36 Correct 22 ms 28492 KB Output is correct
37 Correct 19 ms 28492 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 21 ms 28444 KB Output is correct
40 Correct 21 ms 28512 KB Output is correct
41 Correct 24 ms 28492 KB Output is correct
42 Correct 19 ms 28448 KB Output is correct
43 Correct 24 ms 28876 KB Output is correct
44 Correct 37 ms 29132 KB Output is correct
45 Correct 628 ms 77688 KB Output is correct
46 Correct 958 ms 100808 KB Output is correct
47 Correct 955 ms 100820 KB Output is correct
48 Correct 19 ms 28432 KB Output is correct
49 Correct 20 ms 28520 KB Output is correct
50 Correct 25 ms 28432 KB Output is correct
51 Correct 19 ms 28444 KB Output is correct
52 Correct 19 ms 28452 KB Output is correct
53 Correct 21 ms 28460 KB Output is correct
54 Correct 19 ms 28492 KB Output is correct
55 Incorrect 1461 ms 115868 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct
17 Correct 25 ms 28492 KB Output is correct
18 Correct 19 ms 28624 KB Output is correct
19 Correct 28 ms 28416 KB Output is correct
20 Correct 988 ms 146556 KB Output is correct
21 Correct 1072 ms 141200 KB Output is correct
22 Correct 1043 ms 140492 KB Output is correct
23 Correct 695 ms 99836 KB Output is correct
24 Correct 307 ms 44144 KB Output is correct
25 Correct 908 ms 75388 KB Output is correct
26 Correct 798 ms 75504 KB Output is correct
27 Correct 901 ms 111564 KB Output is correct
28 Correct 974 ms 111684 KB Output is correct
29 Correct 1080 ms 111488 KB Output is correct
30 Correct 1241 ms 111532 KB Output is correct
31 Correct 19 ms 28492 KB Output is correct
32 Correct 65 ms 35644 KB Output is correct
33 Correct 110 ms 36260 KB Output is correct
34 Correct 940 ms 145116 KB Output is correct
35 Correct 54 ms 30784 KB Output is correct
36 Correct 153 ms 40188 KB Output is correct
37 Correct 447 ms 51984 KB Output is correct
38 Correct 419 ms 69440 KB Output is correct
39 Correct 638 ms 84184 KB Output is correct
40 Correct 939 ms 100596 KB Output is correct
41 Correct 1126 ms 115292 KB Output is correct
42 Correct 1384 ms 130192 KB Output is correct
43 Correct 21 ms 28516 KB Output is correct
44 Correct 21 ms 28504 KB Output is correct
45 Correct 20 ms 28492 KB Output is correct
46 Correct 19 ms 28496 KB Output is correct
47 Correct 21 ms 28492 KB Output is correct
48 Correct 21 ms 28408 KB Output is correct
49 Correct 21 ms 28412 KB Output is correct
50 Correct 20 ms 28492 KB Output is correct
51 Correct 22 ms 28492 KB Output is correct
52 Correct 19 ms 28492 KB Output is correct
53 Correct 22 ms 28452 KB Output is correct
54 Correct 25 ms 28980 KB Output is correct
55 Correct 27 ms 29132 KB Output is correct
56 Correct 623 ms 77632 KB Output is correct
57 Correct 905 ms 100920 KB Output is correct
58 Correct 940 ms 100868 KB Output is correct
59 Correct 20 ms 28492 KB Output is correct
60 Correct 20 ms 28484 KB Output is correct
61 Correct 21 ms 28492 KB Output is correct
62 Correct 1200 ms 111412 KB Output is correct
63 Correct 1205 ms 111512 KB Output is correct
64 Correct 1080 ms 111252 KB Output is correct
65 Correct 28 ms 29388 KB Output is correct
66 Correct 36 ms 30372 KB Output is correct
67 Correct 658 ms 77740 KB Output is correct
68 Correct 1016 ms 103332 KB Output is correct
69 Correct 1385 ms 127108 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct
17 Correct 920 ms 111932 KB Output is correct
18 Correct 918 ms 112064 KB Output is correct
19 Correct 1154 ms 143596 KB Output is correct
20 Correct 1134 ms 119288 KB Output is correct
21 Correct 1137 ms 105204 KB Output is correct
22 Correct 19 ms 28492 KB Output is correct
23 Correct 130 ms 44272 KB Output is correct
24 Correct 64 ms 33192 KB Output is correct
25 Correct 231 ms 46268 KB Output is correct
26 Correct 445 ms 56640 KB Output is correct
27 Correct 588 ms 78688 KB Output is correct
28 Correct 865 ms 91008 KB Output is correct
29 Correct 1073 ms 104744 KB Output is correct
30 Correct 1223 ms 116648 KB Output is correct
31 Correct 1450 ms 129156 KB Output is correct
32 Correct 1316 ms 126468 KB Output is correct
33 Correct 1057 ms 111628 KB Output is correct
34 Correct 31 ms 29640 KB Output is correct
35 Correct 50 ms 30660 KB Output is correct
36 Correct 614 ms 77596 KB Output is correct
37 Correct 1044 ms 103204 KB Output is correct
38 Correct 1484 ms 127144 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 28508 KB Output is correct
2 Correct 21 ms 28480 KB Output is correct
3 Correct 27 ms 28492 KB Output is correct
4 Correct 23 ms 28492 KB Output is correct
5 Correct 22 ms 28432 KB Output is correct
6 Correct 21 ms 28436 KB Output is correct
7 Correct 19 ms 28408 KB Output is correct
8 Correct 19 ms 28468 KB Output is correct
9 Correct 449 ms 70108 KB Output is correct
10 Correct 45 ms 32704 KB Output is correct
11 Correct 163 ms 51016 KB Output is correct
12 Correct 58 ms 34824 KB Output is correct
13 Correct 111 ms 39040 KB Output is correct
14 Correct 21 ms 28640 KB Output is correct
15 Correct 27 ms 28904 KB Output is correct
16 Correct 460 ms 70024 KB Output is correct
17 Correct 25 ms 28492 KB Output is correct
18 Correct 20 ms 28520 KB Output is correct
19 Correct 21 ms 28408 KB Output is correct
20 Correct 19 ms 28416 KB Output is correct
21 Correct 21 ms 28400 KB Output is correct
22 Correct 25 ms 28492 KB Output is correct
23 Correct 1803 ms 132784 KB Output is correct
24 Correct 21 ms 28492 KB Output is correct
25 Correct 24 ms 29156 KB Output is correct
26 Correct 28 ms 29120 KB Output is correct
27 Correct 28 ms 29412 KB Output is correct
28 Correct 519 ms 71212 KB Output is correct
29 Correct 925 ms 91576 KB Output is correct
30 Correct 1219 ms 113988 KB Output is correct
31 Correct 1805 ms 134024 KB Output is correct
32 Correct 20 ms 28492 KB Output is correct
33 Correct 22 ms 28452 KB Output is correct
34 Correct 19 ms 28492 KB Output is correct
35 Correct 19 ms 28484 KB Output is correct
36 Correct 22 ms 28492 KB Output is correct
37 Correct 19 ms 28492 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 21 ms 28444 KB Output is correct
40 Correct 21 ms 28512 KB Output is correct
41 Correct 24 ms 28492 KB Output is correct
42 Correct 19 ms 28448 KB Output is correct
43 Correct 24 ms 28876 KB Output is correct
44 Correct 37 ms 29132 KB Output is correct
45 Correct 628 ms 77688 KB Output is correct
46 Correct 958 ms 100808 KB Output is correct
47 Correct 955 ms 100820 KB Output is correct
48 Correct 19 ms 28432 KB Output is correct
49 Correct 20 ms 28520 KB Output is correct
50 Correct 25 ms 28432 KB Output is correct
51 Correct 19 ms 28444 KB Output is correct
52 Correct 19 ms 28452 KB Output is correct
53 Correct 21 ms 28460 KB Output is correct
54 Correct 19 ms 28492 KB Output is correct
55 Incorrect 1461 ms 115868 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -