oj.uz

Submission #759481

# Submission time Handle Problem Language Result Execution time Memory
759481 2023-06-16T10:46:07 Z drdilyor Fountain Parks (IOI21_parks) C++17
0 / 100
 0 ms 212 KB 
#include<bits/stdc++.h>
#include "parks.h"
using namespace std;

struct DSU {
    int n;
    vector<int> parent;
    vector<int> size;

    DSU(int n) : n(n), parent(n), size(n, 1) {
        iota(parent.begin(), parent.end(), 0);
    }

    int get(int i) {
        return parent[i] == i ? i : parent[i] = get(parent[i]);
    }

    void merge(int v, int u) {
        v = get(v);
        u = get(u);
        if (u == v) return;
        if (size[v] < size[u]) swap(v, u);
        parent[u] = v;
        size[v] += size[u];
    }
};


int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
        build({}, {}, {}, {});
        return 1;
    }

    int n = x.size();

    std::vector<int> u, v, a, b;
    map<pair<int,int>, int> ft;
    for (int i = 0; i < n;i ++)
        ft[{x[i], y[i]}] = i;
    set<pair<int,int>> bench;

    for (int i = 0; i < n; i++) {
        for (auto [dx, dy] : {pair{0, -2}, {0, +2}, {-2, 0}, {+2, 0}}) {
            pair pos{x[i]+dx, y[i]+dy};
            if (!ft.count(pos)) continue;
            int j = ft[pos];
            u.push_back(i);
            v.push_back(j);
            vector<pair<int,int>> pos_bench;
            if (dx) {
                pos_bench = {{x[i]+dx/2, y[i]+1}, {x[i]+dx/2, y[i]-1}};
            } else {
                pos_bench = {{x[i]+1, y[i]+dy/2}, {x[i]-1, y[i]+dy/2}};
            }
            bool done = 0;
            for (auto pos : pos_bench) {
                if (bench.count(pos) == 0) {
                    done = 1;
                    a.push_back(pos.first);
                    b.push_back(pos.second);
                    break;
                }
            }
            if (!done) return 0;
        }
    }
    DSU cc(n);
    for (int i = 0; i < (int)u.size(); i++) {
        cc.merge(u[i], v[i]);
    }
    if (cc.size[cc.get(0)] != n) return 0;

    build(u, v, a, b);

    return 1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Edge between 1 and 0 appears more than once: appeared on positions 0 and 1
3 Halted 0 ms 0 KB -