oj.uz

Submission #671364

# Submission time Handle Problem Language Result Execution time Memory
671364 2022-12-13T01:03:03 Z havingfun854 Mobile (BOI12_mobile) C++11
60 / 100
 1000 ms 28980 KB 
// https://oj.uz/problem/view/BOI12_mobile
#include <bits/stdc++.h>
using namespace std;

#define forint(i, from, toinc) for (int i = from; i <= toinc; ++i)
#define sq(x) (x)*(x)
#define all(x) x.begin(), x.end()

void fio()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
#ifdef USEFILE
    freopen("mobile.in", "r", stdin);
    freopen("mobile.out", "w", stdout);
#endif
}

/*
    some observations:

    if we have 2 towers with the same x, (x, y1) and (x, y2),
    we only need to keep the one with the smallest abs y value,
    let's say |y1| <= |y2|, then we can safely forget (x, y2), because for any
    point on the x axis, it will always be closer (<=) to (x, y1) than to (x, y2).

    we do a simple binary search on distance d to see if all points between [0,L]
    can be covered by d.
 */

struct Point {
    int x,y;
};
struct Range {
    double from, to;
    bool operator<(const Range &o) const {
        return from == o.from ? to > o.to : from < o.from;
        // same from rank the one with the larger to first
    }
};

int tcnt;                   // tower count
vector<Point> towers;
int len;                    // all points on (0,0) to (len,0) to the towers
vector<Range> ranges;
int rcnt;

void debug()
{
    cerr << "highway from (0,0) to (" << len << ",0)" << endl;

    cerr << tcnt << " towers:";
    forint(i, 0, tcnt-1) {
        cerr << " " << towers[i].x << "," << towers[i].y;
    }
    cerr << endl;

    cerr << rcnt << " ranges:";
    forint(i, 0, rcnt-1) {
        cerr << " [" << ranges[i].from << "," << ranges[i].to << "]";
    }
    cerr << endl;
}

void rdata()
{
    cin >> tcnt >> len;

    int lastx, lasty;       // lasty >= 0
    cin >> lastx >> lasty;
    lasty = abs(lasty);

    forint(i, 1, tcnt-1) {
        int x, y;
        cin >> x >> y;
        if (x != lastx) {
            towers.push_back({lastx, lasty});
            lastx = x;
            lasty = abs(y);
        } else if (abs(y) < abs(lasty)) {
            lasty = abs(y);
        }
        if (i == tcnt-1) {
            towers.push_back({lastx, lasty});
        }
    }

    tcnt = (int)towers.size();
}


bool can_cover(double d)
{
    ranges.clear();

    forint(i, 0, tcnt-1) {
        double x = towers[i].x;
        double y = towers[i].y;
        if (d > y) {
            double dx = sqrt(sq(d) - sq(y));
            ranges.push_back({x-dx, x+dx});
        }
    }
    rcnt = (int)ranges.size();

    sort(all(ranges));
    int ri = 0;
    while (ri < rcnt && ranges[ri].to < 0) {
        ri++;
    }

#ifdef DEBUG
    debug();
#endif

    double right = 0;
    forint(i, ri, rcnt-1) {
        if (ranges[i].from <= right) {
            right = max(ranges[i].to, right);
        } else {
            break;
        }
    }

    bool res = right >= len;
#ifdef DEBUG
    cerr << "d=" << d << " can" << (res ? "" : "not") << " cover all" << endl;
#endif
    return res;
}

int main()
{
    fio();
    rdata();
#ifdef DEBUG
    debug();
#endif

    double dends2 = sq(towers[0].x + len) + sq(towers[0].y);
    dends2 = max(dends2, sq(1.0 * towers[tcnt-1].x) + sq(towers[tcnt-1].y));
    double dmax = sqrt(dends2);

    double d = dmax+1;
    for (double step = dmax; step > 1e-4; step /= 2) {
        while (d >= 0 && can_cover(d-step)) {
            d -= step;
        }
    }
    cout << fixed << setprecision(3) << d << '\n';

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 11 ms 468 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 468 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 11 ms 468 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 4 ms 468 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 11 ms 508 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 3028 KB Output is correct
2 Correct 173 ms 1880 KB Output is correct
3 Correct 152 ms 1880 KB Output is correct
4 Correct 29 ms 2384 KB Output is correct
5 Correct 7 ms 340 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 508 KB Output is correct
2 Correct 22 ms 1304 KB Output is correct
3 Correct 27 ms 2392 KB Output is correct
4 Correct 29 ms 2384 KB Output is correct
5 Correct 33 ms 2512 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 3156 KB Output is correct
2 Correct 152 ms 1900 KB Output is correct
3 Correct 392 ms 2392 KB Output is correct
4 Correct 41 ms 3284 KB Output is correct
5 Correct 20 ms 1064 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 1808 KB Output is correct
2 Correct 128 ms 1720 KB Output is correct
3 Correct 61 ms 724 KB Output is correct
4 Correct 42 ms 3268 KB Output is correct
5 Correct 34 ms 2476 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 3256 KB Output is correct
2 Correct 129 ms 1752 KB Output is correct
3 Correct 59 ms 824 KB Output is correct
4 Correct 41 ms 3280 KB Output is correct
5 Correct 36 ms 3056 KB Output is correct

Subtask #12
0 / 5.0

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

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 716 KB Output is correct
2 Correct 878 ms 12532 KB Output is correct
3 Correct 505 ms 3148 KB Output is correct
4 Correct 203 ms 12520 KB Output is correct
5 Correct 179 ms 12100 KB Output is correct

Subtask #14
0 / 5.0

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

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 492 KB Output is correct
2 Correct 943 ms 21456 KB Output is correct
3 Correct 416 ms 9140 KB Output is correct
4 Correct 259 ms 28980 KB Output is correct
5 Correct 221 ms 25540 KB Output is correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 22320 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 588 KB Output is correct
2 Execution timed out 1089 ms 22176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 23088 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 456 KB Output is correct
2 Execution timed out 1098 ms 23028 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 24688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 444 KB Output is correct
2 Execution timed out 1088 ms 24480 KB Time limit exceeded
3 Halted 0 ms 0 KB -