oj.uz

Submission #155222

# Submission time Handle Problem Language Result Execution time Memory
155222 2019-09-27T07:00:44 Z KCSC Drzava (COCI15_drzava) C++14
48 / 160
 1000 ms 31888 KB 
#include <bits/stdc++.h>
using namespace std;

const int DIM = 50005;
const int MOD = 666013;
const int CNS = 1000000007;
const double EPS = 0.000001;

int fth[DIM], msk[DIM];

vector<int> hsh[MOD];
map<pair<int, int>, int> mmp;

struct Point {
    int x, y, c;
} pts[DIM];

int _(pair<int, int> pr) {
    return (1LL * pr.first % MOD * CNS + pr.second) % MOD;
}

inline int getRoot(int x) {
    while (fth[x] > 0)
        x = fth[x];
    return x;
}

inline int sign(double x, double y) {
    if (fabs(x - y) < EPS)
        return 0;
    return (x < y ? -1 : 1);
}

int _k;
bool unite(int x, int y, double v) {
    if (sign(hypot(abs(pts[x].x - pts[y].x),
                   abs(pts[x].y - pts[y].y)), v * 2) > 0)
        return false;
    x = getRoot(x); y = getRoot(y);
    if (x == y)
        return false;
    if (fth[x] > fth[y])
        swap(x, y);
    fth[x] += fth[y]; fth[y] = x;
    for (int i = 0; i < _k; ++i) {
        if ((msk[y] >> i) & 1) {
            msk[x] |= ((1LL * msk[x]) << i) | (((1LL * msk[x]) << i) >> _k);
            msk[x] &= (1 << _k) - 1;
        }
    }
    if (msk[x] & 1)
        return true;
    return false;
}

bool solve(int n, int k, double v) {
    mmp.clear(); v /= 2;
    for (int i = 1; i <= n; ++i) {
        pair<int, int> sq = make_pair(pts[i].x / v, pts[i].y / v);
        if (++mmp[sq] == k)
            return true;
    }
    for (int i = 0; i < MOD; ++i)
        hsh[i].clear();
    for (int i = 1; i <= n; ++i) {
        fth[i] = -1;
        msk[i] = (1 << pts[i].c);
    }
    for (int i = 1; i <= n; ++i) {
        pair<int, int> sq = make_pair(pts[i].x / v, pts[i].y / v);
        for (int d1 = -3; d1 <= 0; ++d1) {
            for (int d2 = -3; d2 <= 3; ++d2) {
                pair<int, int> nsq = make_pair(max(0, sq.first + d1),
                                               max(0, sq.second + d2));
                for (int j : hsh[_(nsq)])
                    if (unite(i, j, v))
                        return true;
            }
        }
        hsh[_(sq)].push_back(i);
    }
    return false;
}

inline bool cmp(Point p1, Point p2) {
    if (p1.x != p2.x)
        return p1.x < p2.x;
    return p1.y < p2.y;
}

int main(void) {
   // freopen("drzava.in", "r", stdin);
   // freopen("drzava.out", "w", stdout);
    int n, k;
    cin >> n >> k; _k = k;
    for (int i = 1; i <= n; ++i) {
        cin >> pts[i].x >> pts[i].y >> pts[i].c;
        pts[i].c %= k;
    }
    sort(pts + 1, pts + n + 1, cmp);
    double le = 0, ri = CNS * 2;
    for (int i = 1; i <= 100; ++i) {
        double md = (le + ri) / 2;
        if (solve(n, k, md))
            ri = md;
        else
            le = md;
    }
    cout << setprecision(3) << fixed << le;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 15992 KB Output is correct
2 Correct 130 ms 16096 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 146 ms 16012 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 15992 KB Output is correct
2 Correct 144 ms 16308 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 130 ms 16120 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 16008 KB Output is correct
2 Correct 141 ms 16172 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 137 ms 15992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 15992 KB Output is correct
2 Correct 144 ms 16324 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 15964 KB Output is correct
2 Correct 145 ms 16132 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 15992 KB Output is correct
2 Correct 931 ms 25668 KB Output is correct

Subtask #10
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 15968 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 16008 KB Output is correct
2 Execution timed out 1074 ms 31632 KB Time limit exceeded

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 123 ms 16092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 16012 KB Output is correct
2 Execution timed out 1071 ms 31012 KB Time limit exceeded

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 15968 KB Output is correct
2 Execution timed out 1050 ms 31152 KB Time limit exceeded

Subtask #15
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 16016 KB Output is correct
2 Execution timed out 1063 ms 31204 KB Time limit exceeded

Subtask #16
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 15992 KB Output is correct
2 Execution timed out 1047 ms 30692 KB Time limit exceeded

Subtask #17
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 16120 KB Output is correct
2 Execution timed out 1071 ms 31888 KB Time limit exceeded

Subtask #18
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 16004 KB Output is correct
2 Execution timed out 1064 ms 29948 KB Time limit exceeded

Subtask #19
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 16032 KB Output is correct
2 Execution timed out 1080 ms 28836 KB Time limit exceeded

Subtask #20
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 125 ms 15992 KB Output isn't correct
2 Halted 0 ms 0 KB -