Submission #91769

# Submission time Handle Problem Language Result Execution time Memory
91769 2018-12-30T02:26:46 Z updown1 Mobile (BOI12_mobile) C++17
23 / 100
828 ms 8568 KB
/*
binary search on the answer
to test a value x, for all the circles come up with ranges of the line that is covered if the circle has a radius x
find the minimum value x s.t. the whole line is covered
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, N)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e endl//"\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define int ll
#define double long double
const int MAXN=100000, INF=1000000000000000000;
///500,000,000
int N, L;
pair<double, double> pts[MAXN], rng[MAXN];

bool full(double rr) {
    /// make the ranges
    ffi {
        int x = pts[i].a, y = pts[i].b;
        if (y*y > rr*rr) {rng[i] = mp(0, 0); continue;}
        double l = x - sqrt(rr*rr-y*y); double r = x + sqrt(rr*rr-y*y);
        l = max(l, (double) 0); l = min(l, (double)L);
        r = max(r, (double) 0); r = min(r, (double)L);
        rng[i] = mp(l, r);
    }
    //exit(0);
    sort(rng, rng+N);
    //w<< rr<<e; ffi w<< rng[i].a s rng[i].b<<e;
    /// see if the whole range is covered
    double far = 0;
    ffi {
        if (rng[i].a > far) return false;
        far = max(far, rng[i].b);
    }
    if (far >= L) return true;
}

main() {
    //ifstream cin("test.in");
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> L;
	ffi cin >> pts[i].a >> pts[i].b;
	double a = 0, b = 2236067978;
	while (b-a > .00001) {
        double mid = (a+b)/2;
        if (full(mid)) b = mid;
        else a = mid;
	}
	w<< fixed << setprecision(4) <<a<<e;
}

Compilation message

mobile.cpp:50:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
mobile.cpp: In function 'bool full(long double)':
mobile.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 15 ms 504 KB Output is correct
2 Incorrect 14 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 28 ms 748 KB Output is correct
2 Correct 21 ms 760 KB Output is correct
3 Correct 34 ms 632 KB Output is correct
4 Correct 30 ms 760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 28 ms 632 KB Output is correct
2 Correct 22 ms 772 KB Output is correct
3 Correct 30 ms 632 KB Output is correct
4 Correct 28 ms 760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 732 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 492 ms 5200 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 542 ms 5408 KB Output is correct
2 Correct 494 ms 4828 KB Output is correct
3 Correct 569 ms 5496 KB Output is correct
4 Correct 554 ms 5496 KB Output is correct
5 Correct 606 ms 6008 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 520 ms 6016 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 520 ms 6768 KB Output is correct
2 Correct 670 ms 8056 KB Output is correct
3 Correct 828 ms 7692 KB Output is correct
4 Correct 703 ms 8568 KB Output is correct
5 Correct 689 ms 7928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 585 ms 6776 KB Output is correct
2 Correct 656 ms 6904 KB Output is correct
3 Correct 824 ms 7800 KB Output is correct
4 Correct 701 ms 8540 KB Output is correct
5 Correct 706 ms 7928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 6904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 62 ms 6904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 6780 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 62 ms 6904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 7048 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 64 ms 6884 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 6904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 61 ms 6900 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 6904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 64 ms 6980 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -