oj.uz

Submission #51384

# Submission time Handle Problem Language Result Execution time Memory
51384 2018-06-17T18:50:15 Z adamczh1 Sure Bet (CEOI17_sure) C++17
60 / 100
 121 ms 7748 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;
		int ai = 0, bi = 0;
		while (ai < n || bi < n) {
			if (x < mid) {
				x += a[ai++] - 1;
				y--;
			}
			if (y < mid) {
				x--;
				y += b[bi++] - 1;
			}
			if (x >= mid && y >= mid) {
				break;
			}
		}
		if (x >= mid && y >= mid) {
			lo = mid;
		} else {
			hi = mid;
		}
	}
	printf("%.4lf", lo);
	return 0;
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
sure.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lf %lf", &a[i], &b[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 448 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 448 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Correct 2 ms 484 KB Output is correct
9 Correct 2 ms 524 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 652 KB Output is correct
14 Correct 3 ms 684 KB Output is correct
15 Correct 3 ms 852 KB Output is correct
16 Correct 4 ms 904 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 432 KB Output is correct
5 Correct 2 ms 432 KB Output is correct
6 Correct 3 ms 448 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Correct 2 ms 484 KB Output is correct
9 Correct 2 ms 524 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 652 KB Output is correct
14 Correct 3 ms 684 KB Output is correct
15 Correct 3 ms 852 KB Output is correct
16 Correct 4 ms 904 KB Output is correct
17 Correct 103 ms 3796 KB Output is correct
18 Correct 121 ms 5064 KB Output is correct
19 Correct 110 ms 6364 KB Output is correct
20 Incorrect 117 ms 7748 KB Output isn't correct
21 Halted 0 ms 0 KB -