# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
51382 | 2018-06-17T18:48:20 Z | adamczh1 | Sure Bet (CEOI17_sure) | C++17 | 3 ms | 460 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int n; double a[MAXN], b[MAXN]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%lf %lf", &a[i], &b[i]); } sort(a, a + n); reverse(a, a + n); sort(b, b + n); reverse(b, b + n); double lo = 0; double hi = 2e9; for (int iter = 0; iter < 100; iter++) { double mid = (lo + hi) / 2; double x = 0, y = 0; for (int i = 0; i < n; i++) { if (x < mid) { x += a[i] - 1; y--; } if (y < mid) { x--; y += b[i] - 1; } } if (x >= mid && y >= mid) { lo = mid; } else { hi = mid; } } printf("%.4lf", lo); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 460 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 460 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 428 KB | Output is correct |
5 | Correct | 2 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 460 KB | Output isn't correct |