oj.uz

Submission #51386

# Submission time Handle Problem Language Result Execution time Memory
51386 2018-06-17T18:55:21 Z adamczh1 Sure Bet (CEOI17_sure) C++17
60 / 100
 89 ms 3660 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN = 1e5 + 5;

int n;
double a[MAXN], b[MAXN];
ll A[MAXN], B[MAXN];

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%lf %lf", &a[i], &b[i]);
		A[i] = round(a[i] * 10000);
		B[i] = round(b[i] * 10000);
	}
	sort(A, A + n);
	reverse(A, A + n);
	sort(B, B + n);
	reverse(B, B + n);
	ll lo = 0;
	ll hi = 1e18;
	while (lo < hi) {
		ll mid = (lo + hi + 1) / 2;
		ll x = 0, y = 0;
		int ai = 0, bi = 0;
		while (ai < n || bi < n) {
			if (x < mid) {
				x += A[ai++] - 10000;
				y -= 10000;
			}
			if (y < mid) {
				x -= 10000;
				y += B[bi++] - 10000;
			}
			if (x >= mid && y >= mid) {
				break;
			}
		}
		if (x >= mid && y >= mid) {
			lo = mid;
		} else {
			hi = mid - 1;
		}
	}
	printf("%.4lf", 0.0001 * lo);
	return 0;
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
sure.cpp:14: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 3 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 516 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 3 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 3 ms 632 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 3 ms 392 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 632 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 85 ms 3608 KB Output is correct
18 Correct 87 ms 3648 KB Output is correct
19 Correct 88 ms 3648 KB Output is correct
20 Incorrect 89 ms 3660 KB Output isn't correct
21 Halted 0 ms 0 KB -